Stanford InfoLab Publication Server

Incremental Computation and Maintenance of Temporal Aggregates

Yang, J. and Widom, J. (2000) Incremental Computation and Maintenance of Temporal Aggregates. Technical Report. Stanford.

WarningThere is a more recent version of this item available.



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.

Item Type:Techreport (Technical Report)
Uncontrolled Keywords:temporal databases, indexes, view maintenance
Subjects:Computer Science > Data Warehousing
Related URLs:Project Homepage
ID Code:482
Deposited By:Import Account
Deposited On:25 Feb 2000 16:00
Last Modified:27 Dec 2008 15:59

Available Versions of this Item

Download statistics

Repository Staff Only: item control page