一种新的商覆盖立方体生成算法

New algorithm for computing cover quotient cube

提出一种的新的商覆盖立方体生成算法GroupDFS,将待计算的基本表先依据各维属性进行Group By运算,再对得到的结果集采用DFS算法计算其上界集,所得结果即为原待计算基本表的商覆盖立方体。GroupDFS算法结合了2N算法和DFS算法的优点,相对于DFS算法缩短了计算所需的时间。采用weather数据集进行的实验结果表明,采用GroupDFS计算商覆盖立方体所需时间仅为采用DFS算法时的45%。

This paper presents a new kind of algorithm（GroupDFS） for computing cover quotient cube,The algorithm first get a result set by grouping the original base table based on all dimension attributes, then generate the upper bound set of the result set,finally return the cover quotient cube of the original base table.GroupDFS integrates the advantages of 2^N-algorithm and DFS algorithm,it shortens the time needed to compute the cover quotient cube.Experimental results on the dataset weather show that the time needed for computing when GroupDFS-algorithm is adapted is only 45% of that when DFS algorithm is adapted.