Access the full text.
Sign up today, get DeepDyve free for 14 days.
K. Mehlhorn (1984)
Multi-dimensional searching and computational geometry
C. Chan, Y. Ioannidis (1999)
Hierarchical Prefix Cubes for Range-Sum Queries
S. Geffner, D. Agrawal, A. Abbadi, Terence Smith (1999)
Relative prefix sums: an efficient approach for querying dynamic OLAP data cubesProceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)
Ching-Tien Ho, R. Agrawal, N. Megiddo, R. Srikant (1997)
Range queries in OLAP data cubes
J. Bentley (1980)
Multidimensional divide-and-conquerCommun. ACM, 23
F. Preparata, M. Shamos (1985)
Computational geometry: an introductionMathematics of Computation, 47
Walid Aref, H. Samet (1990)
Efficient processing of window queries in the pyramid data structure
Donghui Zhang, Alexander Markowetz, V. Tsotras, D. Gunopulos, B. Seeger (2001)
Efficient computation of temporal aggregates with range predicates
Donghui Zhang, V. Tsotras, D. Gunopulos (2002)
Efficient aggregation over objects with extent
M. Jürgens, H. Lenz (1999)
PISA: Performance models for Index Structures with and without Aggregated dataProceedings. Eleventh International Conference on Scientific and Statistical Database Management
MatoušekJiří (1994)
Geometric range searchingACM Computing Surveys
Seok-Ju Chun, C. Chung, Ju-hong Lee, Seok-Lyong Lee (2001)
Dynamic Update Cube for Range-sum Queries
A. Moura (1992)
International research institute for climate prediction : a proposal
S. Geffner, D. Agrawal, A. Abbadi (2000)
The Dynamic Data Cube
Paul Aoki (1999)
How to avoid building DataBlades(R) that know the value of everything and the cost of nothingProceedings. Eleventh International Conference on Scientific and Statistical Database Management
D. Papadias, Panos Kalnis, Jun Zhang, Yufei Tao (2001)
Efficient OLAP Operations in Spatial Data Warehouses
A. Guttman (1984)
R-trees: a dynamic index structure for spatial searching
Iosif Lazaridis, S. Mehrotra (2001)
Progressive approximate aggregate queries with a multi-resolution tree structure
M. Jürgens, H. Lenz (1998)
The R/sub a/*-tree: an improved R*-tree with materialized data for supporting range queries on OLAP-dataProceedings Ninth International Workshop on Database and Expert Systems Applications (Cat. No.98EX130)
D. Papadias, Yufei Tao, Panos Kalnis, Jun Zhang (2002)
Indexing spatio-temporal data warehousesProceedings 18th International Conference on Data Engineering
Donghui Zhang, V. Tsotras (2001)
Improving min/max aggregation over spatial objects
N. Beckmann, H. Kriegel, R. Schneider, B. Seeger (1990)
The R*-tree: an efficient and robust access method for points and rectangles
T. Sellis, N. Roussopoulos, C. Faloutsos (1987)
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
Jun Yang, J. Widom (2000)
Temporal View Self-Maintenance
N. Roussopoulos, Y. Kotidis, M. Roussopoulos (1997)
Cubetree: organization of and bulk incremental updates on the data cube, 26
Jun Yang, J. Widom (2001)
Incremental computation and maintenance of temporal aggregatesThe VLDB Journal, 12
J. Gray, S. Chaudhuri, Adam Bosworth, Andrew Layman, Don Reichart, Murali Venkatrao, Frank Pellow, H. Pirahesh (1996)
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-TotalsData Mining and Knowledge Discovery, 1
Aggregate computation over a collection of spatial objects appears in many real-life applications. Aggregates are computed on values (weights) associated with spatial objects, for example, the temperature or rainfall over the area covered by the object. In this paper we concentrate on MIN/MAX aggregations: “given a query rectangle, find the minimum/maximum weight among all objects intersecting the query rectangle.” Traditionally such queries have been performed as range searches. Assuming that objects are indexed by a spatial access method (SAM), the MIN/MAX is computed while retrieving those objects intersecting the query interval. This requires effort proportional to the number of objects satisfying the query, which may be large. A better approach is to maintain aggregate information among the index nodes of the spatial access method; then various index paths can be eliminated during the range search. Yet another approach is to build a specialized index that maintains the aggregate incrementally. We propose four novel optimizations for improving the performance of MIN/MAX queries when an index structure (traditional or specialized) is present. Moreover, we introduce the MR-tree, an R-tree-like dynamic specialized index that incorporates all four optimizations. Our experiments show that the MR-tree offers drastic performance improvement over previous solutions. As a byproduct of this work we present an optimized version of the MSB-tree, an index that has been proposed for the MIN/MAX computation over 1D interval objects.
The VLDB Journal – Springer Journals
Published: Apr 1, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.