DSpace Repository

A Comparative Analysis of Traditional and Modern Data Compression Schemes for Large Multi-Dimensional Extendible Array

Show simple item record

dc.contributor.author Rahmani, Md. Mushfiqur
dc.contributor.author Mahmud, A. Al-
dc.contributor.author Sohan, Md. Fahimuzzman
dc.date.accessioned 2022-01-18T07:05:12Z
dc.date.available 2022-01-18T07:05:12Z
dc.date.issued 2020
dc.identifier.uri http://dspace.daffodilvarsity.edu.bd:8080/handle/123456789/6779
dc.description.abstract Data analysis and mining in scientific domains involve storage of large-scale multi-dimensional datasets for scientific, statistical & engineering applications in multidimensional online analytical processing (MOLAP) databases. Because of the size of the datasets is increasing and the degree of data-sparsity is being high, it is important to find the suitable and efficient compression scheme for storing data at a minimal scheme. This paper represents a comparative analysis of Traditional and Modern Data Compression Schemes for Multi-Dimensional data ranging from dimension 1 to 3. The main idea is to compare the space savings of four different & significant compressions schemes i.e. Bit Map, Header Compression, Compressed Row Storage (CRS) & Extendible Array Based Compression Scheme (EaCRS). The results from experiments show that EaCRS scheme is better than the other schemes in case of space complexity especially for higher data density. en_US
dc.language.iso en_US en_US
dc.publisher Scopus en_US
dc.subject multi-dimensional en_US
dc.subject Compressed Row Storage en_US
dc.subject Extendible Array Based Compression Scheme en_US
dc.title A Comparative Analysis of Traditional and Modern Data Compression Schemes for Large Multi-Dimensional Extendible Array en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Browse

My Account