A Boyer-Moore Type Algorithm for Compressed Pattern Matching
Yusuke Shibata, 柴田, 裕介, Matsumoto, Tetsuya, 徹也 松本, Masayuki Takeda, 正幸 竹田, Ayumi Shinohara, 歩 篠原, Setsuo Arikawa, 節夫 有川 · Institutional Repositories DataBase (IRDB) · 1999
Recently the compressed pattern matching problem has attracted special concern, where the goal is to find a pattern in a compressed text without decompression. In previous work, we proposed an Aho-Corasick (AC) type algorithm for searching in text files compressed by the so-called byte pair encoding (BPE). The searching time is reduced at the same rate as the compression ratio compared with AC. In this paper, we show a Boyer-Moore (BM) type algorithm for pattern matching in BPE compressed files. Experimental results show that the algorithm runs about 1.5 ~ 3.0 times faster than the exact match routines based on the BM algorithm in the software package Agrep, which is known as the fastest pattern matching tool.