Non-Overlapping Indexing - Cache Obliviously

DOI10.4230/LIPIcs.CPM.2018.8zbMath1497.68142OpenAlexW2803114393MaRDI QIDQ5140770

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

Publication date: 16 December 2020

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

zbMATH Keywords

string algorithmssuffix treesdata structurecache oblivious

Mathematics Subject Classification ID

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

Related Items

String indexing for top-\(k\) close consecutive occurrences ⋮ I/O-efficient data structures for non-overlapping indexing ⋮ Succinct non-overlapping indexing

Cites Work

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