Database Paper Browser

Back to papers

Semantically-based Concurrency Control for Search Structures

Summary: Framework for semantic concurrency control on search structures (B‑trees, hashes, lists) exploiting the many‑to‑one mapping from physical search states to logical dictionary state to expose more parallelism than standard concurrency control. Includes verification tools and a methodology to design new concurrent algorithms. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
715
Venue
PODS
Year
1985
Pagerank
0.00012883569
Overall Rank
1,276 | 91.13%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
1,243 Concurrency Control of Nested Transactions Accessing B-Trees 1989 PODS 0.00013096387
1,573 Performance of B-Tree Concurrency Control Algorithms 1991 SIGMOD 0.00011295081
1,589 A Theoretical Foundation Of Multi-Level Concurrency Control 1986 PODS 0.00011238248
12,952 Concurrent Set Manipulation Without Locking 1988 PODS 4.1945683e-05
12,977 Concurrency Control in Database Structures with Relaxed Balance 1987 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 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