DBScholar

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
714
Venue
PODS
Year
1985
Pagerank
8.463742e-05
Overall Rank
2,526 | 82.68%
DOI
10.1145/325405.325407

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{goodman_pods85,
        address = {New York, NY, USA},
        series = {{PODS} '85},
        title = {{Semantically-based Concurrency Control for Search Structures}},
        url = {https://dl.acm.org/doi/10.1145/325405.325407},
        doi = {10.1145/325405.325407},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Goodman, Nathan and Shasha, Dennis},
        year = {1985}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
1,663 Performance of B-Tree Concurrency Control Algorithms 1991 SIGMOD 0.00010073735
1,930 A Theoretical Foundation Of Multi-Level Concurrency Control 1986 PODS 9.4675042e-05
2,257 Concurrency Control of Nested Transactions Accessing B-Trees 1989 PODS 8.8573263e-05
13,147 Concurrent Set Manipulation Without Locking 1988 PODS 5.093636e-05
13,175 Concurrency Control in Database Structures with Relaxed Balance 1987 PODS 5.093636e-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.

Rank Cited Paper Year Venue Pagerank
1,292 Concurrency Control In A Dynamic Search Structure 1982 PODS 0.0001130324
3,115 Extendible Hashing for Concurrent Operations and Distributed Data 1983 PODS 7.7400134e-05
4,783 Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms 1984 PODS 6.5091522e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 2,257 Concurrency Control of Nested Transactions Accessing B-Trees 1989 PODS
2 2,227 Concurrency and Recovery in Generalized Search Trees 1997 SIGMOD
3 4,075 Distributing a Search Tree Among a Growing Number of Processors 1994 SIGMOD
4 3,775 Extracting Concurrency from Objects: A Methodology 1991 SIGMOD
5 13,175 Concurrency Control in Database Structures with Relaxed Balance 1987 PODS
6 13,036 New Concurrency Control Algorithms for Accessing and Compacting B-Trees 1994 VLDB
7 14,548 On B-Trees: Routing Schemes And Concurrency 1980 SIGMOD
8 8,776 Concurrent Operations in Extendible Hashing 1986 VLDB
9 4,783 Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms 1984 PODS
10 1,292 Concurrency Control In A Dynamic Search Structure 1982 PODS