Simple and space-efficient minimal perfect hash functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4619 LNCS, Issue , 2007, Pages 139-150

  Botelho, Fabiano C ^a   Pagh, Rasmus ^b   Ziviani, Nivio ^a  

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

^b IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; INFORMATION THEORY; SET THEORY;

PERFECT HASH FUNCTION (PHF); RANDOM HYPERGRAPHS;

FUNCTION EVALUATION;

EID: 38149010559     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73951-7_13     Document Type: Conference Paper

References (20)

1. Alon, N., Dietzfelbinger, M., Miltersen, P.B., Petrank, E., Tardos, G.: Linear hash functions. Journal of the ACM 46(5), 667-683 (1999)
2. Alon, N., Naor, M.: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16(4-5), 434-449 (1996)
3. Botelho, F.C., Kohayakawa, Y., Ziviani, N.: A practical minimal perfect hashing method. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 488-500. Springer, Heidelberg (2005)
4. Czech, Z.J., Havas, G., Majewski, B.S.: Fundamental study perfect hashing. Theoretical Computer Science 182, 1-143 (1997)
5. Dietzfelbinger, M., Hagerup, T.: Simple minimal perfect hashing in less space. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 109-120. Springer, Heidelberg (2001)
6. Dietzfelbinger, M., Weidling, C.: Balanced allocation and dictionaries with tightly packed constant size bins. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 166-178. Springer, Heidelberg (2005)
7. Fox, E.A., Chen, Q.F., Heath, L.S.: A faster algorithm for constructing minimal perfect hash functions. In: Proc. of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 266-273 (1992)
8. Fox, E.A., Heath, L.S., Chen, Q., Daoud, A.M.: Practical minimal perfect hash functions for large databases. Communications of the ACM 35(1), 105-121 (1992)
9. Fredman, M.L., Komlós, J.: On the size of separating systems and families of perfect hashing functions. SIAM Journal on Algebraic and Discrete Methods 5, 61-68 (1984)
10. Fredman, M.L., Komlós, J., Szemerédi, E.: Storing a sparse table with O(1) worst case access time. Journal of the ACM 31(3), 538-544 (1984)
11. Hagerup, T., Tholey, T.: Efficient minimal perfect hashing in nearly minimal space. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 317-326. Springer, Heidelberg (2001)
12. Janson, S.: Poisson convergence and poisson processes with applications to random graphs. Stochastic Processes and their Applications 26, 1-30 (1987)
13. Lefebvre, S., Hoppe, H.: Perfect spatial hashing. ACM Transactions on Graphics 25(3), 579-588 (2006)
14. Majewski, B.S., Wormald, N.C., Havas, G., Czech, Z. J.: A family of perfect hashing methods. The Computer Journal 39(6), 547-554 (1996)
15. Mehlhorn, K.: Data Structures and Algorithms 1: Sorting and Searching. Springer, Heidelberg (1984)
16. Pagh, R.: Hash and displace: Efficient evaluation of minimal perfect hash functions. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 49-54. Springer, Heidelberg (1999)
17. Pagh, R.: Low redundancy in static dictionaries with constant query time. SIAM Journal on Computing 31(2), 353-363 (2001)
18. Radhakrishnan, J.: Improved bounds for covering complete uniform hypergraphs. Information Processing Letters 41, 203-207 (1992)
19. Schmidt, J.P., Siegel, A.: The spatial complexity of oblivious k-probe hash functions. SIAM Journal on Computing 19(5), 775-786 (1990)
20. Woelfel, P.: Maintaining external memory efficient hash tables. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 508-519. Springer, Heidelberg (2006)