Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
In this paper we present a concurrent extension of the insertion algorithm used in the data structure of [2] which is a data structure having buckets instead of leaves.