DATA STRUCTURES FOR RANGE-AGGREGATION OVER CATEGORIES

DOI10.1142/S0129054111008982zbMath1255.68060OpenAlexW1992260829MaRDI QIDQ2909107

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

geometric searchingcolored or generalized intersection aggregate problemsoutput-sensitive querying

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: DATA STRUCTURES FOR RANGE-AGGREGATION OVER CATEGORIES