New Concurrency Control Algorithms for Accessing and Compacting B-Trees
V. W. Setzer, Andrea Zisman · 1994
This paper initially presents a brief but fairly exhaustive survey of solutions to the concur-rency control problem for B-trees. We then propose a new solution, which is character-ized by the use of variable-length indices, the employment of a single lock type for the usual access operations and preemptive splits as well as delayed catenations and subdivisions. We also introduce a new compaction algorithm and its concurrent execution, using a new lock type. 1