Functional approach to data structures and its use in multidimensional searching
SIAM Journal on Computing
The input/output complexity of sorting and related problems
Communications of the ACM
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
Progressive approximate aggregate queries with a multi-resolution tree structure
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Efficient OLAP Operations in Spatial Data Warehouses
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Dynamic rectangular intersection with priorities
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
New data structures for orthogonal range searching
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Optimal dynamic interval management in external memory
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
I/O-efficient dynamic planar point location
Computational Geometry: Theory and Applications
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
An optimal dynamic interval stabbing-max data structure?
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On computing temporal aggregates with range predicates
ACM Transactions on Database Systems (TODS)
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Orthogonal Range Reporting in Three and Higher Dimensions
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Proceedings of the twenty-sixth annual symposium on Computational geometry
Rectangle-efficient aggregation in spatial data streams
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
A scalable algorithm for maximizing range sum in spatial databases
Proceedings of the VLDB Endowment
Approximate MaxRS in spatial databases
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
We consider the orthogonal range aggregation problem. The dataset S consists of N axis-parallel rectangles in R2, each of which is associated with an integer weight. Given an axis-parallel rectangle Q and an aggregate function F, a query reports the aggregated result of the weights of the rectangles in S intersecting Q. The goal is to preprocess S into a structure such that all queries can be answered efficiently. We present indexing schemes to solve the problem in external memory when F = max (hence, min) and F = sum (hence, count and average), respectively. Our schemes have linear or near-linear space, and answer a query in O(logBN) or O(logB2/BN) I/Os, where B is the disk block size.