A Dwarf-based Fast and Efficient Incremental Update Algorithm
一种基于Dwarf的快速有效增量更新算法

Data cube computation is a well-known expensive operation and has been studied extensively. It is often not feasible to compute a complete data cube due to the huge storage requirement. Recently proposed Dwarf cube com- pressed the complete data cube into a dramatically condensed data structure through the elimination of prefix and suffix redundancy. However, as changes are made to the data sources, to update such a Dwarf cube in time is non-trivial, In this paper, we propose a new Dwarf-based optimized update algorithm on the basis of studying the characters of sum- marized node, which can materialize all of data cubes fully and requires no recalculation. The algorithm improves the updating performance of the data cube obviously. Furthermore, the effectiveness and efficiency of this algorithm have been shown by experimental results, especially for the high dimension data warehouses.