Sciweavers

VLDB
1994
ACM

New Concurrency Control Algorithms for Accessing and Compacting B-Trees

14 years 3 months ago
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.
V. W. Setzer, Andrea Zisman
Added 10 Aug 2010
Updated 10 Aug 2010
Type Conference
Year 1994
Where VLDB
Authors V. W. Setzer, Andrea Zisman
Comments (0)