Title: A compression scheme allowing direct string matching on compressed binary files and its applications

Authors: Meng Zhang; Wenxing Zhang; Shuaiyi Bu

Addresses: College of Computer Science and Technology, Jilin University, Changchun, China ' College of Computer Science and Technology, Jilin University, Changchun, China ' College of Computer Science and Technology, Jilin University, Changchun, China

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.

Keywords: algorithm; compression; pattern matching.

DOI: 10.1504/IJWMC.2017.084186

International Journal of Wireless and Mobile Computing, 2017 Vol.12 No.2, pp.142 - 146

Received: 09 Dec 2016
Accepted: 14 Jan 2017
Published online: 16 May 2017 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article