메뉴 건너뛰기




Volumn , Issue , 2009, Pages 133-144

Theory and practise of monotone minimal perfect hashing

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION MANAGEMENT; SEARCH ENGINES;

EID: 84880340821     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972894.13     Document Type: Conference Paper
Times cited : (12)

References (30)
  • 3
    • 38149010559 scopus 로고    scopus 로고
    • Simple and spaceefficient minimal perfect hash functions
    • F. C. Botelho, R. Pagh, and N. Ziviani. Simple and spaceefficient minimal perfect hash functions. In WADS, pages 139-150, 2007.
    • (2007) WADS , pp. 139-150
    • Botelho, F.C.1    Pagh, R.2    Ziviani, N.3
  • 4
    • 48949097559 scopus 로고    scopus 로고
    • External perfect hashing for very large key sets
    • F. C. Botelho and N. Ziviani. External perfect hashing for very large key sets. In CIKM, pages 653-662, 2007.
    • (2007) CIKM , pp. 653-662
    • Botelho, F.C.1    Ziviani, N.2
  • 8
    • 85031086563 scopus 로고    scopus 로고
    • Efficient suffix trees on secondary storage
    • extended abstract
    • D. R. Clark and J. I. Munro. Efficient suffix trees on secondary storage (extended abstract). In SODA, pages 383- 391, 1996.
    • (1996) SODA , pp. 383-391
    • Clark, D.R.1    Munro, J.I.2
  • 9
    • 49049109270 scopus 로고    scopus 로고
    • Succinct data structures for retrieval and approximate membership
    • (extended abstract),L. Aceto, I. Damgård, L. A. Goldberg, M. M. Halldórsson, A. Ingólfsdóttir, and I. Walukiewicz, editors, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, volume 5125 of Lecture Notes in Computer Science, Springer
    • 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.
    • (2008) Automata, Languages and Programming, 35th International Colloquium, ICALP 2008 , pp. 385-396
    • Dietzfelbinger, M.1    Pagh, R.2
  • 10
    • 0016047467 scopus 로고
    • Efficient storage and retrieval by content and address of static files
    • P. Elias. Efficient storage and retrieval by content and address of static files. J. Assoc. Comput. Mach., 21(2):246-260, 1974.
    • (1974) J. Assoc. Comput. Mach. , vol.21 , Issue.2 , pp. 246-260
    • Elias, P.1
  • 12
    • 84976823410 scopus 로고
    • Orderpreserving minimal perfect hash functions and information retrieval
    • E. A. Fox, Q. F. Chen, A. M. Daoud, and L. S. Heath. Orderpreserving minimal perfect hash functions and information retrieval. ACM Trans. Inf. Sys., 9(3):281-308, 1991.
    • (1991) ACM Trans. Inf. Sys. , vol.9 , Issue.3 , pp. 281-308
    • Fox, E.A.1    Chen, Q.F.2    Daoud, A.M.3    Heath, L.S.4
  • 13
    • 0002302934 scopus 로고
    • On the size of separating systems and families of perfect hash functions
    • 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.
    • (1984) SIAM J. Algebraic Discrete Methods , vol.5 , Issue.1 , pp. 61-68
    • Fredman, M.L.1    Komlós, J.2
  • 14
    • 0021467937 scopus 로고
    • Storing a sparse table with o(1) worst case access time
    • July
    • 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.
    • (1984) J. Assoc. Comput. Mach. , vol.31 , Issue.3 , pp. 538-544
    • Fredman, M.L.1    Komlós, J.2    Szemerédi, E.3
  • 15
    • 33751016062 scopus 로고    scopus 로고
    • A simple optimal representation for balanced parentheses
    • 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.
    • (2006) Theor. Comput. Sci , vol.368 , Issue.3 , pp. 231-246
    • Geary, R.F.1    Rahman, N.2    Raman, R.3    Raman, V.4
  • 16
    • 33746329339 scopus 로고    scopus 로고
    • Optimal lower bounds for rank and select indexes
    • M. Bugliesi, B. Preneel, V. Sassone, and I.Wegener, editors, Venice, Italy, July 10-14, 2006, Proceedings, Part I, volume 4051 of Lecture Notes in Computer Science, Springer
    • 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.
    • (2006) Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006 , pp. 370-381
    • Golynski, A.1
  • 18
    • 35448972513 scopus 로고    scopus 로고
    • Compressed data structures: Dictionaries and data-aware measures
    • 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.
    • (2007) Theoret. Comput. Sci. , vol.387 , Issue.3 , pp. 313-331
    • Gupta, A.1    Hon, W.-K.2    Shah, R.3    Vitter, J.S.4
  • 21
    • 0000978261 scopus 로고
    • Optimal computer search trees and variable-length alphabetical codes
    • 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.
    • (1971) SIAM J. Applied Math. , vol.21 , Issue.4 , pp. 514-532
    • Hu, T.C.1    Tucker, A.C.2
  • 23
    • 0009351280 scopus 로고    scopus 로고
    • Algorithm alley: Hash functions
    • 115-116, Sept
    • B. Jenkins. Algorithm alley: Hash functions. Dr. Dobb's Journal of Software Tools, 22(9):107-109, 115-116, Sept. 1997.
    • (1997) Dr. Dobb's Journal of Software Tools , vol.22 , Issue.9 , pp. 107-109
    • Jenkins, B.1
  • 24
    • 24944553353 scopus 로고    scopus 로고
    • Efficient implementation of rank and select functions for succinct representation
    • S. E. Nikoletseas, editor, volume 3503 of Lecture Notes in Computer Science, 7. Springer
    • 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.
    • (2005) Proc. of the Experimental and Efficient Algorithms, 4th InternationalWorkshop , pp. 315-332
    • Kim, D.K.1    Na, J.C.2    Kim, J.E.3    Park, K.4
  • 25
    • 0242337515 scopus 로고    scopus 로고
    • Sorting and searching
    • Addison-Wesley, second edition
    • D. E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, second edition, 1997.
    • (1997) The Art of Computer Programming , vol.3
    • Knuth, D.E.1
  • 27
    • 38149018071 scopus 로고
    • Patricia-practical algorithm to retrieve information coded in alphanumeric
    • D. R. Morrison. PATRICIA-practical algorithm to retrieve information coded in alphanumeric. J. Assoc. Comput. Mach., 15(4):514-534, 1968.
    • (1968) J. Assoc. Comput. Mach. , vol.15 , Issue.4 , pp. 514-534
    • Morrison, D.R.1
  • 28
    • 0036306861 scopus 로고    scopus 로고
    • Succinct representation of balanced parentheses and static trees
    • J. I. Munro and V. Raman. Succinct representation of balanced parentheses and static trees. SIAM J. Comput., 31(3):762-776, 2001.
    • (2001) SIAM J., Comput. , vol.31 , Issue.3 , pp. 762-776
    • Munro, J.I.1    Raman, V.2


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