Presentation 2006-10-17
String Matching for PPM Compressed Data
Toshihiro OKURA, Masato KITAKAMI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Fast pattern matching for compressed data get more important as the compressed data size gets lager. It also improves dependability of the compressed data by providing fast virus scanning for the compressed data. Compressed Pattern Matching, or CPM, is a class of fast pattern matching method and is executed without decompression of the compressed data. CPM for PPM compression, which is based on context matching and achieves good compression ratio, however, has not been proposed yet. This paper proposed CPM for PPM compression. The proposed method adds information on tree structure which is constructed in compression to the compressed data. CPM is executed by scanning the additional information. Computer simulation says that proposed method requires 0.1%-5% file size overhead for half of the sample files.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Data compression / Fast pattern matching / CPM(Compressed Pattern Matching) / PPM compression
Paper # DE2006-119,DC2006-26
Date of Issue

Conference Information
Committee DE
Conference Date 2006/10/10(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Data Engineering (DE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) String Matching for PPM Compressed Data
Sub Title (in English)
Keyword(1) Data compression
Keyword(2) Fast pattern matching
Keyword(3) CPM(Compressed Pattern Matching)
Keyword(4) PPM compression
1st Author's Name Toshihiro OKURA
1st Author's Affiliation Graduate School of Science and Technology, Chiba University()
2nd Author's Name Masato KITAKAMI
2nd Author's Affiliation Faculty of Engineering, Chiba University
Date 2006-10-17
Paper # DE2006-119,DC2006-26
Volume (vol) vol.106
Number (no) 290
Page pp.pp.-
#Pages 6
Date of Issue