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)
Incoming Non-self Citations Over Time
Authors
- 1. V. Srinivasan (University of Wisconsin)
- 2. Michael J. Carey (University of Wisconsin)
BibTeX Citation
@inproceedings{srinivasan_sigmod91,
title = {{Performance of B-Tree Concurrency Control Algorithms}},
author = {Srinivasan, V. and Carey, Michael J.},
series = {{SIGMOD} '91},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/115790.115860},
url = {https://dl.acm.org/doi/10.1145/115790.115860},
year = {1991}
}
Incoming Citations (Sorted by Pagerank)
Showing 13 of 13 citing papers.
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 |
|---|---|---|---|---|
| 270 | Models for Studying Concurrency Control Performance: Alternatives and Implications | 1985 | SIGMOD | 0.00022604714 |
| 475 | Concurrent Operations on B-Trees with Overtaking | 1985 | PODS | 0.00017634372 |
| 2,484 | Concurrency Control in B+-Trees Databases Using Preparatory Operations | 1985 | VLDB | 8.381967e-05 |
| 2,582 | Semantically-based Concurrency Control for Search Structures | 1985 | PODS | 8.2453579e-05 |
| 2,798 | Utilization of B-trees with Inserts, Deletes and Modifies | 1989 | PODS | 7.9830986e-05 |
| 5,675 | A Framework for the Performance Analysis of Concurrent B-tree Algorithms | 1990 | PODS | 6.0248757e-05 |
| 7,187 | Operation Specific Locking In B-Trees | 1987 | PODS | 5.5744874e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,929 | Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms | 1984 | PODS |
| 2 | 3,121 | High-Concurrency Locking in R-Trees | 1995 | VLDB |
| 3 | 475 | Concurrent Operations on B-Trees with Overtaking | 1985 | PODS |
| 4 | 2,311 | Concurrency Control of Nested Transactions Accessing B-Trees | 1989 | PODS |
| 5 | 7,187 | Operation Specific Locking In B-Trees | 1987 | PODS |
| 6 | 2,983 | The Performance of Concurrency Control Algorithms for Database Management Systems | 1984 | VLDB |
| 7 | 13,512 | Concurrency Control in Database Structures with Relaxed Balance | 1987 | PODS |
| 8 | 13,341 | Index Concurrency Control in Firm Real-Time DBMS | 1995 | VLDB |
| 9 | 13,373 | New Concurrency Control Algorithms for Accessing and Compacting B-Trees | 1994 | VLDB |
| 10 | 5,675 | A Framework for the Performance Analysis of Concurrent B-tree Algorithms | 1990 | PODS |