Please use this identifier to cite or link to this item:
Title: On-line reorganization in object databases
Keywords: Object-Oriented Databases
Transaction Processing
Software Performance Evaluation
Storage Management
Software Fault Tolerance
Issue Date: 2000
Publisher: Association for Computing Machinery
Citation: Proceedings of the ACM SIGMOD International Conference on Management of Data, Dallas, Texas, USA, 16-18 May 2000, 58-69
Abstract: Reorganization of objects in an object databases is an important component of several operations like compaction, clustering, and schema evolution. The high availability requirements (24 × 7 operation) of certain application domains requires reorganization to be performed on-line with minimal interference to concurrently executing transactions. In this paper, we address the problem of on-line reorganization in object databases, where a set of objects have to be migrated from one location to another. Specifically, we consider the case where objects in the database may contain physical references to other objects. Relocating an object in this case involves finding the set of objects (parents) that refer to it, and modifying the references in each parent. We propose an algorithm called the Incremental Reorganization Algorithm (IRA) that achieves the above task with minimal interference to concurrently executing transactions. The IRA algorithm holds locks on at most two distinct objects at any point of time. We have implemented IRA on Brahma, a storage manager developed at IIT Bombay, and conducted an extensive performance study. Our experiments reveal that IRA makes on-line reorganization feasible, with very little impact on the response times of concurrently executing transactions and on overall system throughput. We also describe how the IRA algorithm can handle system failures.
URI: 10.1145/342009.335381
ISBN: 1-58113-217-4
Appears in Collections:Proceedings papers

Files in This Item:
File Description SizeFormat 
4680154321.pdf351.87 kBAdobe PDFThumbnail

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.