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

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Bellaachia, A., Rassan, I.A.
Format: Conference Proceeding
Language:English
Subjects:
Applied sciences
Computer science
Computer science
control theory
systems
Decoding
Electronic mail
Encoding
Exact sciences and technology
Handheld computers
Pattern matching
Personal digital assistants
Table lookup
Web pages
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1545-3421
2642-7346
DOI:10.1109/RTTAS.2004.1317259