The tree model for hashing: Lower and upper bounds

Joseph Gil; Friedhelm Meyer Auf Der Heide; Avi Wigderson

doi:10.1137/S0097539793255722

The tree model for hashing: Lower and upper bounds

Joseph Gil^*
, Friedhelm Meyer Auf Der Heide
, Avi Wigderson

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	936-955
Number of pages	20
Journal	SIAM Journal on Computing
Volume	25
Issue number	5
DOIs	https://doi.org/10.1137/S0097539793255722
State	Published - Oct 1996

Keywords

Parallel algorithms
Randomization data structures

Access to Document

10.1137/S0097539793255722

Cite this

@article{867115818f0a4316ab012021d4af6da6,

title = "The tree model for hashing: Lower and upper bounds",

abstract = "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.",

keywords = "Parallel algorithms, Randomization data structures",

author = "Joseph Gil and \{Meyer Auf Der Heide\}, Friedhelm and Avi Wigderson",

year = "1996",

month = oct,

doi = "10.1137/S0097539793255722",

language = "אנגלית",

volume = "25",

pages = "936--955",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "5",

}

TY - JOUR

T1 - The tree model for hashing

T2 - Lower and upper bounds

AU - Gil, Joseph

AU - Meyer Auf Der Heide, Friedhelm

AU - Wigderson, Avi

PY - 1996/10

Y1 - 1996/10

N2 - 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.

AB - 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.

KW - Parallel algorithms

KW - Randomization data structures

UR - https://www.scopus.com/pages/publications/4243133862

U2 - 10.1137/S0097539793255722

DO - 10.1137/S0097539793255722

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:4243133862

SN - 0097-5397

VL - 25

SP - 936

EP - 955

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 5

ER -

The tree model for hashing: Lower and upper bounds

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this