Title

Compressed Pattern Matching

Abstract

In this paper we present hardware algorithms and their software implementation to search a compressed text with respect to keys or patterns in compressed form using tree based codes such as Huffman code. The idea of compressed pattern matching scheme has been utilized to perform the join operation of two big compressed database files without decoding it. The issues of this implementation will be subject matter of future papers. We also proposed a compressed pattern matching algorithm for adaptive Huffman type tree based codes using a simple modification of the said scheme. We proved that compressed pattern matching using arithmetic codes is not possible. We also discussed the issues related to complex compressed pattern search using LZ-code and arithmetic codes.

Publication Date

1-1-1994

Publication Title

Proceedings of the Data Compression Conference

Number of Pages

468-

Document Type

Article; Proceedings Paper

Identifier

scopus

Personal Identifier

scopus

Socpus ID

0027962048 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0027962048

This document is currently not available here.

Share

COinS