Range-aggregate query problems involving geometric aggregation operations

MaRDI QIDQ5757089zbMATH OpenFDO

Authors Prosenjit Gupta

Publication date 24 August 2007

zbMATH Keywords

data structuresdatabase queryingVLSI layout processing

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)

Recommendations

• Algorithms and Computation
• Range-Aggregate Queries Involving Geometric Aggregation Operations
• Data structures for range-aggregate extent queries
• Efficient external memory structures for range-aggregate queries
• GENERALIZED INTERSECTION SEARCHING PROBLEMS

Cited in

(14)

• Finding pairwise intersections inside a query range
• Applications of range query theory to relational data base join and selection operations
• On the power of the semi-separated pair decomposition
• Approximate range closest-pair queries
• New bounds for range closest-pair problems
• scientific article; zbMATH DE number 2086302 (Why is no real title available?)
• Range-Aggregate Queries Involving Geometric Aggregation Operations
• On the Power of the Semi-Separated Pair Decomposition
• Efficient non-intersection queries on aggregated geometric data
• Data structures for range-aggregate extent queries
• scientific article; zbMATH DE number 1953129 (Why is no real title available?)
• Searching for the closest-pair in a query translate
• New bounds for range closest-pair problems
• Algorithms and Computation

This page was built for publication: Range-aggregate query problems involving geometric aggregation operations

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