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
2550
Venue
SIGMOD
Year
1991
Pagerank
0.00011295081
Overall Rank
1,573 | 89.06%
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,774 Query and Update Efficient B+-Tree Based Indexing of Moving Objects 2004 VLDB 0.00010604097
2,006 PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors 2011 VLDB 9.8101551e-05
2,516 Concurrency and Recovery in Generalized Search Trees 1997 SIGMOD 8.6106981e-05
3,039 High-Concurrency Locking in R-Trees 1995 VLDB 7.6708607e-05
3,244 Access Method Concurrency with Recovery 1992 SIGMOD 7.3262881e-05
4,998 Latch-free Synchronization in Database Systems: Silver Bullet or Fool's Gold? 2017 CIDR 5.7757413e-05
6,764 The hBII-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation 1995 VLDB 4.9330419e-05
7,365 Effectively Indexing Uncertain Moving Objects for Predictive Queries 2009 VLDB 4.7517889e-05
7,686 Concurrent Log-Structured Memory for Many-Core Key-Value Stores 2018 VLDB 4.6786758e-05
9,949 AB-tree: Index for Concurrent Random Sampling and Updates 2022 VLDB 4.2421586e-05
11,229 Blink-hash: An Adaptive Hybrid Index for In-Memory Time-Series Databases 2023 VLDB 4.1945683e-05
12,810 Index Concurrency Control in Firm Real-Time DBMS 1995 VLDB 4.1945683e-05
12,886 Locking without Blocking: Making Lock Based Concurrent Data Structure Algorithms Nonblocking 1992 PODS 4.1945683e-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.0003579699
282 Concurrent Operations on B-Trees with Overtaking 1985 PODS 0.00029057817
1,276 Semantically-based Concurrency Control for Search Structures 1985 PODS 0.00012883569
2,092 Concurrency Control In B+-Trees Databases Using Preparatory Operations 1985 VLDB 9.560141e-05
2,975 Utilization of B-trees with Inserts, Deletes and Modifies 1989 PODS 7.7893243e-05
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
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
3,596 Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms 1984 PODS 6.9357398e-05
3,039 High-Concurrency Locking in R-Trees 1995 VLDB 7.6708607e-05
282 Concurrent Operations on B-Trees with Overtaking 1985 PODS 0.00029057817
1,243 Concurrency Control of Nested Transactions Accessing B-Trees 1989 PODS 0.00013096387
6,250 Operation Specific Locking In B-Trees 1987 PODS 5.1383127e-05
2,950 The Performance Of Concurrency Control Algorithms For Database Management Systems 1984 VLDB 7.8329866e-05
12,977 Concurrency Control in Database Structures with Relaxed Balance 1987 PODS 4.1945683e-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
5,239 A Framework for the Performance Analysis of Concurrent B-tree Algorithms 1990 PODS 5.6106291e-05