Yang, Jun and Widom, Jennifer (2002) Incremental Computation and Maintenance of Temporal Aggregates (Journal version). Technical Report. Stanford InfoLab. (Publication Note: VLDB Journal)
This is the latest version of this item.
We consider the problems of computing aggregation queries in temporal databases, and of maintaining materialized temporal aggregate views efficiently. The latter problem is particularly challenging since a single data update can cause aggregate results to change over the entire time line. We introduce a new index structure called the SB-tree, which incorporates features from both segment-trees and B-trees. SBtrees support fast lookup of aggregate results based on time, and can be maintained efficiently when the data changes.We 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 fixed 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)|
|Related URLs:||Project Homepage||http://infolab.stanford.edu/warehousing/warehouse.html|
|Deposited By:||Import Account|
|Deposited On:||24 Apr 2002 17:00|
|Last Modified:||25 Dec 2008 10:30|
Available Versions of this Item
- Incremental Computation and Maintenance of Temporal Aggregates. (deposited 25 Feb 2000 16:00)
- Incremental Computation and Maintenance of Temporal Aggregates (Journal version). (deposited 24 Apr 2002 17:00) [Currently Displayed]
Repository Staff Only: item control page