The string B-tree

DOI10.1145/301970.301973MaRDI QIDQ3158537zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Recommendations

• Obtaining Provably Good Performance from Suffix Trees in Secondary Storage
• scientific article; zbMATH DE number 871935
• Space efficient suffix trees
• A data structure for a sequence of string accesses in external memory
• scientific article; zbMATH DE number 1263248

Cited in

(46)

• On the weak prefix-search problem
• On the weak prefix-search problem
• Obtaining Provably Good Performance from Suffix Trees in Secondary Storage
• Compressed string dictionaries via data-aware subtrie compaction
• Space-efficient substring occurrence estimation
• Space-efficient B trees via load-balancing
• A quick tour on suffix arrays and compressed suffix arrays
• A comparative study of dictionary matching with gaps: limitations, techniques and challenges
• Cache-oblivious index for approximate string matching
• Online parameterized dictionary matching with one gap
• Parameterized dictionary matching and recognition with one gap
• Extended suffix array construction using Lyndon factors
• Faster repetition-aware compressed suffix trees based on block trees
• Two-dimensional substring indexing.
• Compressing dictionary matching index via sparsification technique
• On the longest common parameterized subsequence
• Ranked Document Retrieval in External Memory
• Permuted Longest-Common-Prefix Array
• A FAST TECHNIQUE FOR DERIVING FREQUENT STRUCTURED PATTERNS FROM BIOLOGICAL DATA SETS
• I/O-efficient data structures for non-overlapping indexing
• Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
• Worst case efficient single and multiple string matching in the RAM model
• Faster query algorithms for the text fingerprinting problem
• DMP-tree: A dynamic M-way prefix tree data structure for strings matching
• Database indexing for large DNA and protein sequence collections
• ISB-tree: A new indexing scheme with efficient expected behaviour
• Linked dynamic tries with applications to LZ-compression in sublinear time and space
• RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
• scientific article; zbMATH DE number 1424317 (Why is no real title available?)
• Top-k term-proximity in succinct space
• Scalable distributed string sorting
• String Processing and Information Retrieval
• I/O efficient dynamic data structures for longest prefix queries
• Faster repetition-aware compressed suffix trees based on block trees
• Minimal indices for predecessor search
• An artificial neural network based approach for online string matching/filtering of large databases
• Worst-case optimal tree layout in external memory
• Geometric BWT: compressed text indexing via sparse suffixes and range searching
• Distributed suffix trees
• Fast compressed tries through path decompositions
• Space-efficient B trees via load-balancing
• On the Longest Common Parameterized Subsequence
• Efficient processing of substring match queries with inverted variable-length gram indexes
• Faster compressed suffix trees for repetitive collections
• Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
• Engineering a textbook approach to index massive string dictionaries

This page was built for publication: The string B-tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3158537)