Compression helps in reducing the redundancy in the data representation so as to reduce the storage requirement of it. Compression is an important technique used to improve web retrieval latency Compression is an important technique used to improve web retrieval latency. Plethora of algorithms is available for compressing the data. Some of the algorithms helps in achieving lossless compression and some are good at lossy compression. The objective of this study is to analyze the amount of compression that can be achieved by the use of existing Huffman Coding on web pages and to suggest further improvement that can be done to compress web pages so as to achieve better compression ratio and compression efficiency. The proposed technique may works even better with large files. How d o u know . This paper also outlines the comparison of various compression methods using different parameters.

1. Ahmed Desoky and Mark Gregory, Compression of text and binary files using Adaptive Huffman Coding Techniques.In Proceedings of IEEE conference, Aug, 2002, U.S.A.
2. D.A. Huffman 1952,A method for the construction of minimum redundancy codes, IRE 40, 9, (Sept 1952), 1089- 1101.
3. David A. Clunie, 2000, Lossless Compression of Grayscale Medical Images- Traditional and State of the Art (Approaches,www.dclunie.com/papers//spie_mi_2000_compression).
4. H.Kruse and a. Mukherjee, Data compression using Text encryption, Proceedings of the Data compression Conference, 1997,IEEE computer Society Press,pp.447.
5. Owen L.Astrachan,2004,Huffman coding:A CS2 assignment.
6. F.Awan, and A. Mukherjee ,LIPT: A lossless Text Transform to improve compression, Proceedings of International conference on information and Theory :Coding and Computing, IEEE Computer Society ,Las Vagas Nevada ,April 2001.
7. Manber U,1994 A Text Compression scheme that allows fast searching directly in the compressed file ,pro.of ombinatorial pattern matching (lecture Notes in computer science V807), Springer: London ,113-124.
8. T.Welch,1984 "A Technique for High-Performance data Compression",IEEE Computer,Vol 17.
9. M.Burrows and D.J. Wheeler. Nov2011, A Block- sorting Lossless Data Compression Algorithm,SRC Research Report 124,Digital Systems Research centre.
10. J.Ziv and A.Lempel, 1977,A universal algorithm for sequential data compression, IEEE Trans.inform.Theory, vol.IT-23, no.3, pp.337-343.

Compression Compression Ratio Redundancy Codes Lossless