Simple implementation of string B-trees

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

Volumn 3246, Issue , 2004, Pages 214-215

  Na, Joong Chae ^a   Park, Kunsoo ^a  

^a Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84871100309     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30213-1_31     Document Type: Conference Paper

References (2)

1. D. E. Ferguson. Bit-Tree: A data structure for fast file processing. Communications of the ACM, 35(6):114-120, 1992.
2. P. Ferragina and R. Grossi. The String B-tree: A new data structure for string search in external memory and its applications. Journal of the ACM, 46(2):236-280, 1999.