LH* - Linear Hashing for Distributed Files.
Witold Litwin, Marie-Anne Neimat, Donovan A. Schneider:
LH* - Linear Hashing for Distributed Files.
SIGMOD Conference 1993: 327-336@inproceedings{DBLP:conf/sigmod/LitwinNS93,
author = {Witold Litwin and
Marie-Anne Neimat and
Donovan A. Schneider},
editor = {Peter Buneman and
Sushil Jajodia},
title = {LH* - Linear Hashing for Distributed Files},
booktitle = {Proceedings of the 1993 ACM SIGMOD International Conference on
Management of Data, Washington, D.C., May 26-28, 1993},
publisher = {ACM Press},
year = {1993},
pages = {327-336},
ee = {http://doi.acm.org/10.1145/170035.170084, db/conf/sigmod/LitwinNS93.html},
crossref = {DBLP:conf/sigmod/93},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
LH* generalizes Linear Hsshing 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.
Copyright © 1993 by the ACM,
Inc., used by permission. Permission to make
digital or hard copies is granted provided that
copies are not made or distributed for profit or
direct commercial advantage, and that copies show
this notice on the first page or initial screen of
a display along with the full citation.
Online Version (ACM WWW Account required): Full Text in PDF Format
CDROM Version: Load the CDROM "Volume 1 Issue 1, SIGMOD '93-'97" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
Peter Buneman, Sushil Jajodia (Eds.):
Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C., May 26-28, 1993.
ACM Press 1993 ,
SIGMOD Record 22(2),
June 1993
Contents
[Index Terms]
[Full Text in PDF Format, 1032 KB]
References
- [ED88]
- Richard J. Enbody, H. C. Du:
Dynamic Hashing Schemes.
ACM Comput. Surv. 20(2): 85-113(1988)
- [Ell87]
- Carla Schlatter Ellis:
Concurrency in Linear Hashing.
ACM Trans. Database Syst. 12(2): 195-217(1987)
- [Hac89]
- Nabil I. Hachem, P. Bruce Berra:
Key-Sequential Access Methods for Very Large Files Derived from Linear Hashing.
ICDE 1989: 305-312
- [Kri86]
- Hans-Peter Kriegel, Bernhard Seeger:
Multidimensional Order Preserving Linear Hashing with Partial Expansions.
ICDT 1986: 203-220
- [Lar80]
- Per-Åke Larson:
Linear Hashing with Partial Expansions.
VLDB 1980: 224-232
- [Lar88]
- Per-Åke Larson:
Dynamic Hash Tables.
Commun. ACM 31(4): 446-457(1988)
- [Lit80]
- Witold Litwin:
Linear Hashing: A New Tool for File and Table Addressing.
VLDB 1980: 212-223
- [LNS93]
- ...
- [LRLH91]
- Witold Litwin, Nick Roussopoulos, Gérald Lévy, Wang Hong:
Trie Hashing With Controlled Load.
IEEE Trans. Software Eng. 17(7): 678-691(1991)
- [Ou91]
- Seng Fuat Ou, Alan L. Tharp:
High Storage Utilisation for Single-Probe Retrieval Linear Hashing.
Comput. J. 34(5): 455-468(1991)
- [Sal88]
- Betty Salzberg:
File Structures: An Analytic Approach.
Prentice-Hall 1988, ISBN 0-13-314550-6
- [Sam89]
- Hanan Samet:
The Design and Analysis of Spatial Data Structures.
Addison-Wesley 1990
- [Sch90]
- ...
- [SPW90]
- Charles Severance, Sakti Pramanik, P. Wolberg:
Distributed Linear Hashing and Parallel Projection in Main Memory Databases.
VLDB 1990: 674-682
Copyright © Fri Mar 12 17:21:30 2010
by Michael Ley (ley@uni-trier.de)