Effective dictionary based data compression and pattern searching in dictionary based compressed data

Abstract

Effective data compression is the most important concern in data management methods. The LZW Compression method is one of the most popular algorithms in different compression method. There is one more concern i.e. compressed pattern matching. Compressed pattern matching is an emerging research area that addresses the problem in which finding patterns in the compressed data and report all the occurrences of the patterns without decompressing the compressed data. In this thesis has developed, analyzed and test a new data compression technique “Compression data Based on Dictionary” and "Searching Algorithm in Compressed data". This Algorithm generates the compression codes for words and maintains a dictionary for compression as well as decompression. Searching algorithm uses the quick search string matching algorithm for finding the required patterns.