| CBFrag-Cubing：一种基于压缩位图的高维数据立方创建算法 |
| |
| 引用本文： | 刘运涛,鲍玉斌,吴丹,冷芳玲,孙焕良,于戈. CBFrag-Cubing：一种基于压缩位图的高维数据立方创建算法[J]. 计算机科学, 2005, 32(11): 91-93 |
| |
| 作者姓名： | 刘运涛 鲍玉斌 吴丹 冷芳玲 孙焕良 于戈 |
| |
| 作者单位： | 东北大学信息科学与工程学院,沈阳,110004 |
| |
| 基金项目： | 本课题得到国家自然科学基金（编号：60173051）,国家863高技术计划CIMS主题（编号：2003AA414210）,教育部优秀青年教师科研教育奖励计划资助. |
| |
| 摘 要： | 数据立方的计算是数据仓库和OLAP研究的一个重要方向，同时又是数据仓库中代价很大的操作。针对在生物信息、统计分析、文本处理等领域中存在的基数较小的高维数据集，X.L.Li等人提出了Frag-Cubing算法。为了提高Frag-Cubing算法的效率，本文提出了基于分片思想的算法CBFrag-Cubing。该算法使用了位图索引结构，优化了数据立方的存储，减少了数据立方的计算时间。实验表明，与Frag-Cubing算法相比，该算法在存储空间上至少节省25％，在计算时间上节省30％。
|
| 关 键 词： | 数据立方计算 OLAP Frag-Cubing 压缩位图 数据立方 算法 高维 位图 压缩 计算时间 |
CBFrag-Cubing:An Algorithm of High-Dimensional Data Cubing Based on Compressed Bitmap |
| |
| LIU Yun-Tao,BAO Yu-Bin,WU Dan,LENG Fang-Ling,SUN Huan-Liang,YU Ge. CBFrag-Cubing:An Algorithm of High-Dimensional Data Cubing Based on Compressed Bitmap[J]. Computer Science, 2005, 32(11): 91-93 |
| |
| Authors: | LIU Yun-Tao BAO Yu-Bin WU Dan LENG Fang-Ling SUN Huan-Liang YU Ge |
| |
| Affiliation: | School of Information Science and Engineering, Northeastern University,Shenyang 110004 |
| |
| 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. |
| |
| Keywords: | Data cube computation OLAP Frag-Cubing Compressed bitmap |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机科学》浏览原始摘要信息 |
|
点击此处可从《计算机科学》下载全文 |
|
