We examine the problem of computing MIN/MAX aggregate queries over a collection of spatial objects. Each spatial object is associated with a weight (value), for example, the average temperature or rainfall over the area covered by the object. Given a query rectangle, the MIN/MAX problem computes the minimum/maximum weight among all objects intersecting the query rectangle. Traditionally such queries have been performed as range search queries. Assuming that the objects are indexed by a spatial access method, the MIN/MAX is computed as objects are retrieved. This requires effort proportional to the number of objects intersecting the query interval, 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. In this paper we propose four optimizations that further improve the performance of MIN/MAX queries. Our experiments show that the proposed optimizations offer drastic performance improvement over previous approaches. Moreover, as a by-product of this work we present a dynamic version of the MSB-tree, an index that has been proposed for the MIN/MAX computation over 1-dimensional interval objects.
|
1651
|
R-trees: A dynamic index structure for spatial searching
– Guttman
- 1984
|
|
1541
|
Computational Geometry: An Introduction
– Preparata, Shamos
- 1985
|
|
502
|
Data cube: A relational aggregation operator generalizing group-by, and sub-totals
– Gray, Bosworth, et al.
- 1996
|
|
452
|
The R ∗ -tree: An Efficient and Robust Access Method for Points and Rectangles
– Beckmann, Kriegel, et al.
- 1990
|
|
303
|
The R+ Tree: A Dynamic Index for Multidimensional Objects
– Sellis, Roussopoulos, et al.
- 1987
|
|
194
|
Geometric range searching and its relatives
– Agarwal, Erickson
- 1999
|
|
192
|
R+-tree: A dynamic index for multi-dimensional objects
– Sellis, Roussopoulos, et al.
- 1987
|
|
90
|
Multidimensional divide-and-conquer
– Bentley
- 1980
|
|
71
|
On computing the data cube
– Sarawagi, Agrawal, et al.
- 1996
|
|
55
|
Incremental computation and maintenance of temporal aggregates
– Yang, Widom
- 2001
|
|
54
|
Multi-dimensional searching and computational geometry
– Mehlhorn
- 1984
|
|
50
|
Geometric range searching
– Matousek
- 1994
|
|
48
|
Progressive approximate aggregate queries with a multi-resolution tree structure
– Lazaridis, Mehrotra
- 2001
|
|
43
|
The R*-tree: an ecient and robust access method for points and rectangles
– Beckmann, Kriegel, et al.
- 1990
|
|
40
|
Efficient computation of temporal aggregates with range predicates
– Zhang, Markowetz, et al.
- 2001
|
|
31
|
Relative prefix sums: An efficient approach for querying dynamic OLAP data cubes
– Geffner, Agrawal, et al.
- 1999
|
|
30
|
Efficient aggregation over objects with extent
– Zhang, Tsotras, et al.
- 2002
|
|
27
|
Indexing spatio-temporal data warehouses
– Papadias, Tao, et al.
- 2002
|
|
26
|
Hierarchical cubes for range-sum queries
– Chan, Ioannidis
- 1999
|
|
13
|
The Ra*-tree: An Improved Rtree with Materialized Data for Supporting Range Queries on OLAP-Data
– Jurgens, Lenz
- 1998
|
|
10
|
How to avoid building datablades that know the value of everything and the cost of nothing
– Aoki
- 1999
|
|
9
|
Cubetree: Organization of and Bulk
– Roussopoulos, Kotidis, et al.
- 1997
|
|
8
|
Dynamic Update Cube for Range-Sum Queries
– Chung, Chun, et al.
- 2001
|
|
8
|
Range Queries
– Ho, Agrawal, et al.
- 1997
|
|
7
|
Performance Models for Index Structures with and without Aggregated Data
– Jurgens, Lenz
- 1999
|
|
5
|
Relative Pre Sums: An Ecient Approach for Querying Dynamic OLAP Data Cubes
– Gener, Agrawal, et al.
- 1999
|
|
4
|
Abbadi, "The Dynamic Data Cube
– Geffner, Agrawal, et al.
- 2000
|
|
2
|
Tsay, "Techniques for Speeding up Range-Max Queries
– Ho, Agrawal, et al.
- 1997
|
|
1
|
Tsay, \Techniques for Speeding up Range-Max Queries
– Ho, Agrawal, et al.
- 1997
|
|
1
|
Indexing Spatio-Temporal Data Warehouses", submitted for publication
– Papadias, Kalnis, et al.
- 2001
|
|
1
|
Efficient Aggregation over Multidimensional Objects
– Zhang, Tsotras, et al.
|
|
