Database Paper Browser

Back to papers

LH* - Linear Hashing for Distributed Files

Summary: LH* generalizes Linear Hashing to distributed RAM/disk, enabling autonomous clients to create and grow a file bucket by bucket across many servers. It uses 1–3 insert messages and 2–4 lookups per op, sustains 65–95% load, supports parallel operations, and often beats centralized or static parallel hash files. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2653
Venue
SIGMOD
Year
1993
Pagerank
7.9762569e-05
Overall Rank
2,872 | 80.03%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

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,523 Concurrency and Linear Hashing 1985 PODS 0.00011518774
3,706 Distributed Linear Hashing and Parallel Projection in Main Memory Databases 1990 VLDB 6.8260426e-05
Previous Page 1 / 1 Next

Semantically Similar Papers