Abstract
The String B-tree [2] due to Ferragina and Grossi is a well-known external-memory index data structure which handles arbitrarily long strings and performs search efficiently. It is essentially a combination of B + -trees and Patricia tries. From a high-level point of view, the String B-tree of a string T of length N is a B + -tree, where the keys are pointers to the suffixes of string T, and they are sorted in lexicographically increasing order of the suffixes. A Patricia trie is used for each node of the String B-tree. By plugging in Patricia tries at nodes, the branch/search/update operations can be carried out efficiently. Due to Patricia tries, however, the String B-tree is rather heavy and complex.
Work supported by IMT 2000 Project AB02.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Ferguson, D.E.: Bit-Tree: A data structure for fast file processing. Communications of the ACM 35(6), 114–120 (1992)
Ferragina, P., Grossi, R.: 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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Na, J.C., Park, K. (2004). Simple Implementation of String B-Trees. In: Apostolico, A., Melucci, M. (eds) String Processing and Information Retrieval. SPIRE 2004. Lecture Notes in Computer Science, vol 3246. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30213-1_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-30213-1_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23210-0
Online ISBN: 978-3-540-30213-1
eBook Packages: Springer Book Archive