String Matching Over Compressed Text on Handheld Devices Using Tagged Sub-Optimal Code (TSC)

• Published in: Real-time systems 2005-03, Vol.29 (2-3), p.227-246
• Main Authors: Bellaachia, Abdelghani, AL Rassan, Iehab
• Format: Article
• Language: English
• Subjects: Algorithms; Decoding; Huffman codes; Lookup tables; Personal digital assistants; String matching; Time compression
• ISSN: 0922-6443; 1573-1383
• DOI: 10.1007/s11241-005-6886-9

This paper presents Tagged Sub-optimal code (TSC), a new coding technique to speed up string matching over compressed databases on personal digital assistants (PDA). TSC is a variable-length sub-optimal 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, and speeding decoding process. This paper also presents two algorithms for string matching over compressed text using TSC (SCTT) and the Byte Pair Encoding (BPE) technique (SCTB). indent Several experiments were conducted to compare the performance of TSC, Byte Pair Encoding (BPE), and Huffman code. Several PDA databases with different record sizes were used: the well-known Calgary dataset and a set of small-sized PDA databases. Experimental results show that SCTT is almost twice as fast as the Huffman-based algorithm. SCTT has also the same performance in search time as the search in uncompressed databases and is faster than the SCTB algorithm. For frequently updated PDA databases such as phone books, to-do list, and memos, SCTT is the recommended method regardless of the size of the average record length, since the time required to compress the updated records using BPE poses significant delays compared to TSC.