Abstract. Temporal aggregation is an important but costly operation for applications that maintain time-evolving data (data warehouses, temporal databases, etc.). In this paper we examine the problem of computing temporal aggregates over data streams. Such aggregates are maintained using multiple levels of temporal granularities: older data is aggregated using coarser granularities while more recent data is aggregated with finer detail. We present specialized indexing schemes for dynamically and progressively maintaining temporal aggregates. Moreover, these schemes can be parameterized. The levels of granularity as well as their corresponding index sizes (or validity lengths) can be dynamically adjusted. This provides a useful trade-off between aggregation detail and storage space. Analytical and experimental results show the efficiency of the proposed structures. Moreover, we discuss how the indexing schemes can be extended to solve the more general range temporal and spatiotemporal aggregation problems. 1
|
1541
|
Computational Geometry: An Introduction
– Preparata, Shamos
- 1985
|
|
248
|
Online aggregation
– Hellerstein, Haas, et al.
- 1997
|
|
194
|
Geometric range searching and its relatives
– Agarwal, Erickson
- 1999
|
|
172
|
Clustering Data Streams
– Guha, Motwani, et al.
- 2000
|
|
161
|
Mining high-speed data streams
– Domingos, Hulten
- 2000
|
|
132
|
An asymptotically optimal multiversion B-tree
– Becker, Gschwind, et al.
- 1996
|
|
124
|
Computing on data streams
– Henzinger, Raghavan, et al.
- 1998
|
|
108
|
On computing correlated aggregates over continual data streams
– Gehrke, Korn, et al.
- 2001
|
|
93
|
Data-streams and histograms
– Guha, Koudas, et al.
|
|
90
|
Multidimensional divide-and-conquer
– Bentley
- 1980
|
|
56
|
Expiring Data in a Warehouse
– Garcia-Molina, Labio, et al.
- 1998
|
|
55
|
Incremental computation and maintenance of temporal aggregates
– Yang, Widom
- 2001
|
|
54
|
View maintenance issues for the chronicle data model
– Jagadish, Mumick, et al.
- 1995
|
|
52
|
Computing temporal aggregates
– Kline, Snodgrass
- 1995
|
|
50
|
Geometric range searching
– Matousek
- 1994
|
|
48
|
Progressive approximate aggregate queries with a multi-resolution tree structure
– Lazaridis, Mehrotra
- 2001
|
|
40
|
Efficient computation of temporal aggregates with range predicates
– Zhang, Markowetz, et al.
- 2001
|
|
35
|
A Glossary of Time Granularity Concepts
– Bettini, Dyreson, et al.
- 1998
|
|
30
|
Efficient aggregation over objects with extent
– Zhang, Tsotras, et al.
- 2002
|
|
27
|
Parallel algorithms for computing temporal aggregates
– Gendrano, Huang, et al.
- 1999
|
|
27
|
Indexing spatio-temporal data warehouses
– Papadias, Tao, et al.
- 2002
|
|
25
|
Processing temporal aggregates in parallel
– Ye, Keane
- 1997
|
|
24
|
Implementing Historical Aggregates in TempIS
– Tuma
- 1992
|
|
22
|
Scalable algorithms for large temporal aggregation
– Moon, Lopez, et al.
- 2000
|
|
17
|
Symbolic representation of user-defined time granularities
– Bettini, Sibi
- 1999
|
|
14
|
Temporal Semantic Assumptions and Their Use in databases
– Bettini
- 1998
|
|
10
|
Specification-based data reduction in dimensional data warehouses
– Skyt, Jensen, et al.
- 2001
|
|
7
|
Semantic compression of temporal data
– Bettini
- 2001
|
|
5
|
Symbolic Representation of User-De Time Granularities
– Bettini, Sibi
- 1999
|
