Fast searching over compressed text using a new coding technique: tagged sub-optimal code (TSC)

Author

Bellaachia, Abdelghani ; Rassan, I.A.L.

Author_Institution

Washington Univ., USA

fYear

2004

fDate

23-25 March 2004

Firstpage

526

Abstract

In this paper, a new coding technique called tagged sub-optimal code (TSC) is proposed. TSC is a variable-length sub-optimal code that supports minimal prefix property. TSC technique is beneficial in many types of applications: speeding up string matching over compressed text, speeding decoding process, robustness of error detection and recovery during transmission, as well as in general-purpose integer representation code. The experimental results show that TSC is 8.9 times faster than string matching over compressed text using Huffman encoding, and 3 times faster in the decoding process.

Keywords

Huffman codes; data compression; decoding; error detection; error detection codes; string matching; text analysis; variable length codes; Huffman encoding; coding technique; compressed text; error detection; fast search; general-purpose integer representation code; minimal prefix property; recovery transmission; speeding decoding process; string matching; tagged sub-optimal code; variable-length sub-optimal code; Data compression; Data processing; Decoding; Delay; Encoding; Notice of Violation; Robustness; Table lookup;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Compression Conference, 2004. Proceedings. DCC 2004

ISSN

1068-0314

Print_ISBN

0-7695-2082-0

Type

conf

DOI

10.1109/DCC.2004.1281502

Filename

1281502