A Closed Frag-Shells Cubing Algorithm on High Dimensional and Non-Hierarchical Data Sets

In view of high-dimensional and non-hierarchical large data sets, an improved CFSC (Closed Frag-Shells Cube) method is proposed based on the Frag-Shells method in this paper. When the Data Cube is generated, the high-dimensional data is divided into several low-dimensional data fragments by using the idea of partitioning cubes into dimension attributes. For each dimension data segment, the closed cubes of each dimension data segment are calculated using the closed cube calculation. A query bitmap is added to each fragment, and a query index table of closed segments is constructed by using bit map index technology to reduce the storage space occupied by the result set and to increase the query efficiency. Based on the application of multidimensional analysis of water conservancy census data, it is proved that this method can effectively reduce the storage space of cube data of water conservancy census data and improve the efficiency of OLAP (online analytical processing) query.

[1]  Hamid Pirahesh,et al.  Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals , 1996, Data Mining and Knowledge Discovery.

[2]  RamakrishnanRaghu,et al.  Bottom-up computation of sparse and Iceberg CUBE , 1999 .

[3]  Yannis Sismanis,et al.  Dwarf: shrinking the PetaCube , 2002, SIGMOD '02.

[4]  Jeffrey F. Naughton,et al.  On the Computation of Multidimensional Aggregates , 1996, VLDB.

[5]  Yannis E. Ioannidis,et al.  Bitmap index design and evaluation , 1998, SIGMOD '98.

[6]  Zhu Ka.  Computation of Data Dube in Analysis of Water Census Results , 2014 .

[7]  Mario A. Nascimento,et al.  Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 , 2004 .

[8]  Raghu Ramakrishnan,et al.  Bottom-up computation of sparse and Iceberg CUBE , 1999, SIGMOD '99.

[9]  Jiawei Han,et al.  High-Dimensional OLAP: A Minimal Cubing Approach , 2004, VLDB.

[10]  Jianguo Yao,et al.  Frag-shells cube based on hierarchical dimension encoding tree , 2017, IMCOM.

[11]  Hongjun Lu,et al.  Condensed cube: an effective approach to reducing data cube size , 2002, Proceedings 18th International Conference on Data Engineering.

[12]  Ye Xu,et al.  Minimal Condensed Cube: Data Organization, Fast Computation, and Incremental Update , 2008, 2008 International Conference on Internet Computing in Science and Engineering.

[13]  Jianqing Xi,et al.  CCBitmaps: A Space-Time Efficient Index Structure for OLAP , 2009, ADMA.

[14]  Arie Shoshani,et al.  Breaking the Curse of Cardinality on Bitmap Indexes , 2008, SSDBM.

[15]  Hongyan Liu,et al.  C-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[16]  Patrick Valduriez,et al.  Join indices , 1987, TODS.