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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.