Dynamic Decompression for Text Files

Compression algorithms reduce the redundancy in data representation to decrease the storage required for that data. Lossless compression researchers have developed highly sophisticated approaches, such as Huffman encoding, arithmetic encoding, the Lempel-Ziv (LZ) family, Dynamic Markov Compression (DMC), Prediction by Partial Matching (PPM), and Burrows-Wheeler Transform (BWT) based algorithms. Decompression is also required to retrieve the original data by lossless means. A compression scheme for text files coupled with the principle of dynamic decompression, which decompresses only the section of the compressed text file required by the user instead of decompressing the entire text file. Dynamic decompressed files offer better disk space utilization due to higher compression ratios compared to most of the currently available text file formats.

Authors:

• Ananth Kamath
• Ankit Kant
• Aravind Srivatsa
• Harisha J.A

Keywords:

• Compression
• Dynamic Decompression
• Text file format
• Portable Document Format
• Compression Ratio.

References:

[1] Md. Ziaul Karim Zia, Dewan Md. Fayzur Rahman, and Chowdhury
Mofizur Rahman. "Two-Level Dictionary-Based Text Compression
Scheme". Proceedings of 11th International Conference on Computer
and Information Technology.
[2] Behrouz A. Forouzan and Richard F. Gilberg, Computer Science A
Structured Programming Approach Using C, Thomson, 2003
[3] Data Structures using C, Aaron M. Tenenbaum, Yedidyah Langsam
and Moshe J. Augenstein, Pearson Education, 2006
[4] Michael J. Folk, Bill Zoellick, Greg Ricardi. File Structures-An Object
Oriented Approach with C++, Addison-Wesley, 1998
[5] B.S. Shajeemohan and V.K.Govindan, Intelligent Compression
Scheme For Faster And Secure Transmission Of Text And Image Data
Over Internet, International Conference on Human Machine Interface
ICHMI 2004
[6] Marc L. Corliss , E. Christopher Lewis , Amir Roth, The
implementation and evaluation of dynamic code decompression using
DISE, ACM Transactions on Embedded Computing Systems (TECS),
v.4 n.1, p.38-72, February 2005.
[7] R. Franceschini, H. Kruse, N. Zhang, R. Iqbal, and A. Mukherjee,
"Lossless, Reversible Transformations that Improve Text Compression
Ratio," Project paper, University of Central Florida, USA. 2000.
[8] U. Manber, "A Text compression scheme that allows fast searching
directly in compressed file," ACM Transactions on Information
Systems, Vol.52, N0.1, pp.124-136, 1997.
[9] "A Scheme That Facilitates Searching And Partial Decompression Of
Textual Documents. Ashutosh Gupta . Intl. Journal of Advanced
Computer Engineering, Volume 1, No 2, pages 99 -109, 2008.
[10] F. Awan, N. Zhang, N. Motgi, R. Iqbal, and A. Mukherjee, "LIPT: A
Reversible Lossless Text Transform to Improve Compression
Performance," Proceedings IEEE Data Compression Conference, pp.
481-210, 2001.
[11] D. A. Huffman, "A method for the construction of minimum
redundancy codes," In Proc. IRE 40, volume 10, pages 1098-1101,
September 1952.
[12] Terry A. Welch, "A Technique for High Performance Data
Compression," IEEE Computer, Vol. 17, pp. 8-19, June 1984.