A new incremental maintenance algorithm of data cube

Authors:
Hongsong Li;Houkuan Huang;Youfang Lin
Affiliations:
Dept. of Computer Sci. and Tech., Northern Jiaotong University, Beijing, China;Dept. of Computer Sci. and Tech., Northern Jiaotong University, Beijing, China;Dept. of Computer Sci. and Tech., Northern Jiaotong University, Beijing, China
Venue:
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Year:
2003

Citing 5
Cited 0

Algorithms for deferred view maintenance

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Maintenance of data cubes and summary tables in a warehouse

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Incremental Computation and Maintenance of Temporal Aggregates

Proceedings of the 17th International Conference on Data Engineering
On the Computation of Multidimensional Aggregates

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

A well-known challenge in data warehousing is the efficient incremental maintenance of data cube in the presence of source data updates. In this paper, we present a new incremental maintenance algorithm developed from Mumick's algorithm. Instead of using one auxiliary delta table, We use two to improve efficiency of data update. Moreover, when a materialized view has to be recomputed, we use its smallest ancestral view's data , while Mumick uses the fact table which is usually much lager than its smallest ancestor. We have implemented this algorithm and found the performance has a significant improvement.