DBScholar

Back to papers

Concurrency and Linear Hashing

Summary: Concurrency control for linear hashing via lightweight locking protocols and minor structural changes to support concurrent lookups, inserts, and bucket splits without global rehashing. Also describes adaptation of the scheme to distributed systems. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
713
Venue
PODS
Year
1985
Pagerank
8.1117099e-05
Overall Rank
2,801 | 80.79%
DOI
10.1145/325405.325406

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{ellis_pods85,
        address = {New York, NY, USA},
        series = {{PODS} '85},
        title = {{Concurrency and Linear Hashing}},
        url = {https://dl.acm.org/doi/10.1145/325405.325406},
        doi = {10.1145/325405.325406},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Ellis, Carla Schlatter},
        year = {1985}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
2,257 Concurrency Control of Nested Transactions Accessing B-Trees 1989 PODS 8.8573263e-05
3,465 LH* — Linear Hashing for Distributed Files 1993 SIGMOD 7.3910846e-05
4,932 Distributed Linear Hashing and Parallel Projection in Main Memory Databases 1990 VLDB 6.4385884e-05
13,147 Concurrent Set Manipulation Without Locking 1988 PODS 5.093636e-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
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
Previous Page 1 / 1 Next

Semantically Similar Papers