I/O-efficient data structures for non-overlapping indexing

DOI10.1016/J.TCS.2020.12.006MaRDI QIDQ2220773zbMATH OpenOpenAlexFDO

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

Publication date 25 January 2021

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2020.12.006

zbMATH Keywords

data structuresuffix treesstring algorithms

Mathematics Subject Classification ID

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

Recommendations

• Non-overlapping indexing -- cache obliviously
• Range non-overlapping indexing
• Succinct Non-overlapping Indexing
• Succinct non-overlapping indexing
• Range Non-overlapping Indexing and Successive List Indexing

Cites work

• scientific article; zbMATH DE number 6146456 (Why is no real title available?)
• scientific article; zbMATH DE number 5499319 (Why is no real title available?)
• Cache-oblivious algorithms
• Cache-oblivious string dictionaries
• Data structures and algorithms for the string statistics problem
• Improved algorithms for the range next value problem and applications
• Non-overlapping indexing -- cache obliviously
• On position restricted substring searching in succinct space
• On-line construction of suffix trees
• Ordered and unordered top-\(K\) range reporting in large data sets
• Position-Restricted Substring Searching
• Position-restricted substring searching over small alphabets
• Range Non-overlapping Indexing and Successive List Indexing
• Range non-overlapping indexing
• Sorted range reporting
• Substring range reporting
• Succinct Non-overlapping Indexing
• Succinct non-overlapping indexing
• The string B-tree

Cited in

(9)

• Range Non-overlapping Indexing and Successive List Indexing
• An efficient cache conscious multi-dimensional index structure
• scientific article; zbMATH DE number 1515868 (Why is no real title available?)
• Non-overlapping indexing -- cache obliviously
• Efficient Asymmetric Index Encapsulation Scheme for Named Data
• Succinct non-overlapping indexing
• Range non-overlapping indexing
• Succinct Non-overlapping Indexing
• Non-overlapping indexing in BWT-runs bounded space

This page was built for publication: I/O-efficient data structures for non-overlapping indexing

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