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.