Database Paper Browser

Back to papers

Extendible Hashing for Concurrent Operations and Distributed Data

Summary: Locking protocols and small structural tweaks to enable concurrent extendible-hash operations, analogous to concurrent B-tree techniques. Initial schemes for distributing extendible-hash files to improve availability and scalability, addressing directory placement and split coordination. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
650
Venue
PODS
Year
1983
Pagerank
0.00010159096
Overall Rank
1,901 | 86.78%
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,276 Semantically-based Concurrency Control for Search Structures 1985 PODS 0.00012883569
1,523 Concurrency and Linear Hashing 1985 PODS 0.00011518774
5,287 Semantics Based Transaction Management Techniques for Replicated Data 1988 SIGMOD 5.5837564e-05
12,952 Concurrent Set Manipulation Without Locking 1988 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers