New Concurrency Control Algorithms for Accessing and Compacting B-Trees

Summary: Survey of B-tree concurrency control; proposes a new approach using variable-length indices, a single lock for access, and preemptive splits with delayed catenations. Also presents a concurrent compaction algorithm with its own lock type. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 8196
Venue: VLDB
Year: 1994
Pagerank: 4.1945683e-05
Overall Rank: 12,843 | 10.66%
DOI: -

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. V. W. Setzer
2. A. Zisman

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
282	Concurrent Operations on B-Trees with Overtaking	1985	PODS	0.00029057817
2,092	Concurrency Control In B+-Trees Databases Using Preparatory Operations	1985	VLDB	9.560141e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
3,244	Access Method Concurrency with Recovery	1992	SIGMOD	7.3262881e-05
12,977	Concurrency Control in Database Structures with Relaxed Balance	1987	PODS	4.1945683e-05
3,039	High-Concurrency Locking in R-Trees	1995	VLDB	7.6708607e-05
8,049	Contention and Space Management in B-Trees	2021	CIDR	4.5973972e-05
3,596	Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms	1984	PODS	6.9357398e-05
1,243	Concurrency Control of Nested Transactions Accessing B-Trees	1989	PODS	0.00013096387
5,239	A Framework for the Performance Analysis of Concurrent B-tree Algorithms	1990	PODS	5.6106291e-05
6,250	Operation Specific Locking In B-Trees	1987	PODS	5.1383127e-05
282	Concurrent Operations on B-Trees with Overtaking	1985	PODS	0.00029057817
1,573	Performance of B-Tree Concurrency Control Algorithms	1991	SIGMOD	0.00011295081