An improved storage algorithm for multidimensional data cube

Haitao He*, Yanpeng Zhang, Jiadong Ren, Lining Li, Changzhen Hu

*此作品的通讯作者

科研成果: 书/报告/会议事项章节会议稿件同行评审

2 引用 (Scopus)

摘要

There are 2n views in a n-dimensional data cube, the more the number of views, the more the maintenance time of data cube will be. According to the hierarchical feature of dimension in data cube, An Improved Storage Algorithm For Multidimensional Data Cube (ISMDC) is proposed in this paper. Dimensions are divided into association dimensions and no-association dimensions. The conception of Association Tree Cube is brought forward. On the no-association dimension, hierarchical B+ tree is used to remove redundancy and to form dimension hierarchical encoding. On the association dimension, encoding of the no-association dimension which is composed of dimension hierarchical encodings, is used for indexing. Thus, the value of aggregation will be searched out effectively. The experimental results show that ISMDC has reduced the storage requirement, maintenance time and improved the efficiency of data cube pattern update and the OLAP queries.

源语言英语
主期刊名2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009
841-844
页数4
DOI
出版状态已出版 - 2009
活动2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009 - Kaohsiung, 中国台湾
期限: 7 12月 20099 12月 2009

出版系列

姓名2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009

会议

会议2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009
国家/地区中国台湾
Kaohsiung
时期7/12/099/12/09

指纹

探究 'An improved storage algorithm for multidimensional data cube' 的科研主题。它们共同构成独一无二的指纹。

引用此