[1]胡孔法,陈崚,李斌.高维层次聚集Cube并行创建与存储方法[J].东南大学学报(自然科学版),2006,36(1):47-51.[doi:10.3969/j.issn.1001-0505.2006.01.010]
 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.[doi:10.3969/j.issn.1001-0505.2006.01.010]
点击复制

高维层次聚集Cube并行创建与存储方法()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
36
期数:
2006年第1期
页码:
47-51
栏目:
计算机科学与工程
出版日期:
2006-01-20

文章信息/Info

Title:
Improved method of parallel construction and storage for high-dimensional hierarchy aggregate Cube
作者:
胡孔法 陈崚 李斌
扬州大学计算机科学与工程系, 扬州 225009
Author(s):
Hu Kongfa Chen Ling Li Bin
Department of Computer Science and Engineering, Yangzhou University, Yangzhou 225009, China
关键词:
高维层次聚集Cube 分段Mini-Cube 并行处理
Keywords:
high-dimensional hierarchy aggregate Cube segment Mini-Cube parallel process
分类号:
TP311
DOI:
10.3969/j.issn.1001-0505.2006.01.010
摘要:
提出一种将高维层次聚集Cube划分成若干个低维立方体Mini-Cube的并行创建与存储方法,利用并行处理技术来创建这些分割的分段共享Mini-Cube及其聚集Cuboids,实现高维层次聚集Cube的并行创建和增量更新维护,从而解决高维OLAP聚集海量数据的存储与查询问题.理论分析与实验结果都表明,相对于以往的Full Cube完全创建和Partial Cube部分创建等传统方法, 基于分段Mini-Cube并行处理方法的性能有显著的提高.
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.

参考文献/References:

[1] Chaudhuri U,Dayal U.Data warehousing and OLAP for decision support[J]. ACM SIGMOD Record,1997,26(2):507-508.
[2] Stockinger K.Bitmap indices for speeding up high-dimensional data analysis[C] // Proceedings of the 13th Int’l Conf on DEXA.Heidelberg:Springer,2002:881-890.
[3] Wu K,Koegler W,Chen J,et al.Using bitmap index for interactive exploration of large datasets[C] // Proceedings of the 15th International Conference on Scientific and Statistical Database Management.Los Alamitos:IEEE Computer Society Press,2003:65-74.
[4] Xin D,Han J,Li X,et al.Star-cubing:computing iceberg cubes by top-down and bottom-up integration[C] // The 29th Int’l Conf on VLDB.San Fransisco:Morgan Kaufmann Publishers,2003:476-487.
[5] Wang W,Lu H J,Feng J L,et al.Condensed Cube:an effective approach to reducing data cube size[C] // Proc of the 18th International Conference on Data Engineering.Los Alamitos:IEEE Computer Society Press,2002:155-165.
[6] Sismanis Y,Deligiannakis A,Roussopoulos N,et al.Dwarf:shrinking the Peta Cube[C] // Proc of the ACM SIGMOD International Conference on Management of Data.New York:ACM Press,2002:464-475.
[7] Sismanis Y,Deligiannakis A,Kotidis Y,et al.Hierarchical dwarfs for the rollup cube[C] //The 30th Int’l Conf on VLDB.San Fransisco:Morgan Kaufmann Publishers,2004:40-551.
[8] 胡孔法,董逸生,徐立臻,等.一种基于维层次编码的OLAP聚集查询算法[J].计算机研究与发展,2004,41(4):608-614.
  Hu Kongfa,Dong Yisheng,Xu Lizhen,et al.A novel aggregation algorithm for online analytical processing queries evaluation based on the dimension hierarchical encoding[J].Journal of Computer Research and Development,2004,41(4):608-614.(in Chinese)

备注/Memo

备注/Memo:
基金项目: 国家自然科学基金资助项目(60473012)、国家“十五”重大科技攻关资助项目(2003BA614A)、江苏省自然科学基金资助项目(BK2005047,BK2004052,BK2005046).
作者简介: 胡孔法(1970—),男,博士,副教授,硕士生导师,kfhu@yzu.edu.cn.
更新日期/Last Update: 2006-01-20