DBScholar

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
2612
Venue
SIGMOD
Year
1991
Pagerank
0.00010073735
Overall Rank
1,663 | 88.60%
DOI
10.1145/115790.115860

Incoming Non-self Citations Over Time

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers