The tree model for hashing : Lower and upper bounds

The tree model for hashing : Lower and upper bounds

We define a new simple and general model for hashing. The basic model together with several variants capture many natural (sequential and parallel) hashing algorithms and represent common hashing practice. Our main results exhibit tight tradeoffs between hash-table size and the number of application...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on computing 1996-10, Vol.25 (5), p.936-955
Hauptverfasser: GIL, J, MEYER AUF DER HEIDE, F, WIGDERSON, A
Format: Artikel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Computer science
Computer science
control theory
systems
Data processing. List processing. Character string processing
Design
Exact sciences and technology
Information retrieval. Graph
Memory organisation. Data processing
Software
Stochastic models
Theoretical computing
Universe
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We define a new simple and general model for hashing. The basic model together with several variants capture many natural (sequential and parallel) hashing algorithms and represent common hashing practice. Our main results exhibit tight tradeoffs between hash-table size and the number of applications of a hash function on a single key.
ISSN:0097-5397
1095-7111
DOI:10.1137/S0097539793255722