Perfect hashing

Theoretical Computer Science

Volumn 182, Issue 1-2, 1997, Pages 1-143

  Czech, Zbigniew J ^a   Havas, George ^a   Majewski, Bohdan S ^a  

^a SILESIAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; FUNCTIONS; HEURISTIC METHODS; POLYNOMIALS; PROBABILITY; STORAGE ALLOCATION (COMPUTER);

PERFECT HASH FUNCTIONS;

COMPUTATION THEORY;

EID: 0031208857     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00146-6     Document Type: Review

References (108)

1. A.V. Aho J.E. Hopcroft J.D. Ullman The Design and Analysis of Computer Algorithms 1974 Addison-Wesley Reading, MA
2. A.V. Aho D. Lee Storing a dynamic sparse table Proc. 27th Ann. Symp. on Foundations of Computer Science — FOCS'86 Toronto, Canada October 1986 55 60
3. A.V. Aho J.D. Ullman Principles of Compiler Design 1977 Addison-Wesley Reading, MA
4. M.R. Anderson M.G. Anderson Comments on perfect hashing functions: A single probe retrieving method for static sets Comm. ACM 22 2 February 1979 104 105
5. H. Bast M. Dietzfelbinger T. Hagerup A perfect parallel dictionary Proc. 17th Symp. on Mathematical Foundation of Computer Science — MFCS'92 Prague, Czechoslovakia Lecture Notes in Computer Science Vol. 629 August 1992 Springer Berlin 133 141
6. R.C. Bell B. Floyd A Monte Carlo study of Cichelli hash-function solvability Comm. ACM 26 11 November 1983 924 925
7. J. Bentley Programming Pearls 1986 Addison-Wesley Reading, MA
8. B. Bollobás Random Graphs 1985 Academic Press London
9. B. Bollobás I. Simon On the expected behaviour of disjoint set union algorithms Proc. 17th Ann. ACM Symp. on Theory of Computing — STOC'85 May 1985 224 231
10. M.D. Brain A.L. Tharp Near-perfect hashing of large word sets Software — Practice and Experience 19 10 October 1989 967 978
11. M.D. Brain A.L. Tharp Perfect hashing using sparse matrix packing Inform. Systems 15 3 1990 281 290
12. M.D. Brain A.L. Tharp Using tries to eliminate pattern collisions in perfect hashing IEEE Trans. Knowledge Data Eng. 6 2 1994 239 247
13. G. Brassard P. Bratley Algorithmics: Theory and Practice 1988 Prentice-Hall Englewood Cliffs, NJ
14. J.L. Carter M.N. Wegman Universal classes of hash functions Proc. 9th Ann. ACM Symp. on Theory of Computing — STOC'77 1977 106 112
15. J.L. Carter M.N. Wegman New classes and applications of hash functions Proc. 20th Ann. Symp. on Foundations of Computer Science — FOCS'79 1979 175 182
16. J.L. Carter M.N. Wegman Universal classes of hash functions J. Computer System sci. 18 2 1979 143 154
17. N. Cercone J. Boates M. Krause An interactive system for finding perfect hash functions IEEE Software 2 6 November 1985 38 53
18. C.C. Chang An ordered minimal perfect hashing scheme based upon euler's theorem Inform. sci. 32 1984 165 172
19. C.C. Chang The study of an ordered minimal perfect hashing scheme Comm. ACM 27 4 April 1984 384 387
20. C.C. Chang Letter-oriented reciprocal hashing scheme Inform. sci. 38 1986 243 255
21. C.C. Chang A composite perfect hashing scheme for large letter-oriented key sets J. Inform. sci. Engng. 7 2 1991 173 186
22. C.C. Chang C.H. Chang An ordered minimal perfect hashing scheme with single parameter Inform. Process. Lett. 27 2 February 1988 79 83
23. C.C. Chang C.Y. Chen J.K. Jan On the design of a machine independent perfect hashing scheme Comput. J. 34 5 1991 469 474
24. C.C. Chang H.C. Kowng T.C. Wu A refinement of a compression-oriented addressing scheme BIT 33 4 1993 530 535
25. C.C. Chang R.C.T. Lee A letter-oriented minimal perfect hashing scheme Comput. J. 29 3 June 1986 277 281
26. C.C. Chang H.C. Wu A fast Chinese characters accessing technique using mandarin phonetic transcriptions Comput. Process. Chinese Oriental Languages 3 3–4 1988 275 307
27. C.C. Chang T.C. Wu A letter-oriented perfect hashing scheme based upon sparse table compression Software — Practice Experience 21 1 January 1991 35 49
28. R.J. Cichelli Minimal perfect hash functions made simple Comm. ACM 23 1 January 1980 17 19
29. C.R. Cook R.R. Oldehoeft A letter oriented minimal perfect hashing function SIGPLAN Notices 17 9 September 1982 18 27
30. G.V. Cormack R.N.S. Horspool M. Kaiserwerth Practical perfect hashing Comput. J. 28 1 February 1985 54 55
31. Z.J. Czech G. Havas B.S. Majewski An optimal algorithm for generating minimal perfect hash functions Inform. Process. Lett. 43 5 October 1992 257 264
32. 2) time Archiwum Informatyki Teoretycznej i Stosowanej 4 1992 3 20
33. Z.J. Czech B.S. Majewski A linear time algorithm for finding minimal perfect hash functions Comput. J. 36 6 1993 579 587
34. N. Deo G.M. Prabhu M.S. Krishnamoorthy Algorithms for generating fundamental cycles in a graph ACM Trans. Math. Software 8 1 March 1982 26 42
35. M. Dietzfelbinger J. Gil Y. Matias N. Pippenger Polynomial hash functions are reliable Proc. 19th Internat. Colloq. on Automata, Languages and Programming — ICALP'92 Vienna, Austria, July 1992 Lecture Notes in Computer Science Vol. 623 1992 Springer Berlin 235 246
36. M. Dietzfelbinger A. Karlin K. Mehlhorn F. Meyer auf der Heide H. Rohnert R.E. Tarjan Dynamic perfect hashing: upper and lower bounds Proc. 29th Ann. Symp. on Foundations of Computer Science — FOCS'88 White Plains NY August 1994
37. Reprinted in SIAM J. Comput. 24 4 October 1988 738 761
38. M. Dietzfelbinger F. Meyer auf der Heide An optimal parallel dictionary Proc. ACM Symp. on Parallel Algorithms and Architectures Santa Fe, Mexico 1989 360 368
39. M. Dietzfelbinger F. Meyer auf der Heide How to distribute a dictionary on a complete network Proc. 22nd ACM Symp. on Theory of Computing — STOC'90 1990 117 127
40. M. Dietzfelbinger F. Meyer auf der Heide A new universal class of hash functions, and dynamic hashing in real time Proc. 17th Internat. Colloq. on Automata, Languages and Programming — ICALP'90 , Warwick University England, July 1990 Lecture Notes in Computer Science Vol. 443 July 1990 Springer Berlin 6 19
41. M. Dietzfelbinger F. Meyer auf der Heide An optimal parallel dictionary Inform. and Comput. 102 1993 196 217
42. M.W. Du T.M. Hsieh K.F. Jea D.W Shieh The study of a new perfect hash scheme IEEE Trans. Software Eng. SE-9 3 May 1983 305 313
43. R. Duke Types of cycles in hypergraphs Ann. Discrete Math. 27 1985 399 418
44. P. Erdös A. Rényi On the evolution of random graphs Publ. Math. Inst. Hung. Acad. sci. 5 1960 17 61
45. see also P. Erdös A. Rényi The art of counting: selected writings J.H. Spencer Mathematicians of Our Time 1973 MIT Press Cambridge, MA 574 617
46. P. Erdös A. Rényi On the evolution of random graphs Bull. Inst. Internat. Statis. 38 1961 343 347
47. see also P. Erdös A. Rényi The art of counting: selected writings J.H. Spencer Mathematicians of Our Time 1973 MIT Press Cambridge, MA 569 573
48. P. Flajolet D.E. Knuth B. Pittel The first cycles in an evolving graph Discrete Math. 75 1989 167 215
49. E.A. Fox Q.F. Chen A.M. Daoud L.S. Heath Order preserving minimal perfect hash functions and information retrieval ACM Trans. Inform. Systems 9 3 July 1991 281 308
50. E.A. Fox Q.F. Chen L.S. Heath A faster algorithm for constructing minimal perfect hash functions Proc. 15th Ann. Internat. ACM SIGIR Conf. on Research and Development in Information Retrieval — SIGIR'92 Copenhagen, Denmark June 1992 266 273
51. E.A. Fox L.S. Heath Q.F. Chen An O ( n log n ) algorithm for finding minimal perfect hash functions Tech. Report TR-89-10 April 1989 Virginia Polytechnic Institute and State University Blacksburg, VA
52. E.A. Fox L.S. Heath Q.F. Chen A.M. Daoud Practical minimal perfect hash functions for large databases Comm. ACM 35 1 January 1992 105 121
53. M.L. Fredman J. Komlós E. Szemerédi Storing a sparse table with O(1) worst case access time J. ACM 31 3 July 1984 538 544
54. M.R. Garey D.S. Johnson Computers and Intractibility: A Guide to the Theory of NP-completeness 1979 W.H. Freeman San Francisco
55. M. Gori G. Soda An algebraic approach to Cichelli's perfect hashing BIT 29 1 1989 2 13
56. M. Greniewski M. Turski The external language KLIPA for the URAL-2 digital computer Comm. ACM 6 6 June 1963 322 324
57. R. Gupta S. Bhaskar S.A. Smolka On randomization in sequential and distributed algorithms ACM Comput. Surveys 26 1 March 1994 7 86
58. G. Haggard K. Karplus Finding minimal perfect hash functions ACM SIGCSE Bull. 18 1986 191 193
59. D. Harel Algorithmics: The Spirit of Computing 1987 Addison-Wesley Reading, MA
60. G. Havas B.S. Majewski Graph theoretic obstacles to perfect hashing Congressus Numerantium 98 1993 81 93
61. see also Proc. 24th Southeastern Internat. Conf. on Combinatorics, Graph Theory and Computing.
62. G. Havas B.S. Majewski N.C. Wormald Z.J. Czech Graphs, hypergraphs and hashing Proc. 19th Internat. Workshop on Graph-Theoretic Concepts in Computer Science (WG'93) Utrecht, 1993 2nd ed. Lecture Notes in Computer Science Vol. 790 1994 Springer Berlin 153 165
63. L.G. Hua An Introduction to Number Theory 1975 Sheng-Deng Reading Taiwan (in Chinese).
64. C.T.M. Jacobs P. van Emde Boas Two results on tables Inform. Process. Lett. 22 1986 43 48
65. G. Jaeschke Reciprocal hashing: A method for generating minimal perfect hashing functions Comm. ACM 24 12 December 1981 829 833
66. G. Jaeschke G. Osterburg On Cichelli's minimal perfect hash functions method Comm. ACM 23 12 December 1980 728 729
67. J. Jan C. Chang Addressing for letter-oriented keys J. Chinese Inst. Eng. 11 3 1988 279 284
68. S. Janson D.E. Knuth T. Luczak B. Pittel The birth of the giant component Random Struct. Algorithms 4 1993 233 358
69. D.E. Knuth Fundamental Algorithms, Vol. 1: The Art of Computer Programming 2nd ed. 1973 Addison-Wesley Reading, MA
70. D.E. Knuth Sorting and Searching, Vol. 3: The Art of Computer Programming 2nd ed. 1973 Addison-Wesley Reading, MA
71. D.E. Knuth A. Schönhage The expected linearity of a simple equivalence algorithm Theoret. Comput. sci. 6 1978 281 315
72. P. Larson M.V. Ramakrishna External perfect hashing Proc. ACM SIGMOD Austin TX June 1985 190 200
73. T.G. Lewis C.R. Cook Hashing for dynamic and static internal tables Computer 21 1988 45 56
74. R.J. Lipton J.F. Naughton Clocked adversaries for hashing Algorithmica 9 3 March 1993 239 252
75. C.T. Long Elementary Introduction to Number Theory 1965 Heath Boston
76. H.G. Mairson The program complexity of searching a table Proc. 24th Ann. Symp. on Foundations of Computer Science — FOCS'83 Tuscon, AZ November 1983 40 47
77. B.S. Majewski Minimal perfect hash functions Ph.D. Thesis November 1992 University of Queensland, Department of Computer Science
78. K. Mehlhorn Data Structures and Algorithms 1: Sorting and Searching 1984 Springer Berlin
79. K. Mehlhorn S. Näher M. Rauch On the complexity of a game related to the dictionary problem SIAM J. Comput. 19 5 October 1990 902 906
80. F. Meyer auf der Heide Dynamic hashing strategies Proc. 15th Symp. on Mathematical Foundations of Computer Science — MFCS'90 Banska Bystrica, Czechoslovakia 1990 76 87
81. E.M. Palmer Graphical Evolution: An Introduction to the Theory of Random Graphs 1985 Wiley New York
82. P.K. Pearson Fast hashing of variable-length text strings Comm. ACM 33 6 June 1990 677 680
83. B. Pittel, J. Spencer and N.C. Wormald, The sudden emergence of a giant k -core in a random graph, J. Combin. Theory, Ser. B , submitted.
84. M.O. Rabin Probabilistic algorithms J.F. Traub Algorithms and Complexity: Recent Results and New Directions April 1976 Academic Press New York 21 39
85. P. Raghavan Lecture Notes on Randomized Algorithms 1990 IBM Research Division Yorktown Heights, NY
86. M.V. Ramakrishna P. Larson File organization using composite perfect hashing ACM Trans. Database Systems 14 2 June 1989 231 263
87. R.C. Read Euler graphs on labelled nodes Canad. J. Math. 14 1962 482 486
88. T.J. Sager A new method for generating minimal perfect hash functions Tech. Report CSC-84-15 1984 University of Missouri-Rolla, Department of Computer Science
89. T.J. Sager A polynomial time generator for minimal perfect hash functions Comm. ACM 28 5 May 1985 523 532
90. J.P. Schmidt A. Siegel The analysis of closed hashing under limited randomness Proc. 22nd Ann. ACM Symp. on Theory of Computing — STOC'90 Baltimore, MD May 1990 224 234
91. J.P. Schmidt A. Siegel The spatial complexity of oblivious k -probe hash functions SIAM J. Comput. 19 5 October 1990 775 786
92. J. Shallit Randomized algorithms in “primitive cultures” SIGACT News 23 4 1992 77 80
93. A. Siegel On universal classes of fast high performance hash functions, their time-space trade-off, and their applications Proc. 30th Ann. Symp. on Foundations of Computer Science — FOCS'89 October 1989 20 25
94. W. Sierpinski A selection of Problems in the Theory of Numbers 1964 Pergamon London
95. B. Singh T.L. Naps Introduction to Data Structures 1985 West Publishing St. Paul, MI
96. C. Slot P. van Emde Boas On tape versus core; an application of space efficient perfect hash functions to the invariance of space Proc. 16th Ann. ACM Symp. on Theory of Computing — STOC'84 Washington, DC May 1984 391 400
97. R. Sprugnoli Perfect hashing functions: a single probe retrieving method for static sets Comm. ACM 20 11 November 1977 841 850
98. T.A. Standish Data Structures Techniques 1980 Addison-Wesley Reading, MA
99. R.E. Tarjan Graph theory and gaussian elimination J.R. Bunch D.J. Rose Sparse Matrix Computations 1976 Academic Press New York 3 22
100. R.E. Tarjan J. Van Leeuwen Worst-case analysis of set union algorithms J. ACM 31 2 April 1984 245 281
101. R.E. Tarjan A.C.C Yao Storing a sparse table Comm. ACM 22 11 November 1979 606 611
102. J.A. Trono An undergraduate project to compute minimal perfect hashing functions SIGCSE Bull. 24 3 1992 53 56
103. V.G. Winters Minimal perfect hashing for large sets of data Internat. Conf. on Computing and Information — ICCI'90 Niagara Falls, Canada May 1990 275 284
104. V.G. Winters Minimal perfect hashing in polynomial time BIT 30 2 1990 235 244
105. I.H. Witten A. Moffat T.C. Bell Managing Gigabytes: Compressing and Indexing Documents and Images 1994 Van Nostrand Reinhold New York
106. W.P. Yang M.W. Du A backtracking method for constructing perfect hash functions from a set of mapping functions BIT 25 1 1985 148 164
107. A.C. Yao On the expected performance of path compression algorithms SIAM J. Comput. 14 February 1985 129 133
108. S.F. Ziegler Smaller faster table driven parser 1977 Madison Academic Computing Center, University of Wisconsin Madison, Wisconsin Unpublished Manuscript