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
Efficient computation of temporal aggregates with range predicates
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Introduction to VLSI 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
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
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
Data Structures for Extension Violations in a Query Range
Journal of Mathematical Modelling and Algorithms
Range-aggregate queries involving geometric aggregation operations
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Two-Dimensional range diameter queries
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Data structures for range-aggregate extent queries
Computational Geometry: Theory and Applications
| 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. Efficient solutions are provided for point enclosure queries, 1-d interval intersection, 2-d orthogonal segment intersection and 1- and 2-d closest pair problems in this framework. Although range-aggregate queries have been widely investigated in the past for aggregation functions like average, count, min, max, sum etc. we consider geometric aggregation operations in this paper.