Semantics and implementation of schema evolution in object-oriented databases
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A stochastic approach for clustering in object bases
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Compensation-based on-line query processing
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Algorithms for creating indexes for very large tables without quiescing updates
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Atomic incremental garbage collection and recovery for a large stable heap
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Partition selection policies in object database garbage collection
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Self-adaptive, on-line reclustering of complex object data
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
On-line reorganization of sparsely-populated B+-trees
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Two techniques for on-line index modification in shared nothing parallel databases
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
The Architecture of the Dalí Main-Memory Storage Manager
Multimedia Tools and Applications
Performance of On-Line Index Construction Algorithms
EDBT '92 Proceedings of the 3rd International Conference on Extending Database Technology: Advances in Database Technology
Storage Reclamation and Reorganization in Client-Server Persistent Object Stores
Proceedings of the Tenth International Conference on Data Engineering
Replication-Based Incremental Copying Collection
IWMM '92 Proceedings of the International Workshop on Memory Management
Safely and Efficiently Updating References During On-line Reorganization
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Principles of Transaction-Based On-Line Reorganization
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Dalí: A High Performance Main Memory Storage Manager
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
A Performance Evaluation of OID Mapping Techniques
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Efficient Incremental Garbage Collection for Client-Server Object Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Garbage Collection in Object Oriented Databases Using Transactional Cyclic Reference Counting
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Online Scaling in a Highly Available Database
Proceedings of the 27th International Conference on Very Large Data Bases
Opportunistic Prioritised Clustering Framework (OPCF)
Proceedings of the International Symposium on Objects and Databases
TMOS: A Transactional Garbage Collector
POS-9 Revised Papers from the 9th International Workshop on Persistent Object Systems
QoSMig: Adaptive Rate-Controlled Migration of Bulk Data in Storage Systems
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Online reorganization of databases
ACM Computing Surveys (CSUR)
An on-line reorganization framework for SAN file systems
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
| Hi-index | 0.00 |
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.