The string B-tree
From MaRDI portal
Publication:3158537
DOI10.1145/301970.301973zbMath1065.68518MaRDI QIDQ3158537
Paolo Ferragina, Roberto Grossi
Publication date: 25 January 2005
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/301970.301973
68Q25: Analysis of algorithms and problem complexity
68P05: Data structures
68P20: Information storage and retrieval of data
Related Items
RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS, A FAST TECHNIQUE FOR DERIVING FREQUENT STRUCTURED PATTERNS FROM BIOLOGICAL DATA SETS, Worst-case efficient single and multiple string matching on packed texts in the word-RAM model, A quick tour on suffix arrays and compressed suffix arrays, Faster query algorithms for the text fingerprinting problem, Cache-oblivious index for approximate string matching, ISB-tree: A new indexing scheme with efficient expected behaviour, On the longest common parameterized subsequence, Two-dimensional substring indexing., Distributed suffix trees, Worst Case Efficient Single and Multiple String Matching in the RAM Model, On the Weak Prefix-Search Problem, On the Longest Common Parameterized Subsequence, An artificial neural network based approach for online string matching/filtering of large databases, Permuted Longest-Common-Prefix Array
