DBScholar

Back to papers

LH* — Linear Hashing for Distributed Files

Summary: LH* extends linear hashing to autonomous distributed RAM/disk files, scaling one bucket at a time across an evolving server set without centralized directories. It maintains 65–95% load with only 1 (3 worst-case) insertion and 2 (4 worst-case) retrieval messages. (summarized by gpt-5.6-luna on Jul 21 2026)

Paper ID
2715
Venue
SIGMOD
Year
1993
Pagerank
7.3910846e-05
Overall Rank
3,465 | 76.23%
DOI
10.1145/170035.170084

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{litwin_sigmod93,
        title = {{LH* — Linear Hashing for Distributed Files}},
        author = {Litwin, Witold and Neimat, Marie-Anne and Schneider, Donovan A.},
        series = {{SIGMOD} '93},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/170035.170084},
        url = {https://dl.acm.org/doi/10.1145/170035.170084},
        year = {1993}
}

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
2,801 Concurrency and Linear Hashing 1985 PODS 8.1117099e-05
4,932 Distributed Linear Hashing and Parallel Projection in Main Memory Databases 1990 VLDB 6.4385884e-05
Previous Page 1 / 1 Next

Semantically Similar Papers