메뉴 건너뛰기




Volumn 38, Issue 1, 2013, Pages 108-131

Practical perfect hashing in nearly optimal space

Author keywords

Large key sets; Perfect hash functions; Random graphs; Randomized algorithms

Indexed keywords

DATA STRUCTURES; OPEN SOURCE SOFTWARE; PERSONAL COMPUTERS;

EID: 84869238649     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2012.06.002     Document Type: Article
Times cited : (58)

References (49)
  • 1
    • 0024082546 scopus 로고
    • Input/output complexity of sorting and related problems
    • DOI 10.1145/48529.48535
    • A. Aggarwal, J.S. Vitter, The input/output complexity of sorting and related problems, Communications of the ACM 31 (9) (1988) 1116-1127. (Pubitemid 18662481)
    • (1988) Communications of the ACM , vol.31 , Issue.9 , pp. 1116-1127
    • Aggarwal, A.1    Vitter, J.S.2
  • 3
    • 0000156664 scopus 로고    scopus 로고
    • Derandomization, witnesses for boolean matrix multiplication and construction of perfect hash functions
    • N. Alon, M. Naor, Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions, Algor-ithmica 16 (4-5) (1996) 434-449. (Pubitemid 126416936)
    • (1996) Algorithmica (New York) , vol.16 , Issue.4-5 , pp. 434-449
    • Alon, N.1    Naor, M.2
  • 6
    • 24944474715 scopus 로고    scopus 로고
    • A practical minimal perfect hashing method
    • Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005. Proceedings
    • F. Botelho, Y. Kohayakawa, N. Ziviani, A practical minimal perfect hashing method, in: 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), vol. 3505, Springer, Lecture Notes in Computer Science, 2005, pp. 488-500. (Pubitemid 41322469)
    • (2005) Lecture Notes in Computer Science , vol.3503 , pp. 488-500
    • Botelho, F.C.1    Kohayakawa, Y.2    Ziviani, N.3
  • 7
    • 79953843470 scopus 로고    scopus 로고
    • Minimal perfect hashing: A competitive method for indexing internal memory
    • F. Botelho, A. Lacerda, G. Menezes, N. Ziviani, Minimal perfect hashing: a competitive method for indexing internal memory, Information Sciences 181 (13) (2011) 2608-2625.
    • (2011) Information Sciences , vol.181 , Issue.13 , pp. 2608-2625
    • Botelho, F.1    Lacerda, A.2    Menezes, G.3    Ziviani, N.4
  • 8
    • 38149010559 scopus 로고    scopus 로고
    • Simple and space-efficient minimal perfect hash functions
    • 10th Workshop on Algorithms and Data Structures (WADS'07)
    • F. Botelho, R. Pagh, N. Ziviani, Simple and space-efficient minimal perfect hash functions, in: 10th Workshop on Algorithms and Data Structures (WADS'07), vol. 4619, Springer, Lecture Notes in Computer Science, 2007, pp. 139-150.
    • (2007) Springer, Lecture Notes in Computer Science , vol.4619 , pp. 139-150
    • Botelho, F.1    Pagh, R.2    Ziviani, N.3
  • 9
    • 84857341375 scopus 로고    scopus 로고
    • Cores of random r-partite hypergraphs
    • (April)
    • F. Botelho, N. Wormald, N. Ziviani, Cores of random r-partite hypergraphs, Information Processing Letters 112 (8-9(April)) (2012) 314-319, http://dx.doi.org/10.1016/j.ipl.2011.10.017.
    • (2012) Information Processing Letters , vol.112 , Issue.8-9 , pp. 314-319
    • Botelho, F.1    Wormald, N.2    Ziviani, N.3
  • 13
    • 15744368786 scopus 로고    scopus 로고
    • Perfect hashing schemes for mining association rules
    • DOI 10.1093/comjnl/bxh074
    • C.-C. Chang, C.-Y. Lin, A perfect hashing schemes for mining association rules, The Computer Journal 48 (2) (2005) 168-179. (Pubitemid 40414923)
    • (2005) Computer Journal , vol.48 , Issue.2 , pp. 168-179
    • Chang, C.-C.1    Lin, C.-Y.2
  • 15
    • 1842473700 scopus 로고    scopus 로고
    • The bloomier filter: An efficient data structure for static support lookup tables
    • Society for Industrial and Applied Mathematics, Philadelphia, PA, USA
    • B. Chazelle, J. Kilian, R. Rubinfeld, A. Tal, The bloomier filter: an efficient data structure for static support lookup tables, in: 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04), Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2004, pp. 30-39.
    • (2004) 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04) , pp. 30-39
    • Chazelle, B.1    Kilian, J.2    Rubinfeld, R.3    Tal, A.4
  • 16
    • 0027112822 scopus 로고
    • Optimal algorithm for generating minimal perfect hash functions
    • DOI 10.1016/0020-0190(92)90220-P
    • Z. Czech, G. Havas, B. Majewski, An optimal algorithm for generating minimal perfect hash functions, Information Processing Letters 43 (5) (1992) 257-264. (Pubitemid 23575939)
    • (1992) Information Processing Letters , vol.43 , Issue.5 , pp. 257-264
    • Czech Zbigniew, J.1    Havas George2    Majewski Bohdan, S.3
  • 18
    • 84869229085 scopus 로고    scopus 로고
    • Perfect hash functions for large web repositories
    • G. Kotsis, D. Taniar, S. Bressan, I.K. Ibrahim, S. Mokhtar (Eds.), Austrian Computer Society
    • A.M. Daoud, Perfect hash functions for large web repositories, in: G. Kotsis, D. Taniar, S. Bressan, I.K. Ibrahim, S. Mokhtar (Eds.), Seventh International Conference on Information Integration and Web Based Applications Services (iiWAS'05), vol. 196, Austrian Computer Society, 2005, pp. 1053-1063.
    • (2005) Seventh International Conference on Information Integration and Web Based Applications Services (iiWAS'05) , vol.196 , pp. 1053-1063
    • Daoud, A.M.1
  • 20
    • 84869223663 scopus 로고    scopus 로고
    • Simple minimal perfect hashing in less space, in: 9th European Symposium on Algorithms (ESA'01)
    • M. Dietzfelbinger, T. Hagerup, Simple minimal perfect hashing in less space, in: 9th European Symposium on Algorithms (ESA'01), Springer, Lecture Notes in Computer Science, vol. 2161, 2001, pp. 109-120.
    • (2001) Springer, Lecture Notes in Computer Science , vol.2161 , pp. 109-120
    • Dietzfelbinger, M.1    Hagerup, T.2
  • 21
    • 70449103308 scopus 로고    scopus 로고
    • Applications of a splitting trick
    • 36th international colloquium on automata, languages and programming (ICALP'09)
    • M. Dietzfelbinger, M. Rink, Applications of a splitting trick, in: 36th International Colloquium on Automata, Languages and Programming (ICALP'09), vol. 5555, Springer, Lecture Notes in Computer Science, 2009, pp. 354-365.
    • (2009) Springer, Lecture Notes in Computer Science , vol.5555 , pp. 354-365
    • Dietzfelbinger, M.1    Rink, M.2
  • 22
    • 26444449945 scopus 로고    scopus 로고
    • Balanced allocation and dictionaries with tightly packed constant size bins
    • Automata, Languages and Programming: 32nd International Colloquium, ICALP 2005. Proceedings
    • M. Dietzfelbinger, C. Weidling, Balanced allocation and dictionaries with tightly packed constant size bins, in: Proceedings of 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), 2005, pp. 166-178. (Pubitemid 41436099)
    • (2005) Lecture Notes in Computer Science , vol.3580 , pp. 166-178
    • Dietzfelbinger, M.1    Weidling, C.2
  • 24
    • 0023363021 scopus 로고
    • Versatile data structure for edge-oriented graph algorithms
    • DOI 10.1145/214762.214769
    • J. Ebert, A versatile data structure for edge-oriented graph algorithms, Communications of the ACM 30 (1987) 513-519. (Pubitemid 17599087)
    • (1987) Communications of the ACM , vol.30 , Issue.6 , pp. 513-519
    • Ebert, J.1
  • 26
    • 84976812946 scopus 로고
    • Practical minimal perfect hash functions for large databases
    • E. Fox, L.S. Heath, Q. Chen, A. Daoud, Practical minimal perfect hash functions for large databases, Communications of the ACM 35 (1) (1992) 105-121.
    • (1992) Communications of the ACM , vol.35 , Issue.1 , pp. 105-121
    • Fox, E.1    Heath, L.S.2    Chen, Q.3    Daoud, A.4
  • 28
    • 78649841467 scopus 로고    scopus 로고
    • Sorting and searching on the word RAM
    • STACS 98: 15th Annual Symposium on Theoretical Aspects of Computer Science
    • T. Hagerup, Sorting and searching on the word RAM, in: 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS'98), Springer-Verlag, London, UK, 1998, pp. 366-398. (Pubitemid 128044803)
    • (1998) Lecture Notes in Computer Science , Issue.1373 , pp. 366-398
    • Hagerup, T.1
  • 29
    • 84957076793 scopus 로고    scopus 로고
    • Efficient minimal perfect hashing in nearly minimal space
    • STACS 2001
    • T. Hagerup, T. Tholey, Efficient minimal perfect hashing in nearly minimal space, in: 18th Symposium on Theoretical Aspects of Computer Science (STACS'01), vol. 2010, Springer, Lecture Notes in Computer Science, 2001, pp. 317-326. (Pubitemid 33241762)
    • (2001) Lecture Notes in Computer Science , Issue.2010 , pp. 317-326
    • Hagerup, T.1    Tholey, T.2
  • 30
    • 33747001690 scopus 로고
    • The art of computer systems performance analysis: Techniques for experimental design
    • 1st ed. John Wiley
    • R. Jain, The Art of Computer Systems Performance Analysis: Techniques for Experimental Design, Measurement, Simulation, and Modeling, 1st ed. John Wiley, 1991.
    • (1991) Measurement, Simulation, and Modeling
    • Jain, R.1
  • 31
    • 38249037008 scopus 로고
    • Poisson convergence and poisson processes with applications to random graphs
    • S. Janson, Poisson convergence and Poisson processes with applications to random graphs, Stochastic Processes and their Applications 26 (1987) 1-30.
    • (1987) Stochastic Processes and Their Applications , vol.26 , pp. 1-30
    • Janson, S.1
  • 34
    • 0032091597 scopus 로고    scopus 로고
    • Memory management during run generation in external sorting
    • P. Larson, G. Graefe, Memory management during run generation in external sorting, in: 1998 ACM SIGMOD International Conference on Management of Data, ACM Press, 1998, pp. 472-483. (Pubitemid 128655992)
    • (1998) SIGMOD Record , vol.27 , Issue.2 , pp. 472-483
    • Larson, P.-A.1    Graefe, G.2
  • 35
    • 50949096788 scopus 로고    scopus 로고
    • Perfect spatial hashing
    • DOI 10.1145/1141911.1141926, ACM Transactions on Graphics - Proceedings of ACM SIGGRAPH 2006
    • S. Lefebvre, H. Hoppe, Perfect spatial hashing, ACM Transactions on Graphics 25 (3) (2006) 579-588. (Pubitemid 44481017)
    • (2006) ACM Transactions on Graphics , vol.25 , Issue.3 , pp. 579-588
    • Lefebvre, S.1    Hoppe, H.2
  • 38
    • 1842539405 scopus 로고    scopus 로고
    • The pure literal rule threshold and cores in random hypergraphs
    • Society for Industrial and Applied Mathematics, Philadelphia, PA, USA
    • M. Molloy. The pure literal rule threshold and cores in random hypergraphs, in: 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04), Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2004, pp. 672-681.
    • (2004) 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04) , pp. 672-681
    • Molloy, M.1
  • 41
    • 84948981268 scopus 로고    scopus 로고
    • Hash and displace: Efficient evaluation of minimal perfect hash functions
    • R. Pagh, Hash and displace: efficient evaluation of minimal perfect hash functions, in: 6th Workshop on Algorithms and Data Structures (WADS'99), 1999, pp. 49-54.
    • (1999) 6th Workshop on Algorithms and Data Structures (WADS'99) , pp. 49-54
    • Pagh, R.1
  • 42
    • 0036248032 scopus 로고    scopus 로고
    • Low redundancy in static dictionaries with constant query time
    • PII S0097539700369909
    • R. Pagh, Low redundancy in static dictionaries with constant query time, SIAM Journal on Computing 31 (2) (2001) 353-363. (Pubitemid 33782954)
    • (2001) SIAM Journal on Computing , vol.31 , Issue.2 , pp. 353-363
    • Pagh, R.1
  • 44
    • 0026837137 scopus 로고
    • Improved bounds for covering complete uniform hypergraphs
    • J. Radhakrishnan, Improved bounds for covering complete uniform hypergraphs, Information Processing Letters 41 (1992) 203-207.
    • (1992) Information Processing Letters , vol.41 , pp. 203-207
    • Radhakrishnan, J.1
  • 45
    • 84968909171 scopus 로고    scopus 로고
    • Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
    • Society for Industrial and Applied Mathematics, Philadelphia, PA, USA
    • R. Raman, V. Raman, S.S. Rao, Succinct indexable dictionaries with applications to encoding k-ary trees and multisets, in: 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02), Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2002, pp. 233-242.
    • (2002) 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02) , pp. 233-242
    • Raman, R.1    Raman, V.2    Rao, S.S.3
  • 46
    • 0025507834 scopus 로고
    • The spatial complexity of oblivious k-probe hash functions
    • (October))
    • J.P. Schmidt, A. Siegel, The spatial complexity of oblivious k-probe hash functions, SIAM Journal on Computing 19 (5(October)) (1990) 775-786.
    • (1990) SIAM Journal on Computing , vol.19 , Issue.5 , pp. 775-786
    • Schmidt, J.P.1    Siegel, A.2
  • 47
    • 0344941446 scopus 로고    scopus 로고
    • External memory algorithms and data structures
    • J. Abello, J.S. Vitter (Eds.) American Mathematical Society Press, Providence, R.I.
    • J.S. Vitter, External memory algorithms and data structures, in: J. Abello, J.S. Vitter (Eds.), External Memory Algorithms and Visualization, American Mathematical Society Press, Providence, RI, 1999, pp. 1-38.
    • (1999) External Memory Algorithms and Visualization , pp. 1-38
    • Vitter, J.S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.