[ Pagewise preview ]
| Category | Value | ||
| Available via | http://dbpubs.stanford.edu/pub/2000-6 | ||
| Next version(s) | 2002-23 | ||
| Submitted on | 26th of February 2000 | ||
| Author | Yang, J.; Widom, J. | ||
| Title | Incremental Computation and Maintenance of Temporal Aggregates | ||
| Date of publication | 2000 | ||
| Citation | J. Yang, J. Widom: Incremental Computation and Maintenance of Temporal Aggregates. Technical Report, 2000 | ||
| Language | English | ||
| Project | WHIPS | ||
| Type | Technical Report | ||
| Subject group | Data Warehousing | ||
| Abstract | We consider the problems of computing aggregation queries in temporal databases, and of maintaining materialized temporal aggregate views efciently . The latter problem is particularly challenging since a single data update can cause aggregate results to change over the entire time line. W e introduce a new index structure called the SB-tree, which incorporates features from both segment-trees and B-trees. SB-trees support fast lookup of aggregate results based on time, and can be maintained efciently when the data changes. W e extend the basic SB-tree index to handle cumulative (also called moving-window) aggregates, considering separately cases when the window size is or is not xed in advance. For materialized aggregate views in a temporal database or warehouse, we propose building and maintaining SB-tree indices instead of the views themselves. | ||
| Keywords | temporal databases, indexes, view maintenance | ||
| Fulltext source |
| Management of the document by | siroker@db.stanford.edu
| |
[ Pagewise preview ]