ARIES/IM: an efficient and high concurrency index management method using write-ahead logging
SIGMOD '92 Proceedings of the 1992 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
A method for on-line reorganization of a database
IBM Systems Journal
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Online reorganization of databases
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
In this paper we present an efficient method to do online rebuild of a B+-tree index. This method has been implemented in Sybase Adaptive Server Enterprise (ASE) Version 12.0. It provides high concurrency, does minimal amount of logging, has good performance and does not deadlock with other index operations. It copies the index rows to newly allocated pages in the key order so that good space utilization and clustering are achieved. The old pages are deallocated during the process. Our algorithm differs from the previously published online index rebuild algorithms in two ways. It rebuilds multiple leaf pages and then propagates the changes to higher levels. Also, while propagating the leaf level changes to higher levels, level 11 pages are reorganized, eliminating the need for a separate pass. Our performance study shows that our approach results in significant reduction in logging and CPU time. Also, our approach uses the same concurrency control mechanism as split and shrink operations, which made it attractive for implementation.