A comparative study of lossless data compression algorithms

Abstract

Data Compression is the method for minimizing the resources allocated by reducing size of the files. Data Compression is widely required in the era of information communication technology as it is useful for processing, storing and transferring data that requires lots of resources. There are lots of data compression algorithms which are available to compress files of different format. This dissertation is basically concerned with lossless data compression algorithms namely gzip and bzip2 and performance of these algorithms is analyzed and compared. The performance parameters are comparison ratio, comparison speed, saving percentage, decompression speed. For more reliability text data of different file format is considered for study. With the help of performance parameters, this dissertation is concluded by stating which algorithm performs well for text data.