Fundamental Study Perfect hashing

Theoretical Computer Science

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

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

^a SILESIAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b UNIVERSITY OF NEWCASTLE   (Australia)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346880188     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (108)

1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974).
2. A.V. Aho and D. Lee, Storing a dynamic sparse table, in: Proc. 27th Ann. Symp. on Foundations of Computer Science - FOCS'86 (Toronto, Canada, October 1986) 55-60.
3. A.V. Aho and J.D. Ullman, Principles of Compiler Design (Addison-Wesley, Reading, MA, 1977).
4. M.R. Anderson and 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 and T. Hagerup, A perfect parallel dictionary, in: Proc. 17th Symp. on Mathematical Foundation of Computer Science - MFCS'92, Prague, Czechoslovakia, August 1992, Lecture Notes in Computer Science, Vol. 629 (Springer, Berlin) 133-141.
6. R.C. Bell and B. Floyd, A Monte Carlo study of Cichelli hash-function solvability, Comm. ACM 26(11) (November 1983) 924-925.
7. J. Bentley, Programming Pearls (Addison-Wesley, Reading, MA, 1986).
8. B. Bollobás, Random Graphs (Academic Press, London, 1985).
9. B. Bollobás and I. Simon, On the expected behaviour of disjoint set union algorithms, in: Proc. 17th Ann. ACM Symp. on Theory of Computing - STOC'85 (May 1985) 224-231.
10. M.D. Brain and A.L. Tharp, Near-perfect hashing of large word sets, Software - Practice and Experience 19(10) (October 1989) 967-978.
11. M.D. Brain and A.L. Tharp, Perfect hashing using sparse matrix packing, Inform. Systems 15(3) (1990) 281-290.
12. M.D. Brain and 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 and P. Bratley, Algorithmics: Theory and Practice (Prentice-Hall, Englewood Cliffs, NJ, 1988).
14. J.L. Carter and M.N. Wegman, Universal classes of hash functions, in: Proc. 9th Ann. ACM Symp. on Theory of Computing - STOC'77 (1977) 106-112.
15. J.L. Carter and M.N. Wegman, New classes and applications of hash functions, in: Proc. 20th Ann. Symp. on Foundations of Computer Science - FOCS'79 (1979) 175-182.
16. J.L. Carter and M.N. Wegman, Universal classes of hash functions, J. Computer System Sci. 18(2) (1979) 143-154.
17. N. Cercone, J. Boates and 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 and 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 and 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 and T.C. Wu, A refinement of a compression-oriented addressing scheme, BIT 33(4) (1993) 530-535.
25. C.C. Chang and R.C.T. Lee, A letter-oriented minimal perfect hashing scheme, Comput. J. 29(3) (June 1986) 277-281.
26. C.C. Chang and 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 and 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 and 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 and M. Kaiserwerth, Practical perfect hashing, Comput. J. 28(1) (February 1985) 54-55.
31. Z.J. Czech, G. Havas and 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 and 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 and 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 and N. Pippenger, Polynomial hash functions are reliable, in: Proc. 19th Internat. Colloq. on Automata, Languages and Programming - ICALP'92, Vienna, Austria, July 1992, Lecture Notes in Computer Science, Vol. 623 (Springer, Berlin, 1992) 235-246.
36. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert and R.E. Tarjan, Dynamic perfect hashing: upper and lower bounds, in: Proc. 29th Ann. Symp. on Foundations of Computer Science - FOCS'88, White Plains NY, October 1988; Reprinted in SIAM J. Comput. 24(4) (August 1994) 738-761.
37. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert and R.E. Tarjan, Dynamic perfect hashing: upper and lower bounds, in: Proc. 29th Ann. Symp. on Foundations of Computer Science - FOCS'88, White Plains NY, October 1988; Reprinted in SIAM J. Comput. 24(4) (August 1994) 738-761.
38. M. Dietzfelbinger and F. Meyer auf der Heide, An optimal parallel dictionary, in: Proc. ACM Symp. on Parallel Algorithms and Architectures, Santa Fe, Mexico (1989) 360-368.
39. M. Dietzfelbinger and F. Meyer auf der Heide, How to distribute a dictionary on a complete network, in: Proc. 22nd ACM Symp. on Theory of Computing - STOC'90 (1990) 117-127.
40. M. Dietzfelbinger and F. Meyer auf der Heide, A new universal class of hash functions, and dynamic hashing in real time, in: Proc. 17th Internat. Colloq. on Automata, Languages and Programming -ICALP'90, Warwick University, England, July 1990, Lecture Notes in Computer Science, Vol. 443 (Springer, Berlin, July 1990) 6-19.
41. M. Dietzfelbinger and 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 and 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. Erdos and A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hung. Acad. Sci. 5 (1960) 17-61; see also J.H. Spencer, ed., The art of counting: selected writings, in: Mathematicians of Our Time (MIT Press, Cambridge, MA, 1973) 574-617.
45. P. Erdos and A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hung. Acad. Sci. 5 (1960) 17-61; see also J.H. Spencer, ed., The art of counting: selected writings, in: Mathematicians of Our Time (MIT Press, Cambridge, MA, 1973) 574-617.
46. P. Erdos and A. Rényi, On the evolution of random graphs, Bull. Inst. Internat. Statis. 38 (1961) 343-347; see also J.H. Spencer, ed., The art of counting: selected writings, Mathematicians of Our Time (MIT Press, Cambridge, MA, 1973) 569-573.
47. P. Erdos and A. Rényi, On the evolution of random graphs, Bull. Inst. Internat. Statis. 38 (1961) 343-347; see also J.H. Spencer, ed., The art of counting: selected writings, Mathematicians of Our Time (MIT Press, Cambridge, MA, 1973) 569-573.
48. P. Flajolet, D.E. Knuth and 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 and 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 and L.S. Heath, A faster algorithm for constructing minimal perfect hash functions, in: 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 and Q.F. Chen, An O(n log n) algorithm for finding minimal perfect hash functions, Tech. Report TR-89-10, Virginia Polytechnic Institute and State University, Blacksburg, VA, April 1989.
52. E.A. Fox, L.S. Heath, Q.F. Chen and 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 and 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 and D.S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-completeness (W.H. Freeman, San Francisco, 1979).
55. M. Gori and G. Soda, An algebraic approach to Cichelli's perfect hashing, BIT 29(1) (1989) 2-13.
56. M. Greniewski and 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 and S.A. Smolka, On randomization in sequential and distributed algorithms, ACM Comput. Surveys 26(1) (March 1994) 7-86.
58. G. Haggard and K. Karplus, Finding minimal perfect hash functions, ACM SIGCSE Bull. 18 (1986) 191-193.
59. D. Harel, Algorithmics: The Spirit of Computing (Addison-Wesley, Reading, MA, 1987).
60. G. Havas and B.S. Majewski, Graph theoretic obstacles to perfect hashing, Congressus Numerantium 98 (1993) 81-93; see also Proc. 24th Southeastern Internat. Conf. on Combinatorics, Graph Theory and Computing.
61. G. Havas and B.S. Majewski, Graph theoretic obstacles to perfect hashing, Congressus Numerantium 98 (1993) 81-93; see also Proc. 24th Southeastern Internat. Conf. on Combinatorics, Graph Theory and Computing.
62. G. Havas, B.S. Majewski, N.C. Wormald and Z.J. Czech, Graphs, hypergraphs and hashing, in: Proc. 19th Internat. Workshop on Graph-Theoretic Concepts in Computer Science (WG'93), Utrecht, 1993, Lecture Notes in Computer Science, Vol. 790 (Springer, Berlin, 1994) 153-165.
63. L.G. Hua, An Introduction to Number Theory (Sheng-Deng Reading, Taiwan, 1975) (in Chinese).
64. C.T.M. Jacobs and 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 and G. Osterburg, On Cichelli's minimal perfect hash functions method, Comm. ACM 23(12) (December 1980) 728-729.
67. J. Jan and C. Chang, Addressing for letter-oriented keys, J. Chinese Inst. Eng. 11(3) (1988) 279-284.
68. S. Janson, D.E. Knuth, T. Łuczak and B. Pittel, The birth of the giant component, Random Struct. Algorithms 4 (1993) 233-358.
69. D.E. Knuth, The Art of Computer Programming, Vol. 1: Fundamental Algorithms (Addison-Wesley, Reading, MA, 2nd ed., 1973).
70. D.E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching (Addison-Wesley, Reading, MA, 2nd ed., 1973).
71. D.E. Knuth and A. Schönhage, The expected linearity of a simple equivalence algorithm, Theoret. Comput. Sci. 6 (1978) 281-315.
72. P. Larson and M.V. Ramakrishna, External perfect hashing, in: Proc. ACM SIGMOD, Austin TX (June 1985) 190-200.
73. T.G. Lewis and C.R. Cook, Hashing for dynamic and static internal tables, Computer 21 (1988) 45-56.
74. R.J. Lipton and J.F. Naughton, Clocked adversaries for hashing, Algorithmica 9(3) (March 1993) 239-252.
75. C.T. Long, Elementary Introduction to Number Theory (Heath, Boston, 1965).
76. H.G. Mairson, The program complexity of searching a table, in: 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, University of Queensland, Department of Computer Science, November 1992.
78. K. Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching (Springer, Berlin, 1984).
79. K. Mehlhorn, S. Näher and 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, in: 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 (Wiley, New York, 1985).
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, in: J.F. Traub, ed., Algorithms and Complexity: Recent Results and New Directions (Academic Press, New York, April 1976) 21-39.
85. P. Raghavan, Lecture Notes on Randomized Algorithms (IBM Research Division, Yorktown Heights, NY, 1990).
86. M.V. Ramakrishna and 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, University of Missouri-Rolla, Department of Computer Science, 1984.
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 and A. Siegel, The analysis of closed hashing under limited randomness, in: Proc. 22nd Ann. ACM Symp. on Theory of Computing - STOC'90, Baltimore, MD (May 1990) 224-234.
91. J.P. Schmidt and 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, in: 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 (Pergamon, London, 1964).
95. B. Singh and T.L. Naps, Introduction to Data Structures (West Publishing, St. Paul, MI, 1985).
96. C. Slot and P. van Emde Boas, On tape versus core; an application of space efficient perfect hash functions to the invariance of space, in: 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 (Addison-Wesley, Reading, MA, 1980).
99. R.E. Tarjan, Graph theory and gaussian elimination, in: J.R. Bunch and D.J. Rose, eds., Sparse Matrix Computations (Academic Press, New York, 1976) 3-22.
100. R.E. Tarjan and J. Van Leeuwen, Worst-case analysis of set union algorithms, J. ACM 31(2) (April 1984) 245-281.
101. R.E. Tarjan and 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, in: 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 and T.C. Bell, Managing Gigabytes: Compressing and Indexing Documents and Images (Van Nostrand Reinhold, New York, 1994).
106. W.P. Yang and 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, Unpublished Manuscript. Madison Academic Computing Center, University of Wisconsin, Madison, Wisconsin, 1977.