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
Multidimensional access methods
ACM Computing Surveys (CSUR)
Compact pat trees
Efficient suffix trees on secondary storage
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Efficient cross-trees for external memory
External memory algorithms
ACM Computing Surveys (CSUR)
Multidimensional divide-and-conquer
Communications of the ACM
A unifying look at data structures
Communications of the ACM
Efficient computation of temporal aggregates with range predicates
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Aggregate Processing of Planar Points
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Optimal Dynamic Range Searching in Non-replicating Index Structures
ICDT '99 Proceedings of the 7th International Conference on Database Theory
External memory data structures
Handbook of massive data sets
Succinct static data structures
Succinct static data structures
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
Time-space trade-offs for predecessor search
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets
ACM Transactions on Algorithms (TALG)
Space-efficient static trees and graphs
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Orthogonal range searching in linear and almost-linear space
Computational Geometry: Theory and Applications
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Efficient range searching for categorical and plain data
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
We present external memory data structures for efficiently answering range-aggregate queries. The range-aggregate problem is defined as follows: Given a set of weighted points in R^d, compute the aggregate of the weights of the points that lie inside a d-dimensional orthogonal query rectangle. The aggregates we consider in this paper include count, sum, and max. First, we develop a structure for answering two-dimensional range-count queries that uses O(N/B) disk blocks and answers a query in O(log"BN) I/Os, where N is the number of input points and B is the disk block size. The structure can be extended to obtain a near-linear-size structure for answering range-sum queries using O(log"BN) I/Os, and a linear-size structure for answering range-max queries in O(log"B^2N) I/Os. Our structures can be made dynamic and extended to higher dimensions.