An efficient chunk based record encoding scheme for higher dimensional arrays

The structure of Multidimensional Array has been practiced in “Big Data” applications tremendously as it stores expediently and retrieves rapidly. However, performance issue of these applications also requires preservation of statistical properties while reducing data size at the same time. The data compression accomplishes this task by wrapping as many logical data as possible in terms of physical size reducing storage loss. The key demonstration of this paper is to devise an efficient data compression technique for a Multidimensional Extendible Array called Chunked Extendible Array. The proposed scheme compresses each of the chunks in a subarray of the extendible array simply having the information related to a particular extension history. The projected scheme decreases the storage cost of the underlying uncompressed sparse Chunked Extendible array.

[1]  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.

[2]  Mehnuma Tabassum Omar,et al.  Chunking implementation of extendible array to handle address space overflow for large multidimensional data sets , 2014, 2013 International Conference on Electrical Information and Communication Technology (EICT).

[3]  Tatsuo Tsuji,et al.  History-Offset Implementation Scheme of XML Documents and Its Evaluations , 2013, DASFAA.

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

[5]  K. M. Azharul Hasan Compression Schemes of High Dimensional Data for MOLAP , 2010 .

[6]  Tatsuo Tsuji,et al.  A Parallel Implementation Scheme of Relational Tables Based on Multidimensional Extendible Array , 2006, Int. J. Data Warehous. Min..

[7]  T. H. Merrett,et al.  A storage scheme for extendible arrays , 2005, Computing.

[8]  Tatsuo Tsuji,et al.  EaCRS: an extendible array based compression scheme for high dimensional data , 2011, SoICT '11.

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

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

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

[12]  J. Leon Zhao,et al.  Extendible arrays for statistical databases and OLAP applications , 1996, Proceedings of 8th International Conference on Scientific and Statistical Data Base Management.

[13]  Richard Barrett,et al.  Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods , 1994, Other Titles in Applied Mathematics.

[14]  Doron Rotem,et al.  Optimal chunking of large multidimensional arrays for data warehousing , 2007, DOLAP '07.

[15]  Tatsuo Tsuji,et al.  An Extendible Array Based Implementation of Relational Tables for Multi Dimensional Databases , 2005, DaWaK.

[16]  Ekow J. Otoo,et al.  Chunked Extendible Dense Arrays for Scientific Data Storage , 2012, 2012 41st International Conference on Parallel Processing Workshops.