Database Paper Browser

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
714
Venue
PODS
Year
1985
Pagerank
0.00011518774
Overall Rank
1,523 | 89.41%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
1,243 Concurrency Control of Nested Transactions Accessing B-Trees 1989 PODS 0.00013096387
2,872 LH* - Linear Hashing for Distributed Files 1993 SIGMOD 7.9762569e-05
3,706 Distributed Linear Hashing and Parallel Projection in Main Memory Databases 1990 VLDB 6.8260426e-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
604 Concurrency Control In A Dynamic Search Structure 1982 PODS 0.00019346532
1,901 Extendible Hashing for Concurrent Operations and Distributed Data 1983 PODS 0.00010159096
Previous Page 1 / 1 Next

Semantically Similar Papers