Theory and practise of monotone minimal perfect hashing

11th Workshop on Algorithm Engineering and Experiments and 6th Workshop on Analytic Algorithmics and Combinatorics 2009, ALENEX 2009/ANALCO 2009

Volumn , Issue , 2009, Pages 132-144

  Belazzougui, Djamal ^a   Boldi, Paolo ^b   Pagh, Rasmus ^c   Vigna, Sebastiano ^b  

^a Institut National de Formation en Informatique   (Algeria)

^b UNIVERSITY OF MILAN   (Italy)

^c IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA COMPRESSION; HASH FUNCTIONS; INFORMATION MANAGEMENT; SEARCH ENGINES;

LOWER BOUNDS; MANAGEMENT TASKS; MINIMAL PERFECT HASHES; MINIMAL PERFECT HASHING; ORDER PRESERVING; SPACE USAGE; WEB GRAPHS;

COMBINATORIAL MATHEMATICS;

EID: 84882344544     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. D. Belazzougui, P. Boldi, R. Pagh, and S. Vigna. Monotone minimal perfect hashing: Searching a sorted table with O(1) accesses. In Proceedings of the 20th Annual ACM-SIAM Symposium On Discrete Mathematics (SODA), New York, 2009. ACM Press.
2. P. Boldi, B. Codenotti, M. Santini, and S. Vigna. Ubicrawler: A scalable fully distributed web crawler. Software: Practice & Experience, 34(8):711-726, 2004.
3. F. C. Botelho, R. Pagh, and N. Ziviani. Simple and space-efficient minimal perfect hash functions. In WADS, pages 139-150, 2007.
4. F. C. Botelho and N. Ziviani. External perfect hashing for very large key sets. In CIKM, pages 653-662, 2007.
5. J. Cain and N. C. Wormald. Encores on cores. Electronic Journal of Combinatorics, 13(1), 2006.
6. D. Charles and K. Chellapilla. Bloomier filters: A second look. In Proc. ESA 2008, 2008.
7. B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal. The Bloomier filter: an efficient data structure for static support lookup tables. In J. I. Munro, editor, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pages 30-39. SIAM, 2004.
8. D. R. Clark and J. I. Munro. Efficient suffix trees on secondary storage (extended abstract). In SODA, pages 383-391, 1996.
9. M. Dietzfelbinger and R. Pagh. Succinct data structures for retrieval and approximate membership (extended abstract). In L. Aceto, I. Damgård, L. A. Goldberg, M. M. Halldórsson, A. Ingólfsdóttir, and I. Walukiewicz, editors, Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, volume 5125 of Lecture Notes in Computer Science, pages 385-396. Springer, 2008.
10. P. Elias. Efficient storage and retrieval by content and address of static files. J. Assoc. Comput. Mach., 21(2):246-260, 1974.
11. R. M. Fano. On the number of bits required to implement an associative memory. Memorandum 61, Computer Structures Group, Project MAC, MIT, Cambridge, Mass., n.d., 1971.
12. E. A. Fox, Q. F. Chen, A. M. Daoud, and L. S. Heath. Order-preserving minimal perfect hash functions and information retrieval. ACM Trans. Inf. Sys., 9(3):281-308, 1991.
13. M. L. Fredman and J. Komlós. On the size of separating systems and families of perfect hash functions. SIAM J. Algebraic Discrete Methods, 5(1):61-68, 1984.
14. M. L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with O(1) worst case access time. J. Assoc. Comput. Mach., 31(3):538-544, July 1984.
15. R. F. Geary, N. Rahman, R. Raman, and V. Raman. A simple optimal representation for balanced parentheses. Theor. Comput. Sci, 368(3):231-246, 2006.
16. A. Golynski. Optimal lower bounds for rank and select indexes. In M. Bugliesi, B. Preneel, V. Sassone, and I. Wegener, editors, Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, volume 4051 of Lecture Notes in Computer Science, pages 370-381. Springer, 2006.
17. R. Gonzàlez, S. Grabowski, V. Mäkinen, and G. Navarro. Practical implementation of rank and select queries. In Poster Proceedings Volume of 4th Workshop on Efficient and Experimental Algorithms (WEA'05), pages 27-38. CU Press and Ellinika Grammata, 2005.
18. A. Gupta, W.-K. Hon, R. Shah, and J. S. Vitter. Compressed data structures: Dictionaries and data-aware measures. Theoret. Comput. Sci., 387(3):313-331, 2007.
19. T. Hagerup and T. Tholey. Efficient minimal perfect hashing in nearly minimal space. In Proceedings of the 18th Symposium on Theoretical Aspects of Computer Science (STACS '01), volume 2010 of Lecture Notes in Computer Science, pages 317-326. Springer-Verlag, 2001.
20. J. Hirai, S. Raghavan, H. Garcia-Molina, and A. Paepcke. WebBase: a repository of Web pages. Computer Networks, 33(1-6):277-293, 2000.
21. T. C. Hu and A. C. Tucker. Optimal Computer Search Trees and Variable-Length Alphabetical Codes. SIAM J. Applied Math., 21(4):514-532, 1971.
22. G. Jacobson. Space-efficient static trees and graphs. In In Proc 30th Annual Symposium on Foundations of Computer Science, pages 549-554, 1989.
23. B. Jenkins. Algorithm alley: Hash functions. Dr. Dobb's Journal of Software Tools, 22(9): 107-109, 115-116, Sept. 1997.
24. D. K. Kim, J. C. Na, J. E. Kim, and K. Park. Efficient implementation of rank and select functions for succinct representation. In S. E. Nikoletseas, editor, Proc. of the Experimental and Efficient Algorithms, 4th Internationalworkshop, volume 3503 of Lecture Notes in Computer Science, pages 315-327. Springer, 2005.
25. D. E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, second edition, 1997.
26. B. S. Majewski, N. C. Wormald, G. Havas, and Z. J. Czech. A family of perfect hashing methods. Comput. J., 39(6):547-554, 1996.
27. D. R. Morrison. PATRICIA - practical algorithm to retrieve information coded in alphanumeric. J. Assoc. Comput. Mach., 15(4):514-534, 1968.
28. J. I. Munro and V. Raman. Succinct representation of balanced parentheses and static trees. SIAM J. Comput., 31(3):762-776, 2001.
29. E. Porat. An optimal bloom filter replacement based on matrix solving, 2008. arXiv:0804.1845v1.
30. S. Vigna. Broadword implementation of rank/select queries. In Proc. WEA 2008: 7th International Workshop on Experimental Algorithms, Lecture Notes in Computer Science. Springer-Verlag, 2008.