An Exact Probability Model for Finite Hash Tables.

@inproceedings{DBLP:conf/icde/Ramakrishna88,
  author    = {M. V. Ramakrishna},
  title     = {An Exact Probability Model for Finite Hash Tables},
  booktitle = {Proceedings of the Fourth International Conference on Data Engineering,
               February 1-5, 1988, Los Angeles, California, USA},
  publisher = {IEEE Computer Society},
  year      = {1988},
  isbn      = {0-8186-0827-7},
  pages     = {362-368},
  ee        = {db/conf/icde/Ramakrishna88.html},
  crossref  = {DBLP:conf/icde/88},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1988 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An2-6 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

Printed Edition

References

[BD59]

...

[BK77]

Ian F. Blake, Alan G. Konheim: Big Buckets Are (Are Not) Better! J. ACM 24(4): 591-606(1977) BibTeX

[DB62]

...

[GM84]

Gaston H. Gonnet, J. Ian Munro: The Analysis of Linear Probing Sort by the Use of a New Mathematical Transform. J. Algorithms 5(4): 451-470(1984) BibTeX

[GN81]

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

[KN74]

Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
BibTeX

[KS78]

...

[LM86]

David B. Lomet: A Simple Bounded Disorder File Organization with Good Performance. ACM Trans. Database Syst. 13(4): 525-551(1988) BibTeX

[LR80]

...

[LR82]

Per-Åke Larson: Expected Worst-Case Performance of Hash Files. Comput. J. 25(3): 347-352(1982) BibTeX

[LR83]

Per-Åke Larson: Analysis of Uniform Hashing. J. ACM 30(4): 805-819(1983) BibTeX

[LR85]

Per-Åke Larson, M. V. Ramakrishna: External Perfect Hashing. SIGMOD Conference 1985: 190-200 BibTeX

[NY85]

R. M. Norton, D. P. Yeager: A Probability Model for Overflow Sufficiency in Small Hash Tables. Commun. ACM 28(10): 1068-1075(1985) BibTeX

[RL88]

M. V. Ramakrishna, Per-Åke Larson: File Organization Using Composite Perfect Hashing. ACM Trans. Database Syst. 14(2): 231-263(1989) BibTeX

[RM86]

...

[RM87]

...

[SP77]

Renzo Sprugnoli: Perfect Hashing Functions: A Single Probe Retrieving Method for Static Sets. Commun. ACM 20(11): 841-850(1977) BibTeX

[VT83]

Jeffrey Scott Vitter: Analysis of the Search Performance of Coalesced Hashing. J. ACM 30(2): 231-258(1983) BibTeX

Referenced by

1. M. V. Ramakrishna: Bounded Disorder File Organization. IEEE Trans. Knowl. Data Eng. 6(1): 79-85(1994)
2. M. V. Ramakrishna: Hashing in Practive, Analysis of Hashing and Universal Hashing. SIGMOD Conference 1988: 191-199
3. M. V. Ramakrishna, P. Mukhopadhyay: Analysis of Bounded Disorder File Organization. PODS 1988: 117-125