Proceedings of the 2005 ACM symposium on Applied computing
Efficient stream sequence matching algorithms for handheld devices on time-series stream data
DBA'06 Proceedings of the 24th IASTED international conference on Database and applications
Fast blocking of undesirable web pages on client PC by discriminating URL using neural networks
Expert Systems with Applications: An International Journal
Optimizing web services for mobile devices using tagged sub optimal code (TSC)
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
| Hi-index | 0.00 |
Tagged Sub-optimal code (TSC) is a new codingtechnique presented in this paper to speed up stringmatching over compressed databases on PDAs. TSCis a variable-length sub-optimal code that supportsminimal prefix property. It always determines itscodeword boundary without traversing a tree orlookup table. TSC technique may be beneficial inmany types of applications: speeding up stringmatching over compressed text, speeding decodingprocess, as well as any general-purpose integerrepresentation code. Experimental results show thatTSC is 8.9 times faster than string matching overcompressed text using Huffman encoding, and 3times faster in the decoding process. On the otherhand, the compression ratio of TSC is 6% less thanthat of Huffman encoding. Additionally, TSC is 14times faster than Byte Pair Encoding (BPE)compression process, and achieves betterperformance than searching over compressed textusing BPE scheme on handheld devices.