超大型压缩数据仓库上的CUBE算法  

CUBE algorithms on very large compressed data warehouses

作　　者：高宏[1] 李建中[1] 

机构地区：[1]黑龙江大学计算机科学系,黑龙江哈尔滨150080

出　　处：《黑龙江大学自然科学学报》1999年第4期51-59,共9页Journal of Natural Science of Heilongjiang University

基　　金：国家自然科学基金!9846一004;国家863计划基金!69873014-511l-9846一004

摘　　要：数据压缩是提高多维数据仓库性能的重要途径。压缩数据仓库上的数据操作算法是提高ＭＯＬＡＰ应用效率的关键。但是至今尚未见到有关这方面的研究成果。提出了两种压缩数据仓库上ＣＵＢＥ操作算法。这些算法适用于一大类数据压缩方法。这些算法已经用于我们正在研制的多维数据仓库系统。实践证明，这些算法的效率远高于目前存在的ＣＵＢＥ算法。Data compression is an effective method to enhance the performanceof data warehouse. Developing data operation algorithms directly on compressed datawarehouses is a big challenge. Two CUBE algorithms on compressed data warehouses are proposed in this paper. These algorithms are suitable for a class of datacompression methods and are being used in a data warehouse system which is developing by the authors. It has been shown in practice that the proposed algorithms havehigher performance than other existing CUBE algorithms.

关 键 词：数据仓库 联机分析处理 CUBE操作 数据压缩 

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