An optimal algorithm for finding segments intersections
Proceedings of the eleventh annual symposium on Computational geometry
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Spatial databases with application to GIS
Spatial databases with application to GIS
Algorithms for VLSI Physcial Design Automation
Algorithms for VLSI Physcial Design Automation
Efficient aggregation over objects with extent
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
Data Mining and Knowledge Discovery
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Efficient Execution of Range-Aggregate Queries in Data Warehouse Environments
ER '01 Proceedings of the 20th International Conference on Conceptual Modeling: Conceptual Modeling
Range Aggregate Processing in Spatial Databases
IEEE Transactions on Knowledge and Data Engineering
Optimizing spatial Min/Max aggregations
The VLDB Journal — The International Journal on Very Large Data Bases
Overlaying multiple maps efficiently
CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
On the Power of the Semi-Separated Pair Decomposition
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
On the power of the semi-separated pair decomposition
Computational Geometry: Theory and Applications
Range-aggregate queries for geometric extent problems
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
| Hi-index | 0.00 |
We consider variations of the standard orthogonal range searching motivated by applications in database querying and VLSI layout processing. In a generic instance of such a problem, called a range-aggregate query problem we wish to preprocess a set S of geometric objects such that given a query orthogonal range q, a certain intersection or proximity query on the objects of S intersected by q can be answered efficiently. Although range-aggregate queries have been widely investigated in the past for aggregation functions like average, count, min, max, sum etc. we consider aggregation operations involving geometric intersection searching problems in this paper. Efficient solutions are provided for point enclosure queries for d ≥ 1, 1-d interval intersection, 2-d orthogonal segment intersection and interval/rectangle/hyper-rectangle enclosure queries in this framework.