Minimal perfect hashing: A competitive method for indexing internal memory

Information Sciences

Volumn 181, Issue 13, 2011, Pages 2608-2625

  Botelho, Fabiano C ^a   Lacerda, Anísio ^b   Menezes, Guilherme Vale ^b   Ziviani, Nivio ^b  

^a Data Domain An EMC Company   (United States)

^b FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

Author keywords

Indexing internal memory; Minimal perfect hashing

Indexed keywords

DOUBLE HASHING; HASH SCHEME; HASH TABLE; INTERNAL MEMORY; LINEAR HASHING; LOOKUP TIME; MEMORY EFFICIENT; MOVE-TO-FRONT; OPEN ADDRESSING; PERFECT HASHING; PRACTICAL IMPLEMENTATION; SINGLE PROBE; SPACE OVERHEAD; SPACE USAGE;

HASH FUNCTIONS; INDEXING (OF INFORMATION);

TABLE LOOKUP;

EID: 79953843470     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2009.12.003     Document Type: Article

References (45)

1. N. Alon, M. Dietzfelbinger, P. Miltersen, E. Petrank, and G. Tardos Linear hash functions Journal of the ACM 46 5 1999 667 683
2. N. Askitis, J. Zobel, Cache-conscious collision resolution in string hash tables. in: Symposium on String Processing and Information Retrieval (SPIRE'05), 2005, pp. 91-102.
3. D. Belazzougui, P. Boldi, R. Pagh, 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 Algorithms (SODA'09), New York, NY, USA, 2009, pp. 785-794.
4. D. Belazzougui, P. Boldi, R. Pagh, S. Vigna, Theory and practise of monotone minimal perfect hashing, in: Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX'09), 2009, pp. 132-144.
5. J.R. Black Jr., C.U. Martel, H. Qi, Graph and hashing algorithms for modern architectures: design and performance, in: Proceedings of the Second International Workshop on Algorithm Engineering (WAE'98), 1998, pp. 37-48.
6. A. Bosselaers, R. Govaerts, J. Vandewalle, Fast hashing on the pentium, in: Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology (CRYPTO'96), Springer-Verlag, London, UK, 1996, pp. 298-312. (Pubitemid 126106248)
7. F. Botelho, R. Pagh, N. Ziviani, Simple and space-efficient minimal perfect hash functions, in: Proceedings of the 10th Workshop on Algorithms and Data Structures (WADs'07), vol. 4619, Springer, LNCS, 2007, pp. 139-150.
8. F. Botelho, N. Ziviani, External perfect hashing for very large key sets, in: Proceedings of the 16th ACM Conference on Information and Knowledge Management (CIKM'07), ACM Press, 2007, pp. 653-662.
9. F.C. Botelho, H.R. Langbehn, G.V. Menezes, N. Ziviani, Indexing internal memory with minimal perfect hash functions, in: Proceedings of the 23rd Brazilian Symposium on Database (SBBD'08), October 2008, pp. 16-30.
10. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, and R. Stata Graph structure in the web Computer Networks 33 1 2000 309 320 June
11. D. Burger, J.R. Goodman, A. Kägi, Memory bandwidth limitations of future microprocessors, in: Proceedings of the 23rd Annual International Symposium on Computer Architecture (ISCA'96), ACM, New York, NY, USA, 1996, pp. 78-89.
12. Z. Czech, G. Havas, and B. Majewski An optimal algorithm for generating minimal perfect hash functions Information Processing Letters 43 5 1992 257 264 (Pubitemid 23575939)
13. Z. Czech, G. Havas, and B. Majewski Fundamental study perfect hashing Theoretical Computer Science 182 1997 1 143 (Pubitemid 127455844)
14. U. Erlingsson, M. Manasse, F. Mcsherry, A cool and practical alternative to traditional hash tables, in: Proceedings of the Seventh Workshop on Distributed Data and Structures (WDAS'2006), Santa Clara University, Santa Clara, California, USA, 2006, pp. 1-6.
15. W. Feller An Introduction to Probability Theory and Its Applications 1968 Wiley January, vol. 1
16. M.L. Fredman, and J. Komlós On the size of separating systems and families of perfect hashing functions SIAM Journal on Algebraic and Discrete Methods 5 1984 61 68
17. H. Gao, J.F. Groote, W.H. Hesselink, Almost wait-free resizable hashtables, in: Proceedings of the 18th International Symposium on Parallel and Distributed Processing (IPDPS04), IEEE Computer Society, Los Alamitos, CA, USA, pp. 50-58.
18. H. Gao, J.F. Groote, and W.H. Hesselink Lock-free dynamic hash tables with open addressing Distributed Computing 18 1 2005 21 42 (Pubitemid 41660459)
19. T. Hagerup, T. Tholey, Efficient minimal perfect hashing in nearly minimal space, in: Proceedings of the 18th Symposium on Theoretical Aspects of Computer Science (STACS'01), vol. 2010, Springer LNCS, 2001, pp. 317-326. (Pubitemid 33241762)
20. C. Halatsis, and G. Philokyprou Pseudochaining in hash tables Communication of The ACM 21 7 1978 554 557 July
21. G.L. Heileman, W. Luo, How caching affects hashing, in: Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX'05), 2005, pp. 141-154. (Pubitemid 43206506)
22. M. Herlihy, N. Shavit, M. Tzafrir, Hopscotch hashing, in: Proceedings of the 22nd International Symposium on Distributed Computing (DISC'08), Springer-Verlag, Berlin, Heidelberg, 2008, pp. 350-364.
23. F. Hopgood, and J. Davenport The quadratic hash method when the table size is a power of 2 The Computer Journal 15 4 1972 314 315 November
24. B. Jenkins Algorithm alley: Hash functions Dr. Dobb's Journal of Software Tools 22 9 1997 September
25. D.E. Knuth second ed. The Art of Computer Programming: Sorting and Searching vol. 3 1998 Addison-Wesley
26. W. Luo, and G.L. Heileman Improved exponential hashing IEICE Electronics Express 1 7 2004 150 155
27. N.R. Mahapatra, and B. Venkatrao The processor-memory bottleneck: problems and solutions ACM Crossroads 5 3 1999
28. B. Majewski, N. Wormald, G. Havas, and Z. Czech A family of perfect hashing methods The Computer Journal 39 6 1996 547 554
29. S. Manegold, P.A. Boncz, and M.L. Kersten Optimizing database architecture for the new bottleneck: memory access The VLDB Journal 9 2000 231 246
30. K. Mehlhorn Data Structures and Algorithms 1: Sorting and Searching 1984 Springer-Verlag
31. D. Okanohara, K. Sadakane, Practical entropy-compressed rank/select dictionary, in: Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX'07), 2007.
32. R. Pagh Low redundancy in static dictionaries with constant query time SIAM Journal on Computing 31 2 2001 353 363 (Pubitemid 33782954)
33. R. Pagh, and F.F. Rodler Cuckoo hashing Journal of Algorithms 51 2 2004 122 144
34. R.B. Payne, M.D. Sorenson, and K. Klitz The Cuckoos: Cuculidae 2005 Oxford University Press
35. W.W. Peterson Addressing for random-access storage IBM Journal of Research and Development 1 1957 130 146
36. R. Raman, V. Raman, S.S. Rao, Succinct indexable dictionaries with applications to encoding k-ary trees and multisets, in: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02), Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2002, pp. 233-242.
37. K.A. Ross, Efficient hash probes on modern processors, in: Proceedings of the 22nd International Conference on Data Engineering (ICDE'06), IEEE Computer Society, Los Alamitos, CA, USA, 2007, pp. 1297-1301. (Pubitemid 47422142)
38. J.P. Schmidt, and A. Siegel The spatial complexity of oblivious k-probe Hash functions SIAM Journal on Computing 19 5 1990 775 786 October
39. M. Seltzer Beyond relational databases ACM Queue 3 3 2005 April
40. O. Shalev, and N. Shavit Split-ordered lists: lock-free extensible Hash tables Journal of the ACM 53 3 2006 379 405 (Pubitemid 44180743)
41. C. Silverstein, An Extremely Memory-efficient Hash-map Implementation (google-sparsehash), November 2007. .
42. B.J. Smith, G.L. Heileman, and C. Abdallah The exponential hash function Journal of Experimental Algorithmics 2 1997 1 18
43. J.S. Vitter Analysis of the search performance of coalesced hashing Journal of the ACM 30 2 1983 231 258
44. J. Zobel, S. Heinz, and H.E. Williams In-memory hash tables for accumulating text vocabularies Information Processing Letters 80 6 2001 271 277 (Pubitemid 33018683)
45. M. Zukowski, S. Héman, P. Boncz, Architecture-conscious hashing, in: Proceedings of the Second Workshop on Data Management on New Hardware (DAMON'06), Chicago, USA, June 2006.