大型压缩数据仓库上的Iceberg Cube算法  

An Iceberg Cube Algorithm for Large Compressed Data Warehouses

作　　者：骆吉洲[1] 李建中[1] 赵锴[1] 

机构地区：[1]哈尔滨工业大学计算机科学与技术学院,黑龙江哈尔滨150001

出　　处：《软件学报》2006年第8期1743-1752,共10页Journal of Software

基　　金：国家自然科学基金;国家高技术研究发展计划(863);国家重点基础研究发展规划(973);黑龙江省自然科学基金~~

摘　　要：IcebergCube操作是OLAP(on-lineanalysisprocessing)分析中的一种重要操作.数据压缩技术在有效减小数据仓库所需的数据空间和提高数据处理性能方面的作用越来越明显.在压缩的数据仓库上,如何快速、有效地计算IcebergCube是目前亟待解决的问题.简要介绍了数据仓库的压缩,然后给出了在压缩数据仓库中计算IcebergCube的算法.实验结果表明,该算法的性能优于先在压缩数据上计算Cube再检查having条件这种方法.Iceberg Cube is meaningful for OLAP （on-line analysis processing） and compression techniques play more and more important role in reducing the storage of data warehouse and improving the efficiency of data operations. It is really a problem to compute Iceberg Cube efficiently in the compressed data warehouse. The compression techniques of data warehouse are introduced concisely in this paper, and an algorithm to compute Iceberg Cube in compressed data warehouse by mapping-complete methods is proposed. Experimental results show that this algorithm outperforms the direct method that selects Iceberg Cube tuples from the complete computed cube.

关 键 词：ICEBERG CUBE 压缩数据仓库 数据立方体 自底向上计算 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]