Incremental aggregation on MOLAP cube based on n-dimensional extendible karnaugh arrays

Data is increasing so rapidly that new data warehousing approaches are required to process and analyze data. Aggregation of data incrementally is needed to fast access of data and compute aggregation functions. Multidimensional arrays are generally used for this purpose. But some disadvantages such as address space requirement is large and processing time is comparatively slow in case of aggregation. For this purpose we use Extendible Karnaugh Array (EKA). EKA is an efficient scheme which has better performance than other data structures that we have tested in our research. In this research work we use EKA as basic structure for implementing incremental aggregation of data and evaluate its performance over other approaches. We use Multidimensional Online Analytical Processing (MOLAP) which stores data in optimized multi-dimensional array storage, rather than in a relational database. We create 4 and 6 dimensional MOLAP data cube using Traditional Multidimensional Array (TMA) and EKA scheme and compare incremental aggregation with Relational Online Analytical Processing (ROLAP). The effective outcome of EKA structure for incremental aggregation on 4 and 6 dimensional MOLAP structure is shown by some experimental results and efficiency is proved for n higher dimensions.

[1]  Tatsuo Tsuji,et al.  An Efficient Implementation for MOLAP Basic Data Structure and Its Evaluation , 2007, DASFAA.

[2]  Jaime G. Carbonell,et al.  Incremental Aggregation on Multiple Continuous Queries , 2006, ISMIS.

[3]  Marianne Winslett,et al.  Physical schemas for large multidimensional arrays in scientific computing applications , 1994, Seventh International Working Conference on Scientific and Statistical Database Management.

[4]  Chun-Yuan Lin,et al.  Efficient Representation Scheme for Multidimensional Array Operations , 2002, IEEE Trans. Computers.

[5]  K. M. Azharul Hasan,et al.  An Implementation Scheme for Multidimensional Extendable Array Operations and Its Evaluation , 2011 .

[6]  Michael Stonebraker,et al.  Efficient organization of large multidimensional arrays , 1994, Proceedings of 1994 IEEE 10th International Conference on Data Engineering.

[7]  Jeffrey F. Naughton,et al.  An array-based algorithm for simultaneous multidimensional aggregates , 1997, SIGMOD '97.

[8]  Tatsuo Tsuji,et al.  An extendible data structure for handling large multidimensional data sets , 2009, 2009 12th International Conference on Computers and Information Technology.

[9]  Chun-Yuan Lin,et al.  Efficient Data Parallel Algorithms for Multidimensional Array Operations Based on the EKMR Scheme for Distributed Memory Multicomputers , 2003, IEEE Trans. Parallel Distributed Syst..

[10]  K. M. Azharul Hasan,et al.  An Efficient Encoding Scheme to Handle the Address Space Overflow for Large Multidimensional Arrays , 2013, J. Comput..