| 一种快速生成最小浓缩数据立方的算法 |
| |
| 引用本文： | 王琢,鲍玉斌.一种快速生成最小浓缩数据立方的算法[J].小型微型计算机系统,2005,26(12):2212-2215. |
| |
| 作者姓名： | 王琢 鲍玉斌 |
| |
| 作者单位： | 1. 沈阳理工大学,信息科学与工程学院,辽宁,沈阳,110168;东北大学,信息科学与工程学院,辽宁,沈阳,110004
2. 东北大学,信息科学与工程学院,辽宁,沈阳,110004 |
| |
| 基金项目： | 国家自然科学基金项目（60173051）资助. |
| |
| 摘 要： | 语义OLAP技术是近来学者研究的热点之一,浓缩数据立方就是其中一种.本文设计了一个用于快速生成最小浓缩数据立方的算法SQCube.算法分两个阶段：首先利用BottomUpBST算法生成一个非最小的浓缩数据立方,然后对所得到的非最小浓缩数据立方进行后处理,把其中的所有纯BST和隐BST压缩为一条BST,从而生成一个最小浓缩数据立方.实验表明SQCube算法明显优于以往提出的同类算法MinCube.
|
| 关 键 词： | OLAP 数据立方 浓缩数据立方 基本单一元组 |
| 文章编号： | 1000-1220（2005）12-2212-04 |
| 收稿时间： | 2004-07-12 |
| 修稿时间： | 2004-07-12 |
Fast Algorithm for Computing the Minimal Condensed Cube |
| |
| WANG Zhuo,BAO Yu-bin.Fast Algorithm for Computing the Minimal Condensed Cube[J].Mini-micro Systems,2005,26(12):2212-2215. |
| |
| Authors: | WANG Zhuo BAO Yu-bin |
| |
| Abstract: | The semantic OLAP has been widely studied by many researchers recently. This paper designed a fast algorithm, namely SQCube, to compute the minimal condensed cube quickly. The algorithm takes two phases. It first employs the BottomUpBST algorithm to generate a non-minimal condensed cube, and then post-processes it by squeezing all the pure BSTs and hidden BSTs into one BST to generate a minimal condensed cube. Experiments show that SQCube can significantly outperform the MinCube algorithm, which is used for the same purpose. |
| |
| Keywords: | OLAP data cube condensed cube base single tuple |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
