DSD: Maintain Data Cubes More Efficiently

Issue title: The 9th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Conputing (RSFDGrC 2003)

Article type: Research Article

Authors: Li, Hongsong | Huang, Houkuan | Lin, Youfang

Affiliations: Dept. of Computer Sci. and Tech., Northern Jiaotong University, Beijing, China, 100044

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, DSD, developed from Mumick's algorithm. Instead of using one auxiliary delta table, we use two tables 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 DSD algorithm and found that its performance shows a significant improvement.

Keywords: data warehousing, data cube, incremental maintenance

Journal: Fundamenta Informaticae, vol. 59, no. 2-3, pp. 173-190, 2004