Hash, Displace, and compress

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

Volumn 5757 LNCS, Issue , 2009, Pages 682-693

  Belazzougui, Djamal ^a   Botelho, Fabiano C ^b   Dietzfelbinger, Martin ^c  

^a Institut National de Formation en Informatique   (Algeria)

^b Departament of Transportation Engineering   (Brazil)

^c ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS;

CONSTRUCTION TIME; EVALUATION TIME; FUNCTION INDICES; PERFECT HASHING; PERFORMANCE PARAMETERS;

FUNCTION EVALUATION;

EID: 70350393266     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04128-0_61     Document Type: Conference Paper

References (21)

1. Belazzougui, D., Botelho, F.C., Dietzfelbinger, M.: Hash, displace, and compress. Computer Research Repository (2009)
2. Botelho, F.C., Pagh, R., Ziviani, N.: Simple and space-efficient minimal perfect hash functions. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 139-150. Springer, Heidelberg (2007)
3. Chazelle, B., Kilian, J., Rubinfeld, R., Tal, A.: The bloomier filter: An efficient data structure for static support lookup tables. In: Proc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 30-39. SIAM, Philadelphia (2004)
4. Dietzel, L.: Speicherplatzeffiziente perfekte Hashfunktionen. Master's thesis, Technische Universität Ilmenau (Novmber 2005) (in German)
5. Dietzfelbinger, M.: Design strategies for minimal perfect hash functions. In: Hromkovič, J., Královič, R., Nunkesser, M., Widmayer, P. (eds.) SAGA 2007. LNCS, vol. 4665, pp. 2-17. Springer, Heidelberg (2007)
6. Dietzfelbinger, M., Rink, M.: Applications of a splitting trick. In: Proc. of 36th International Colloquium on Automata, Languages and Programming. Springer, Heidelberg (to appear, 2009)
7. Dietzfelbinger, M., Weidling, C.: Balanced allocation and dictionaries with tightly packed constant size bins. Theoretical Computer Science 380(1-2), 47-68 (2007)
8. Erlingsson, U., Manasse, M., McSherry, F.: A cool and practical alternative to traditional hash tables. In: Proc. of the 7th Workshop on Distributed Data and Structures, pp. 1-6 (2006)
9. Ferragina, P., Venturini, R.: A simple storage scheme for strings achieving entropy bounds. Theoretical Computer Science 372(1), 115-121 (2007)
10. 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)
11. Fredriksson, K., Nikitin, F.: Simple compression code supporting random access and fast string matching. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 203-216. Springer, Heidelberg (2007)
12. 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)
13. Litwin, W.: Linear hashing: a new tool for file and table addressing. In: Proc. of the 6th International Conference on Very Large Data Bases, pp. 212-223. VLDB Endowment (1980)
14. Mehlhorn, K.: Data Structures and Algorithms 1: Sorting and Searching. Springer, Heidelberg (1984)
15. Mitzenmacher, M., Upfal, E.: Probability and Computing. Cambridge University Press, Cambridge (2005)
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. Radhakrishnan, J.: Improved bounds for covering complete uniform hypergraphs. Information Processing Letters 41, 203-207 (1992)
18. Sanders, P.: Personal communication (2004)
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. Tarjan, R.E., Yao, A.C.C.: Storing a sparse table. Communications of the ACM 22(11), 606-611 (1979)
21. Vigna, S.: Broadword implementation of rank/select queries. In: Proc. of the 7th International Workshop on Efficient and Experimental Algorithms, pp. 154-168. ACM Press, New York (2008)