Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms
Summary: Broadens concurrency control from read/write to semantic ADT operations, classifying mechanisms by operation semantics and proposing a user‑view notion of serializability. Demonstrates many concurrent tree algorithms (search trees, Kung‑Lehman/Lehman‑Yao B‑tree variants) are serializable under this view and maps them to compatible locking and other control techniques. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ray Ford (University of Iowa)
- 2. Jim Calhoun (University of Iowa)
BibTeX Citation
@inproceedings{ford_pods84,
address = {New York, NY, USA},
series = {{PODS} '84},
title = {{Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms}},
url = {https://dl.acm.org/doi/10.1145/588011.588020},
doi = {10.1145/588011.588020},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Ford, Ray and Calhoun, Jim},
year = {1984}
}
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,582 | Semantically-based Concurrency Control for Search Structures | 1985 | PODS | 8.2453579e-05 |
| 7,187 | Operation Specific Locking In B-Trees | 1987 | PODS | 5.5744874e-05 |
| 13,484 | Concurrent Set Manipulation Without Locking | 1988 | PODS | 4.9605343e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 716 | An Optimality Theory of Concurrency Control for Databases | 1979 | SIGMOD | 0.00014556822 |
| 4,280 | An Abstract Model of Database Concurrency Control Algorithms | 1983 | SIGMOD | 6.6724964e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,846 | Concurrency Control for Resilient Nested Transactions | 1983 | PODS |
| 2 | 2,279 | Concurrency and Recovery in Generalized Search Trees | 1997 | SIGMOD |
| 3 | 13,512 | Concurrency Control in Database Structures with Relaxed Balance | 1987 | PODS |
| 4 | 1,330 | Concurrency Control In A Dynamic Search Structure | 1982 | PODS |
| 5 | 3,121 | High-Concurrency Locking in R-Trees | 1995 | VLDB |
| 6 | 2,582 | Semantically-based Concurrency Control for Search Structures | 1985 | PODS |
| 7 | 5,675 | A Framework for the Performance Analysis of Concurrent B-tree Algorithms | 1990 | PODS |
| 8 | 2,311 | Concurrency Control of Nested Transactions Accessing B-Trees | 1989 | PODS |
| 9 | 1,698 | Performance of B-Tree Concurrency Control Algorithms | 1991 | SIGMOD |
| 10 | 13,373 | New Concurrency Control Algorithms for Accessing and Compacting B-Trees | 1994 | VLDB |