Concurrency Control in B+-Trees Databases Using Preparatory Operations

Summary: Introduces B+-tree concurrency control using preparatory early node splits and concatenations, performed before they are required. By locking only the current node and its parent, the scheme reduces lock scope and increases concurrency over existing protocols. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: ha50254101a22ea9f
Venue: VLDB
Year: 1985
Pagerank: 8.4135005e-05
Overall Rank: 2,471 | 83.39%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Y. Mond (Technion)
2. Y. Raz (Technion)

BibTeX Citation

@article{mond_vldb85,
        title = {{Concurrency Control in B+-Trees Databases Using Preparatory Operations}},
        author = {Mond, Y. and Raz, Y.},
        journal = {PVLDB},
        series = {{VLDB} '85},
        pages = {331},
        year = {1985}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,692	Performance of B-Tree Concurrency Control Algorithms	1991	SIGMOD	9.8570044e-05
5,661	A Framework for the Performance Analysis of Concurrent B-tree Algorithms	1990	PODS	6.0475065e-05
7,164	Operation Specific Locking In B-Trees	1987	PODS	5.5954112e-05
8,938	Concurrent Operations in Extendible Hashing	1986	VLDB	5.2559789e-05
13,294	Index Concurrency Control in Firm Real-Time DBMS	1995	VLDB	4.9793485e-05
13,326	New Concurrency Control Algorithms for Accessing and Compacting B-Trees	1994	VLDB	4.9793485e-05
13,437	Concurrent Set Manipulation Without Locking	1988	PODS	4.9793485e-05

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	2,297	Concurrency Control of Nested Transactions Accessing B-Trees	1989	PODS
2	471	Concurrent Operations on B-Trees with Overtaking	1985	PODS
3	5,661	A Framework for the Performance Analysis of Concurrent B-tree Algorithms	1990	PODS
4	4,904	Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms	1984	PODS
5	3,170	Access Method Concurrency with Recovery	1992	SIGMOD
6	2,263	Concurrency and Recovery in Generalized Search Trees	1997	SIGMOD
7	7,164	Operation Specific Locking In B-Trees	1987	PODS
8	13,326	New Concurrency Control Algorithms for Accessing and Compacting B-Trees	1994	VLDB
9	13,465	Concurrency Control in Database Structures with Relaxed Balance	1987	PODS
10	1,692	Performance of B-Tree Concurrency Control Algorithms	1991	SIGMOD