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
A concurrent Blink-tree algorithm using a cooperative locking protocol
BNCOD'03 Proceedings of the 20th British national conference on Databases
| Hi-index | 0.00 |
In this paper we study the problem of supporting concurrent operations in B-trees and their variants. A survey of previous work is given and two basic types of solutions to this problem are identified. A new solution with a greater degree of concurrency is proposed. As solutions are surveyed or presented we identify useful techniques which have wider applicability. In particular, we introduce the technique of side-branching in our new solution.