Concurrent operations on B*-trees with overtaking
Journal of Computer and System Sciences
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
The hB-tree: a multiattribute indexing method with good guaranteed performance
ACM Transactions on Database Systems (TODS)
Performance of B-tree concurrency control algorithms
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
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
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Process structuring, synchronization, and recovery using atomic actions
Proceedings of an ACM conference on Language design for reliable software
MLR: a recovery method for multi-level systems
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Recovery protocols for shared memory database systems
SIGMOD '95 Proceedings of the 1995 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
Efficient transaction support for dynamic information retrieval systems
SIGIR '96 Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval
Concurrency and recovery in generalized search trees
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
Intensive Data Management in Parallel Systems: A Survey
Distributed and Parallel Databases
Performance of B+ tree concurrency control algorithms
The VLDB Journal — The International Journal on Very Large Data Bases
Real-Time Index Concurrency Control
IEEE Transactions on Knowledge and Data Engineering
Restructuring the concurrent B+-tree with non-blocked search operations
Information Sciences—Informatics and Computer Science: An International Journal
A Theory of Transactions on Recoverable Search Trees
ICDT '01 Proceedings of the 8th International Conference on Database Theory
High-Performance Extensible Indexing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Repeating History Beyond ARIES
VLDB '99 Proceedings of the 25th 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
Exploiting A History Database for Backup
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Index Concurrency Control in Firm Real-Time Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Redo Recovery after System Crashes
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
High-Concurrency Locking in R-Trees
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
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
A Restructuring Method for the Concurrent B+-Tree Based on Semantic Consistency
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
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
Concurrency control in hierarchical multidatabase systems
The VLDB Journal — The International Journal on Very Large Data Bases
Concurrency and recovery for index trees
The VLDB Journal — The International Journal on Very Large Data Bases
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)
B-trees, shadowing, and clones
ACM Transactions on Storage (TOS)
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Concurrency control and recovery for multiversion database structures
Proceedings of the 2nd PhD workshop on Information and knowledge management
Online reorganization of databases
ACM Computing Surveys (CSUR)
Gchord: indexing for multi-attribute query in p2p system with low maintenance cost
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
A survey of B-tree logging and recovery techniques
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
Providing high concurrency in B+-trees has been studied extensively. But few efforts have been documented for combining concurrency methods with a recovery scheme that preserves well-formed trees across system crashes. We describe an approach for this that works for a class of index trees that is a generalization of the Blink-tree. A major feature of our method is that it works with a range of different recovery methods. It achieves this by decomposing structure changes in an index tree 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.