Data structures for range-aggregation over categories

DOI10.1142/S0129054111008982MaRDI QIDQ2909107zbMATH OpenOpenAlexFDO

Authors Saladi Rahul, Prosenjit Gupta, K. S. Rajan

Publication date 29 August 2012

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054111008982

zbMATH Keywords

colored or generalized intersection aggregate problemsgeometric searchingoutput-sensitive querying

Mathematics Subject Classification ID

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

Recommendations

• Significant-presence range queries in categorical data.
• Efficient range searching for categorical and plain data
• Colored top-\(K\) range-aggregate queries
• Range-Aggregate Queries Involving Geometric Aggregation Operations
• Approximate colored range and point enclosure queries

Cites work

• A technique for adding range restrictions to generalized searching problems
• Algorithms for generalized halfspace range searching and other intersection searching problems
• Filtering Search: A New Approach to Query-Answering
• Fractional cascading. I: A data structuring technique
• Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
• GENERALIZED INTERSECTION SEARCHING PROBLEMS
• Making data structures persistent
• On the Average Number of Maxima in a Set of Vectors and Applications
• Priority Search Trees

Cited in

(4)

• Colored top-\(K\) range-aggregate queries
• Efficient range searching for categorical and plain data
• Algorithms and Computation
• Significant-presence range queries in categorical data.

This page was built for publication: Data structures for range-aggregation over categories

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