Details

Autor(en) / Beteiligte

• Litwin, Witold
• Neimat, Marie-Anne
• Schneider, Donovan A.
• Jajodia, Sushil
• Buneman, Peter

Titel

LH: Linear Hashing for distributed files

Ist Teil von

• International Conference on Management of Data: Proceedings of the 1993 ACM SIGMOD international conference on Management of data; 25-28 May 1993, 1993, p.327-336

Ort / Verlag

New York, NY, USA: ACM

Erscheinungsjahr

1993

Link zum Volltext

Quelle

ACM Digital Library Complete

Beschreibungen/Notizen

• LH* generalizes Linear Hashing to parallel or distributed RAM and disk files. An LH* file can be created from objects provided by any number of distributed and autonomous clients. It can grow gracefully, one bucket at a time, to virtually any number of servers. The number of messages per insertion is one in general, and three in the worst case. The number of messages per retrieval is two in general, and four in the worst case. The load factor can be about constant, 65-95%, depending on the file parameters. The file can also support parallel operations. An LH* file can be much faster than a single site disk file, and/or can hold a much larger number of objects. It can be more efficient than any file with a centralized directory, or a static parallel or distributed hash file.