Title :
A New Method for Concurrency in B-Trees
Author :
Kwong, Yat-Sang ; Wood, Derick
Author_Institution :
MICOM Company
fDate :
5/1/1982 12:00:00 AM
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.
Keywords :
B-trees; concurrent operations; lock-coupling; side-branching; Computer science; Concurrency control; Concurrent computing; Costs; Councils; Data structures; Databases; Interleaved codes; Particle separators; System recovery; B-trees; concurrent operations; lock-coupling; side-branching;
Journal_Title :
Software Engineering, IEEE Transactions on
DOI :
10.1109/TSE.1982.235251
