Database Paper Browser

Back to papers

Concurrency Control In B+-Trees Databases Using Preparatory Operations

Summary: Preparatory early splitting/merging in B+-trees enables locking only the current node and its parent, boosting concurrency. Grounded in path-safety and two-lock precedents (Keshet, Mond), it yields a minimal protocol with shrinking locked region during updates. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7713
Venue
VLDB
Year
1985
Pagerank
9.560141e-05
Overall Rank
2,092 | 85.45%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank Citing Paper Year Venue Pagerank
1,573 Performance of B-Tree Concurrency Control Algorithms 1991 SIGMOD 0.00011295081
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
8,573 Concurrent Operations in Extendible Hashing 1986 VLDB 4.4937074e-05
12,810 Index Concurrency Control in Firm Real-Time DBMS 1995 VLDB 4.1945683e-05
12,843 New Concurrency Control Algorithms for Accessing and Compacting B-Trees 1994 VLDB 4.1945683e-05
12,952 Concurrent Set Manipulation Without Locking 1988 PODS 4.1945683e-05
Previous Page 1 / 1 Next

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
Previous Page 1 / 1 Next

Semantically Similar Papers