Concurrent operations on B*-trees with overtaking
Journal of Computer and System Sciences
A theoretical foundation of multi-level concurrency control
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Concurrent search structure algorithms
ACM Transactions on Database Systems (TODS)
Access methods for multiversion data
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Proceedings of the sixteenth international conference on Very large databases
The hB-tree: a multiattribute indexing method with good guaranteed performance
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
MLR: a recovery method for multi-level systems
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Access method concurrency with recovery
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
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
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The hBP-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
The hB $^\Pi$-tree: a multi-attribute index supporting concurrency, recovery and node consolidation
The VLDB Journal — The International Journal on Very Large Data Bases
Process structuring, synchronization, and recovery using atomic actions
Proceedings of an ACM conference on Language design for reliable software
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
A Theory of Transactions on Recoverable Search Trees
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Online Data Structures in External Memory
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Online Data Structures in External Memory
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
View Serializable Updates of Concurrent Index Structures
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Simple, Robust and Highly Concurrent B-trees with Node Deletion
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Concurrency control and recovery for balanced B-link trees
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
B-tree concurrency control and recovery in page-server database systems
ACM Transactions on Database Systems (TODS)
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Online reorganization of databases
ACM Computing Surveys (CSUR)
A B-Tree index extension to enhance response time and the life cycle of flash memory
Information Sciences: an International Journal
The RDF-3X engine for scalable management of RDF data
The VLDB Journal — The International Journal on Very Large Data Bases
A survey of B-tree logging and recovery techniques
ACM Transactions on Database Systems (TODS)
A snappy b+-trees index reconstruction for main-memory storage systems
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Shepherdable indexes and persistent search services for mobile users
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
Reduced split/merge propagation in a modified B-link tree design
Journal of Computational Methods in Sciences and Engineering
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
Although many suggestions have been made for concurrency in B $^+$-trees, few of these have considered recovery as well. We describe an approach which provides high concurrency while preserving well-formed trees across system crashes. Our approach works for a class of index trees that is a generalization of the B $^{\rm link}$-tree. This class includes some multi-attribute indexes and temporal indexes. Structural changes in an index tree are decomposed into a sequence of atomic actions, each one leaving the tree well-formed and each working on a separate level of the tree. All atomic actions on levels of the tree above the leaf level are independent of database transactions, and so are of short duration. Incomplete structural changes are detected in normal operations and trigger completion.