Incremental Computation and Maintenance of Temporal Aggregates

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.

Available Versions of this Item

• Incremental Computation and Maintenance of Temporal Aggregates. (deposited 25 Feb 2000 16:00) [Currently Displayed]
  • Incremental Computation and Maintenance of Temporal Aggregates (Journal version). (deposited 24 Apr 2002 17:00)