Database Paper Browser

Back to papers

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)

Paper ID
684
Venue
PODS
Year
1984
Pagerank
6.9357398e-05
Overall Rank
3,596 | 74.99%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
1,276 Semantically-based Concurrency Control for Search Structures 1985 PODS 0.00012883569
6,250 Operation Specific Locking In B-Trees 1987 PODS 5.1383127e-05
12,952 Concurrent Set Manipulation Without Locking 1988 PODS 4.1945683e-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
347 An Optimality Theory of Concurrency Control for Databases 1979 SIGMOD 0.00026610677
3,351 An Abstract Model of Database Concurrency Control Algorithms 1983 SIGMOD 7.1873372e-05
Previous Page 1 / 1 Next

Semantically Similar Papers