Efficient external memory structures for range-aggregate queries
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 Rd, 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( logBN) 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( logBN) I/Os, and a linear-size structure for answering range-max queries in O(logB2N) I/Os. Our structures can be made dynamic and extended to higher dimensions. © 2012 Elsevier B.V.
Duke Scholars
Altmetric Attention Stats
Dimensions Citation Stats
Published In
DOI
ISSN
Publication Date
Volume
Issue
Start / End Page
Related Subject Headings
- Geological & Geomatics Engineering
- 49 Mathematical sciences
- 46 Information and computing sciences
- 0802 Computation Theory and Mathematics
- 0103 Numerical and Computational Mathematics
- 0101 Pure Mathematics
Citation
Published In
DOI
ISSN
Publication Date
Volume
Issue
Start / End Page
Related Subject Headings
- Geological & Geomatics Engineering
- 49 Mathematical sciences
- 46 Information and computing sciences
- 0802 Computation Theory and Mathematics
- 0103 Numerical and Computational Mathematics
- 0101 Pure Mathematics