Non-overlapping indexing -- cache obliviously

DOI10.4230/LIPICS.CPM.2018.8MaRDI QIDQ5140770zbMATH OpenOpenAlexFDO

Authors Sahar Hooshmand, Paniz Abedin, M. Oğuzhan Külekci, Sharma V. Thankachan

Publication date 16 December 2020

Full work available at URL https://doi.org/10.4230/LIPIcs.CPM.2018.8

zbMATH Keywords

cache obliviousdata structurestring algorithmssuffix trees

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Recommendations

• I/O-efficient data structures for non-overlapping indexing
• Range non-overlapping indexing
• Succinct Non-overlapping Indexing
• Succinct non-overlapping indexing
• Range Non-overlapping Indexing and Successive List Indexing

Cites work

• Cache-oblivious algorithms
• Cache-Oblivious B-Trees
• Cache-oblivious string dictionaries
• Data structures and algorithms for the string statistics problem
• Fast Algorithms for Finding Nearest Common Ancestors
• On-line construction of suffix trees
• Range non-overlapping indexing
• Range Non-overlapping Indexing and Successive List Indexing
• Sorted range reporting
• String-matching on ordered alphabets
• Succinct Non-overlapping Indexing
• Suffix Arrays: A New Method for On-Line String Searches

Cited in

(11)

• String indexing for top-\(k\) close consecutive occurrences
• I/O-efficient data structures for non-overlapping indexing
• Succinct non-overlapping indexing
• Succinct Non-overlapping Indexing
• Search-Order Independent State Caching
• Range Non-overlapping Indexing and Successive List Indexing
• Range non-overlapping indexing
• Non-overlapping indexing in BWT-runs bounded space
• String indexing for top-\(k\) close consecutive occurrences
• Non-overlapping indexing in BWT-runs bounded space
• An efficient cache conscious multi-dimensional index structure

This page was built for publication: Non-overlapping indexing -- cache obliviously

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