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
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
WSEAS Transactions on Computers
Incrementally distributed B+ trees: approaches and challenges
Proceedings of the 47th Annual Southeast Regional Conference
A B-Tree index extension to enhance response time and the life cycle of flash memory
Information Sciences: an International Journal
Reduced split/merge propagation in a modified B-link tree design
Journal of Computational Methods in Sciences and Engineering
An efficient B+-tree design for main-memory database systems with strong access locality
Information Sciences: an International Journal
| Hi-index | 0.00 |
Database systems frequently establish the B-tree style indexes for fast access to data records. Since the B-tree index could be a performance bottleneck, many concurrent algorithms have been proposed to improve concurrency of B-tree accesses. In this paper we propose a new concurrent B+-tree algorithm that provides high concurrency and an efficient tree restructuring method. As the proposed method of tree restructuring always preserves a semantically consistent state of the B+-tree, a key searcher need not require any lock for a range search and a single-key search. When handling overflow or underflow in leaf nodes, it is very crucial to maintain correctly the link fields at the leaf level constructed for efficient range searches. For this, we make each leaf node contain two key-range indicators and develop a tree restructuring method using these key-range indicators. In addition, since we prevent update processes from accessing nodes updated by others that do not commit, a recovery capability on the proposed B+-tree can be easily achieved based on the record-oriented redo/undo.