By Topic

Speeding up string matching over compressed text on handheld devices using tagged sub-optimal code (TSC)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bellaachia, A. ; Dept. of Comput. Sci., George Washington Univ., DC, USA ; Rassan, I.A.

Tagged suboptimal code (TSC) is a new coding technique presented in this paper to speed up string matching over compressed databases on PDAs. TSC is a variable-length suboptimal code that supports minimal prefix property. It always determines its codeword boundary without traversing a tree or lookup table. TSC technique may be beneficial in many types of applications: speeding up string matching over compressed text, speeding decoding process, as well as any general-purpose integer representation code. 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. On the other hand, the compression ratio of TSC is 6% less than that of Huffman encoding. Additionally, TSC is 14 times faster than byte pair encoding (BPE) compression process, and achieves better performance than searching over compressed text using BPE scheme on handheld devices.

Published in:

Real-Time and Embedded Technology and Applications Symposium, 2004. Proceedings. RTAS 2004. 10th IEEE

Date of Conference:

25-28 May 2004