| 高维层次聚集Cube并行创建与存储方法 |
| |
| 引用本文： | 胡孔法,陈崚,李斌.高维层次聚集Cube并行创建与存储方法[J].东南大学学报(自然科学版),2006,36(1):47-51. |
| |
| 作者姓名： | 胡孔法 陈崚 李斌 |
| |
| 作者单位： | 扬州大学计算机科学与工程系,扬州,225009 |
| |
| 基金项目： | 中国科学院资助项目，国家科技攻关项目，江苏省自然科学基金 |
| |
| 摘 要： | 提出一种将高维层次聚集Cube划分成若干个低维立方体M ini-Cube的并行创建与存储方法,利用并行处理技术来创建这些分割的分段共享M ini-Cube及其聚集Cuboids,实现高维层次聚集Cube的并行创建和增量更新维护,从而解决高维OLAP聚集海量数据的存储与查询问题.理论分析与实验结果都表明,相对于以往的Full Cube完全创建和Partial Cube部分创建等传统方法,基于分段M ini-Cube并行处理方法的性能有显著的提高.
|
| 关 键 词： | 高维层次聚集Cube 分段Mini-Cube 并行处理 |
| 文章编号： | 1001-0505（2006）01-0047-05 |
| 收稿时间： | 05 26 2005 12:00AM |
| 修稿时间： | 2005-05-26 |
Improved method of parallel construction and storage for high-dimensional hierarchy aggregate Cube |
| |
| Hu Kongfa,Chen Ling,Li Bin.Improved method of parallel construction and storage for high-dimensional hierarchy aggregate Cube[J].Journal of Southeast University(Natural Science Edition),2006,36(1):47-51. |
| |
| Authors: | Hu Kongfa Chen Ling Li Bin |
| |
| Institution: | Department of Computer Science and Engineering, Yangzhou University, Yangzhou 225009, China |
| |
| Abstract: | A novel approach to partition the high-dimensional hierarchy aggregate Cube into some low-dimensional shell segment Mini-Cubes is proposed.OLAP(online analysis process) queries are computed online by dynamically constructing cuboids from these shell segment Mini-Cubes through the parallel processing technology.With this design, for high-dimensional OLAP,the total space that needs to store such shell segment Mini-Cubes is negligible in comparison with a high-dimensional hierarchy cube.Comparison between the methods of shell Mini-Cube and other existed ones such as full cube and partial cube was conducted experimentally.The analytical and experimental results show that the algorithms of segment Mini-Cubes proposed in this paper are more efficient than the other existed ones. |
| |
| Keywords: | high-dimensional hierarchy aggregate Cube segment Mini-Cube parallel process |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
