Expected Length of the Longest Probe Sequence in Hash Code Searching.

Gaston H. Gonnet: Expected Length of the Longest Probe Sequence in Hash Code Searching. J. ACM 28(2): 289-304(1981)

@article{DBLP:journals/jacm/Gonnet81,
  author    = {Gaston H. Gonnet},
  title     = {Expected Length of the Longest Probe Sequence in Hash Code Searching},
  journal   = {J. ACM},
  volume    = {28},
  number    = {2},
  year      = {1981},
  pages     = {289-304},
  ee        = {db/journals/jacm/Gonnet81.html, http://doi.acm.org/10.1145/322248.322254},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

BibTeX

Online Edition

Citation Page BibTeX

Referenced by

M. V. Ramakrishna, Justin Zobel: Performance in Practice of String Hashing Functions. DASFAA 1997: 215-224
S. Seshadri, Jeffrey F. Naughton: Sampling Issues in Parallel Database Systems. EDBT 1992: 328-343
Vassilis J. Tsotras, B. Gopinath: Efficient Algorithms for Managing the History of Evolving Databases. ICDT 1990: 141-174
M. V. Ramakrishna: Hashing in Practive, Analysis of Hashing and Universal Hashing. SIGMOD Conference 1988: 191-199
M. V. Ramakrishna: An Exact Probability Model for Finite Hash Tables. ICDE 1988: 362-368
Walter A. Burkhard: Interpolation-Based Index Maintenance. PODS 1983: 76-89
Per-Åke Larson: Performance Analysis of Linear Hashing with Partial Expansions. ACM Trans. Database Syst. 7(4): 566-587(1982)

BibTeX