ABSTRACT
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.
INDEX TERMS
side-branching, B-trees, concurrent operations, lock-coupling
CITATION
null Yat-Sang Kwong, D. Wood, "A New Method for Concurrency in B-Trees", IEEE Transactions on Software Engineering, vol. 8, no. , pp. 211-222, May 1982, doi:10.1109/TSE.1982.235251
