A concurrent Blink-tree algorithm using a cooperative locking protocol

Authors:
Sung-Chae Lim;Joonseon Ahn;Myoung Ho Kim
Affiliations:
WST Lab., Korea Wisenut Inc., Seoul, Korea;Hankuk Aviation University, Koyang, Kyounggido, Korea;Korea Advanced Institute of Science and Technology, Taejon, Korea
Venue:
BNCOD'03 Proceedings of the 20th British national conference on Databases
Year:
2003

Citing 15
Cited 1

Concurrent operations on B*-trees with overtaking

Journal of Computer and System Sciences
Concurrent search structure algorithms

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
The performance of current B-tree algorithms

ACM Transactions on Database Systems (TODS)
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
Concurrency control in a dynamic search structure

ACM Transactions on Database Systems (TODS)
Efficient locking for concurrent operations on B-trees

ACM Transactions on Database Systems (TODS)
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
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

Helper locks for fork-join parallel programming

Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new concurrent Blink-tree algorithm that provides a concurrent tree restructuring mechanism for handling underflow nodes as well as overflow nodes. Our algorithm does not require any lock for downward searching and preserves bottom-up tree restructuring without deadlock. To this end, we develop a new locking mechanism for inserters and deleters and a node update rule that preserves the semantical tree consistency during tree restructuring. Our analytical experiment shows that the overhead of additional disk I/O is acceptable.