Title :
An Improved Storage Algorithm for Multidimensional Data Cube
Author :
He, Haitao ; Zhang, Yanpeng ; Li, Lining ; Ren, Jiadong ; Hu, Changzhen
Author_Institution :
Coll. of Inf. Sci. & Eng., Yanshan Univ., Qinhuangdao, China
Abstract :
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.
Keywords :
data mining; encoding; information storage; query processing; tree data structures; OLAP queries; association dimensions; association tree cube; data warehouse; dimension hierarchical encoding; hierarchical B tree; indexing; multidimensional data cube pattern; no-association dimensions; redundancy; storage algorithm; Computer science; Data engineering; Educational institutions; Encoding; Helium; Indexing; Information science; Marketing and sales; Multidimensional systems; Time sharing computer systems;
Conference_Titel :
Innovative Computing, Information and Control (ICICIC), 2009 Fourth International Conference on
Conference_Location :
Kaohsiung
Print_ISBN :
978-1-4244-5543-0
DOI :
10.1109/ICICIC.2009.90
