New Concurrency Control Algorithms for Accessing and Compacting B-Trees

This paper initially presents a brief but fairly exhaustive survey of solutions to the concurrency control problem for B-trees. We then propose a new solution, which is characterized by the use of variable-length indices, the employment of a single lock type for the usual accessoperations and preemptive splits aswell as delayed catenations and subdivisions. We also introduce a new compaction algorithm and its concurrent execution, using a new lock type.

• Type: Conference
• Year: 1994
• Where: VLDB
• Authors: V. W. Setzer, Andrea Zisman
• Keywords: Concurrency Control Problem, Database, Lock Type, Single Lock Type, VLDB 1994