Database Paper Browser

Back to papers

Concurrent Operations in Extendible Hashing

Summary: Deadlock-free concurrency for extendible-hash files: searches run with insertions, and concurrent insert/delete proceed without locking directory entries. It combines optimistic verification with extendible-hash semantics, and provides a formal correctness proof. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7751
Venue
VLDB
Year
1986
Pagerank
4.4937074e-05
Overall Rank
8,573 | 40.36%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
12,952 Concurrent Set Manipulation Without Locking 1988 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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