Open AccessCompressing the Data Densely by New Geflochtener to Accelerate Web
Author(s) -
Hemant Kumar Saini,
Satpal Singh Kushwaha,
C. Rama Krishna
Publication year - 2014
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/16377-5867
Subject(s) - computer science , parsing , bandwidth (computing) , data compression , the internet , compression ratio , path (computing) , data mining , algorithm , artificial intelligence , world wide web , computer network , automotive engineering , engineering , internal combustion engine
At the present scenario of the internet, there exist many optimizationtechniques to improve the Web speed but almost expensive in terms of bandwidth.So after a long investigation on different techniques to compress the datawithout any loss, a new algorithm is proposed based on L Z 77 family whichselectively models the references with backward movement and encodes thelongest matches through greedy parsing with the shortest path technique tocompresses the data with high density. This idea seems to be useful since thesingle Web Page contains many repetitive words which create havoc in consumingspace, so let it removes such unnecessary redundancies with 70% efficiency andcompress the pages with 23.75 - 35% compression ratio