摘要： 现有压缩数据集上的Cube计算方法只适用于稀疏数据，针对该问题，设计一种用于压缩常量和基本单一元组的压缩方法并提出一种新的Cube算法。该算法在计算过程中无需解压缩、计算速度快、数据压缩率高，适用于冰山计算。实验结果表明，与自底向上立方体算法相比，新算法计算速度快、所需存储空间小。

关键词: 数据仓库, 数据立方体, 数据压缩

Abstract: Existing Cube computation method on compressed data sets only suits for sparsity data. Aiming at this problem, this paper designs a compression method for constant and Basic Single Tuple(BST), and proposes a new algorithm which has following characteristics: direct computing without decompression, high speed of computation, well compressed ratio, suiting for iceberg computation. Experimental results show that compared with Bottom Up Cube(BUC) algorithm, the new algorithm has obvious advantage in both computation speed and storage space.

Key words: data warehouse, data Cube, data compression

中图分类号: 

• TP311.12