节点文献
CBFrag-Cubing:一种基于压缩位图的高维数据立方创建算法(英文)
CBFrag-Cubing:An Algorithm of High-Dimensional Data Cubing Based on Compressed Bitmap
【作者】 刘运涛; 鲍玉斌; 吴丹; 冷芳玲; 孙焕良; 于戈;
【机构】 东北大学信息科学与工程学院;
【摘要】 <正>The computation of data cube is one of the most essential but expensive issues in data warehouse and OLAP.Frag-Cubing algorithm is recently proposed to perform data cubing on such data sets,which exist in applications like bioinformatics,statistics,and text processing that characterized by high dimensionality and low cardinality. In order to enhance efficiency of Frag-Cubing algorithm,a partition-based CBFrag-Cubing algorithm is proposed. It uses Compressed bitmap index to optimize the storage of cube,and reduces the computing time.Experimental results show that,compared with Frag-Cubing algorithm,the CBFrag-Cubing algorithm saves at least 25% on storage space and about 30%on computing time.
【Abstract】 The computation of data cube is one of the most essential but expensive issues in data warehouse and OLAP.Frag-Cubing algorithm is recently proposed to perform data cubing on such data sets,which exist in applications like bioinformatics,statistics,and text processing that characterized by high dimensionality and low cardinality. In order to enhance efficiency of Frag-Cubing algorithm,a partition-based CBFrag-Cubing algorithm is proposed. It uses Compressed bitmap index to optimize the storage of cube,and reduces the computing time.Experimental results show that,compared with Frag-Cubing algorithm,the CBFrag-Cubing algorithm saves at least 25% on storage space and about 30%on computing time.
- 【会议录名称】 第二十二届中国数据库学术会议论文集(研究报告篇)
- 【会议名称】第二十二届中国数据库学术会议
- 【会议时间】2005-08-19
- 【会议地点】中国内蒙古呼和浩特
- 【分类号】TP311.13
- 【主办单位】中国计算机学会数据库专业委员会