Concurrent operations on B*-trees with overtaking
Journal of Computer and System Sciences
Concurrent search structure algorithms
ACM Transactions on Database Systems (TODS)
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
B-trees with inserts and deletes: why free-at-empty is better than merge-at-half
PODS '89 Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Implementing deletion in B+-trees
ACM SIGMOD Record
On-line reorganization of sparsely-populated B+-trees
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
Real-time index concurrency control
ACM SIGMOD Record
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Performance of B+ tree concurrency control algorithms
The VLDB Journal — The International Journal on Very Large Data Bases
Semantically Consistent Schedules for Efficient and Concurrent B-Tree Restructuring
Proceedings of the Eighth International Conference on Data Engineering
A New Method for Concurrency in B-Trees
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
As the B-tree index could be a peformance bottleneck in database systems, concurrent B-tree algorithms have been intensively studied to improve concurrency of B-tree accesses in the literature. In this paper we propose a new concurrent B+ -tree algorithm for high concurrency and an eficient tree restructuring method. Because the proposed method of tree restructuring always preserves a semantic consistency of the B+ -tree, a key searcher need not require any lock for a range search as well as a single-key search. To maintain correctly the linkfields constructed at the leaf level, we make each leaf node contain two key-range indicators, and develop a tree restructuring method using these key-range indicators.