摘要： 提出一种新的浓缩商覆盖立方体的数据立方体压缩技术，在商覆盖立方体中省略了部分只依据基本表即可快速应答查询的基本单元组，从而缩小其体积。给出浓缩商覆盖立方体的生成算法和查询算法。实验结果表明，浓缩商覆盖立方体的元组数量仅为原商覆盖立方体的62%，验证了浓缩商覆盖立方体技术的有效性。

关键词: 数据立方体压缩, 联机分析处理, 浓缩立方体, 商覆盖立方体

Abstract: This paper brings forward a new data compression technology: condensed cover quotient cube, this technology shrinks the volume of quotient cover cube by omitting contained base single tuples. Algorithms for generating and quering of condensed quotient cover are provided. Experimental result shows that the count of records in condensed quotient cover cube is only 62% of the original quotient cover cube, which validates the efficiency of this technology.

Key words: data cube compression, On-Line Analytical Processing(OLAP), condensed cube, quotient cover cube

中图分类号: 

• TP311