Near-optimal range reporting structures for categorical data

DOI10.1137/1.9781611973105.20MaRDI QIDQ5741728zbMATH OpenOpenAlexFDO

Authors Kasper Green Larsen, Freek Van Walderveen

Publication date 15 May 2019

Published in Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973105.20

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Efficient range searching for categorical and plain data
• Optimal color range reporting in one dimension
• I/O-efficient data structures for colored range and prefix reporting
• Significant-presence range queries in categorical data.
• scientific article; zbMATH DE number 1947378

Cited in

(15)

• Data structures for categorical path counting queries
• I/O-optimal categorical 3-sided skyline queries
• Optimal color range reporting in one dimension
• Indexing and querying color sets of images
• Connectivity oracles for graphs subject to vertex failures
• scientific article; zbMATH DE number 1947378 (Why is no real title available?)
• Categorical range reporting with frequencies
• Shared-constraint range reporting
• I/O-efficient data structures for colored range and prefix reporting
• Ranked Document Retrieval in External Memory
• Absent Subsequences in Words
• Hierarchical categories in colored searching
• The edit distance to k-subsequence universality
• Conditional lower bounds for dynamic geometric measure problems
• Conditional lower bounds for dynamic geometric measure problems

This page was built for publication: Near-optimal range reporting structures for categorical data

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