The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
The string B-tree: a new data structure for string search in external memory and its applications
Open accessAbstract
We introduce a new text-indexing data structure, the String B-Tree , that can be seen as a link between some traditional external-memory and string-matching data structures. In a short phrase, it is a combination of B-trees and Patricia tries for internal-node indices that is made more effective by adding extra pointers to speed up search and update operations. Consequently, the String B-Tree overcomes the theoretical limitations of inverted files, B-trees, prefix B-trees, suffix arrays, compacted tries and suffix trees. String B-trees have the same worst-case performance as B-trees but they manage unbounded-length strings and perform much more powerful search operations such as the ones supported by suffix trees. String B-trees are also effective in main memory (RAM model) because they improve the online suffix tree search on a dynamic set of strings. They also can be successfully applied to database indexing and software duplication.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
A universal algorithm for sequential data compression
Ziv, J., & Lempel, A. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055714 · Cited by 5,456
Compression of individual sequences via variable-rate coding
Ziv, J., & Lempel, A. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055934 · Cited by 3,432
2009 International Joint Conference on Artificial Intelligence
(2009) · doi:10.1109/jcai15434.2009 · Cited by 2,800
Information Retrieval: Data Structures and Algorithms
Frakes, W. B., & Baeza-Yates, R. A. (1992) · Cited by 2,393
Suffix Arrays: A New Method for On-Line String Searches
Manber, U., & Myers, G. (1993) · SIAM Journal on Computing · doi:10.1137/0222058 · Cited by 1,915
Comer, D. (1979) · ACM Computing Surveys · doi:10.1145/356770.356776 · Cited by 1,859
Linear pattern matching algorithms
Weiner, P. (1973) · 14th Annual Symposium on Switching and Automata Theory (swat 1973) · doi:10.1109/swat.1973.13 · Cited by 1,801
Knuth, D. E. (1973) · Cumulative Index of Computer Aided Architectural Design · Cited by 1,719
A Space-Economical Suffix Tree Construction Algorithm
McCreight, E. M. (1976) · Journal of the ACM · doi:10.1145/321941.321946 · Cited by 1,511
Data Compression Using Adaptive Coding and Partial String Matching
Cleary, J., & Witten, I. (1984) · IEEE Transactions on Communications · doi:10.1109/tcom.1984.1096090 · Cited by 1,241
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Morrison, D. R. (1968) · Journal of the ACM · doi:10.1145/321479.321481 · Cited by 969
Storing a Sparse Table with 0 (1) Worst Case Access Time
Fredman, M. L., Komlós, J., & Szemerédi, E. (1984) · Journal of the ACM · doi:10.1145/828.1884 · Cited by 748
Proceedings of the 55th Annual ACM Symposium on Theory of Computing
(2023) · doi:10.1145/3564246 · Cited by 587
Implementing the PPM data compression scheme
Moffat, A. (1990) · IEEE Transactions on Communications · doi:10.1109/26.61469 · Cited by 420
Combinatorial Algorithms on Words
(1985) · Springer eBooks · doi:10.1007/978-3-642-82456-2 · Cited by 289
The Myriad Virtues of Subword Trees
Apostolico, A. (1985) · Combinatorial Algorithms on Words · doi:10.1007/978-3-642-82456-2_6 · Cited by 274
Rapid identification of repeated patterns in strings, trees and arrays
Karp, R. M., Miller, R. E., & Rosenberg, A. L. (1972) · Proceedings of the fourth annual ACM symposium on Theory of computing - STOC '72 · doi:10.1145/800152.804905 · Cited by 274
New indices for text: PAT Trees and PAT arrays
Gonnet, G. H., Baeza-Yates, R. A., & Snider, T. (1992) · Information Retrieval · Cited by 272
A class of algorithms which require nonlinear time to maintain disjoint sets
Tarjan, R. E. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90042-4 · Cited by 263
Computer programming as an art
Knuth, D. E. (2007) · ACM Turing award lectures · doi:10.1145/1283920.1283929 · Cited by 187
Efficient suffix trees on secondary storage
Clark, D. R., & Munro, J. I. (1996) · Symposium on Discrete Algorithms · doi:10.5555/313852.314087 · Cited by 166
The Art of Computer Programming, Volumes 1-3 Boxed Set
Knuth, D. E. (1998) · Cited by 152
A theory of parameterized pattern matching
Baker, B. S. (1993) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/167088.167115 · Cited by 142
Alphabet dependence in parameterized matching
Amir, A., Farach-Colton, M., & Muthukrishnan, S. (1994) · Information Processing Letters · doi:10.1016/0020-0190(94)90086-8 · Cited by 110
Multi-attribute retrieval with combined indexes
Lum, V. Y. (1970) · Communications of the ACM · doi:10.1145/362790.362794 · Cited by 78
Efficient implementation of suffix trees
Andersson, A., & Nilsson, S. (1995) · Software Practice and Experience · doi:10.1002/spe.4380250203 · Cited by 66
Faster algorithms for the construction of parameterized suffix trees
Kosaraju, S. R. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1995.492664 · Cited by 53
Commercial applications of natural language processing
Church, K., & Rau, L. F. (1995) · Communications of the ACM · doi:10.1145/219717.219778 · Cited by 50
Cited by
Opportunistic data structures with applications
Ferragina, P., & Manzini, G. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892127 · Cited by 1,063
Self-citationNavarro, G., & Mäkinen, V. (2007) · ACM Computing Surveys · doi:10.1145/1216370.1216372 · Cited by 735
Ferragina, P., & Manzini, G. (2005) · Journal of the ACM · doi:10.1145/1082036.1082039 · Cited by 686
Self-citationCompressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
Grossi, R., & Vitter, J. S. (2005) · SIAM Journal on Computing · doi:10.1137/s0097539702402354 · Cited by 431
Self-citationLSH forest: self-tuning indexes for similarity search
Bawa, M., Condie, T., & Ganesan, P. (2005) · Proceedings of the 14th international conference on World Wide Web - WWW '05 · doi:10.1145/1060745.1060840 · Cited by 353
Metadata
- Authors
- Ferragina, P., & Grossi, R.
- Venue
- Journal of the ACM
- Published
- 1999-03
- Volume
- 46
- Issue
- 2
- Pages
- 236-280
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2087721273
- Cited by
- 317
- References
- 30
- FWCI
- 13.83
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.