A compression scheme allowing direct string matching on compressed binary files and its applications
by Meng Zhang; Wenxing Zhang; Shuaiyi Bu
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 12, No. 2, 2017

Abstract: In this paper, we present a compression scheme that allows direct string matching on compressed files. The scheme can compress general files not limited to ASCII texts. We apply this compression scheme to several search programs including grep and ClamAV, which is a widely used anti-virus system. By compressing the files and the patterns with the same compression scheme, the programs can scan the compressed files directly for compressed patterns. Since the file is compressed, the searching time on compressed files is decreased comparing to the uncompressed case. We conducted several tests on binary of files. For binary executable files, we achieve about 15% space reduction and 15% running time reduction.

Online publication date: Tue, 16-May-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com