Database Paper Browser

Back to papers

Performance of B-Tree Concurrency Control Algorithms

Summary: Simulation-based study of B-tree concurrency control in a centralized DBMS. B-link algorithms yield highest concurrency and best throughput; updater-lock-coupled exclusive locks underperform vs. optimistic index descent under varied contention. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2551
Venue
SIGMOD
Year
1991
Pagerank
0.00011293832
Overall Rank
1,573 | 89.07%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Rank Citing Paper Year Venue Pagerank
1,766 Query and Update Efficient B+-Tree Based Indexing of Moving Objects 2004 VLDB 0.00010611043
1,999 PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors 2011 VLDB 9.8287642e-05
2,519 Concurrency and Recovery in Generalized Search Trees 1997 SIGMOD 8.6048934e-05
3,042 High-Concurrency Locking in R-Trees 1995 VLDB 7.6669657e-05
3,251 Access Method Concurrency with Recovery 1992 SIGMOD 7.3198815e-05
4,773 Latch-free Synchronization in Database Systems: Silver Bullet or Fool's Gold? 2017 CIDR 5.9280553e-05
6,765 The hBII-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation 1995 VLDB 4.9285619e-05
7,300 Effectively Indexing Uncertain Moving Objects for Predictive Queries 2009 VLDB 4.7640746e-05
7,686 Concurrent Log-Structured Memory for Many-Core Key-Value Stores 2018 VLDB 4.675046e-05
9,945 AB-tree: Index for Concurrent Random Sampling and Updates 2022 VLDB 4.240067e-05
11,231 Blink-hash: An Adaptive Hybrid Index for In-Memory Time-Series Databases 2023 VLDB 4.1905499e-05
12,819 Index Concurrency Control in Firm Real-Time DBMS 1995 VLDB 4.1905499e-05
12,896 Locking without Blocking: Making Lock Based Concurrent Data Structure Algorithms Nonblocking 1992 PODS 4.1905499e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

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

Rank Cited Paper Year Venue Pagerank
190 Models for Studying Concurrency Control Performance: Alternatives and Implications 1985 SIGMOD 0.00035797633
282 Concurrent Operations on B-Trees with Overtaking 1985 PODS 0.00029054939
1,275 Semantically-based Concurrency Control for Search Structures 1985 PODS 0.00012864455
2,095 Concurrency Control In B+-Trees Databases Using Preparatory Operations 1985 VLDB 9.5520284e-05
2,847 Utilization of B-trees with Inserts, Deletes and Modifies 1989 PODS 8.0287397e-05
5,239 A Framework for the Performance Analysis of Concurrent B-tree Algorithms 1990 PODS 5.6060584e-05
6,244 Operation Specific Locking In B-Trees 1987 PODS 5.1342001e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
3,603 Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms 1984 PODS 6.9282296e-05
3,042 High-Concurrency Locking in R-Trees 1995 VLDB 7.6669657e-05
282 Concurrent Operations on B-Trees with Overtaking 1985 PODS 0.00029054939
1,238 Concurrency Control of Nested Transactions Accessing B-Trees 1989 PODS 0.00013093624
6,244 Operation Specific Locking In B-Trees 1987 PODS 5.1342001e-05
2,950 The Performance Of Concurrency Control Algorithms For Database Management Systems 1984 VLDB 7.8274188e-05
12,988 Concurrency Control in Database Structures with Relaxed Balance 1987 PODS 4.1905499e-05
12,819 Index Concurrency Control in Firm Real-Time DBMS 1995 VLDB 4.1905499e-05
12,852 New Concurrency Control Algorithms for Accessing and Compacting B-Trees 1994 VLDB 4.1905499e-05
5,239 A Framework for the Performance Analysis of Concurrent B-tree Algorithms 1990 PODS 5.6060584e-05