A family of perfect hashing methods

Computer Journal

Volumn 39, Issue 6, 1996, Pages

  Majewski, Bohdan S ^a   Wormald, Nicholas C ^b   Havas, George ^c   Czech, Zbigniew J ^d  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b UNIVERSITY OF MELBOURNE   (Australia)

^c UNIVERSITY OF QUEENSLAND   (Australia)

^d SILESIAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4243157787     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (30)

1. Gonnet, G. H. and Baeza-Yates, R. (1991) Handbook of Algorithms and Data Structures. Addison-Wesley, Reading, MA.
2. Lewis, T. G. and Cook, C. R. (1988) Hashing for Dynamic and Static Internal Tables. Computer, 21, 45-56.
3. Havas, G. and Majewski, B. S. (1992) Optimal Algorithms for Minimal Perfect Hashing. Research Report 234, Department of Computer Science, The University of Queensland, Australia.
4. Fox, E. A., Heath, L. S., Chen, Q. F. and Daoud, A. M. (1992) Practical Minimal Perfect Hash Functions for Large Databases. Commun. ACM, 35, 105-121.
5. Fox, E. A., Chen, Q. F. and Heath, L. S. (1992) A Faster Algorithm for Constructing Minimal Perfect Hash Functions. 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval-SIGIR'92, Copenhagen, Denmark, pp. 266-273.
6. Gupta, R., Bhaskar, S. and Smolka, S. A. (1994) On Randomization in Sequential and Distributed Algorithms. ACM Comput. Surv., 26, 7-86.
7. Havas, G., Majewski, B. S., Wormald, N. C. and Czech, Z. J. (1994) Graphs, Hypergraphs and Hashing. 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'93), (Utrecht, 1993), Lecture Notes in Computer Science, 790, pp. 153-165. Springer Verlag, Berlin.
8. Havas, G., Majewski, B. S., Wormald, N. C. and Czech, Z. J. (1994) Graphs, Hypergraphs and Hashing. 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'93), (Utrecht, 1993), Lecture Notes in Computer Science, 790, pp. 153-165. Springer Verlag, Berlin.
9. Duke, R. (1985) Types of cycles in hypergraphs. Ann. Discrete Math., 27, 399-418.
10. Majewski, B. S. (1992) Minimal Perfect Hash Functions. Ph.D. Thesis. Department of Computer Science, The University of Queensland, Australia.
11. Havas, G. and Majewski, B. S. (1993) Graph Theoretic Obstacles to Perfect Hashing. Congressus Numerantium, 98, 81-93.
12. Carter, J. L. and Wegman, M. N. (1979) New classes and applications of hash functions. 20th Annual Symposium on Foundations of Computer Science-FOCS'79, San Juan, Puerto Rico, pp. 175-182.
13. Schmidt, J. P. and Siegel, A. (1990) The Analysis of Closed Hashing Under Limited Randomness. 22nd Annual ACM Symposium on Theory of Computing-STOC'90, Baltimore, MD, pp. 224-234.
14. Carter, J. L. and Wegman, M. N. (1977) Universal Classes of Hash Functions. 9th Annual ACM Symposium on Theory of Computing-STOC77, Boulder, CO, pp. 106-112.
15. Dietzfelbinger, M. and Meyer auf der Heide, F. (1990) A New Universal Class of Hash Functions, and Dynamic Hashing in Real Time. 17th International Colloquium on Automata, Languages and Programming-ICALP'90, Warwick University, UK, pp. 6-19.
16. Siegel, A. (1989) On Universal Classes of Fast High Performance Hash Functions, Their Time-Space Trade-off, and Their Applications. 30th Annual Symposium on Foundations of Computer Science-FOCS'89, Research Triangle Park, NC, pp. 20-25.
17. Dietzfelbinger, M., Gil, J., Matias, Y. and Pippenger, N. (1992) Polynomial hash functions are reliable. 19th International Colloquium on Automata, Languages and Programming-ICALP'92, Vienna, Austria, pp. 235-246.
18. Sager, T. J. (1985) A Polynomial Time Generator for Minimal Perfect Hash Functions. Commun. ACM, 28, 523-532.
19. Pearson, P. K. (1990) Fast Hashing of Variable-Length Text Strings. Commun. ACM, 33, 677-680.
20. Aho, A. V., Hopcroft, J. E. and Ullman, J. D. (1974) The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA.
21. Ebert, J. (1987) A Versatile Data Structure for Edge-oriented Graph Algorithms. Commun. ACM, 30, 513-519.
22. Bentley, J. (1987) Programming Pearls: A sample of brilliance. Commun. ACM, 30, 754-757.
23. Feller, W. (1968) An Introduction to Probability Theory and Its Applications, (3rd edn). John Wiley & Sons, Inc., New York.
24. Fredman, M. L., Komlós, J. and Szemerédi, E. (1984) Storing a Sparse Table with O(1) Worst Case Access Time. J. ACM, 31, 538-544.
25. Czech, Z. J., Havas, G. and Majewski, B. S. (1992) An Optimal Algorithm for Generating Minimal Perfect Hash Functions. Info. Proc. Lett., 43, 257-264.
26. Erdös, P. and Rényi, A. (1960) On The Evolution of Random Graphs. Publ. Math. Inst. Hung. Acad. Sci., 5, 17-61.
27. Palmer, E. M. (1985) Graphical Evolution: An Introduction to the Theory of Random Graphs. John Wiley & Sons, New York.
28. Pittel, B., Spencer, J. and Wormald, N.C. (1996) Sudden emergence of a giant k-core in a random graph. J. Combinatorial Theory, series B, 67, 111-151.
29. Corless, R. M., Gonnet, G. H., Hare, D. E. G., Jeffrey, D. J. and Knuth, D. E. (1996) On the Lambert W function. Adv. Computat. Math., in press.
30. Fox, E. A., Chen, Q. F., Daoud, A. M. and Heath, L. S. (1991) Order Preserving Minimal-perfect Hash Functions and Information Retrieval. ACM Trans. Info. Syst., 9, 281-308.