基于混合存储结构的数据立方体生成算法

AN ALGORITHM FOR DATA CUBE COMPUTATION BASED ON HYBRID DATA STRUCTURE

通过把数据立方体中的维分为划分维和非划分维,视图中的数据被分成两部分,分别存储在关系和多维数组中。针对这种混合存储结构,我们设计了一个数据立方体生成算法,它结合了流水线聚集方法和多维数组聚集方法的优点,大大减少了流水线的条数和所需要的存储空间,加快了计算速度。并用一个实际数据集进行了实验,结果表明该算法适用干计算高维的数据立方体。

By dividing dimensions of data cube into partition dimensions and non-partition dimensions ,data in views can be organized into two parts,one is stored in a relation and the other is stored in a multi-dimension array. For this hybrid data structure ,we design an algorithm to produce a data cube. It adopts the merits of pipeline aggregation method and array aggregation method. It reduces the amount of pipelines and storage space dramatically and accelerates the computation of data cube. We conduct some experiments using a real data set. The results of experiments show that the algorithm is suit to compute data cube with high dimensions.