Compressed pattern matching for Sequitur

S. Mitarai, M. Hirao, T. Matsumoto, A. Shinohara, M. Takeda, S. Arikawa

研究成果: Conference article査読

12 被引用数 (Scopus)

抄録

Sequitur due to Nevill-Manning and Witten. [19] is a powerful program to infer a phrase hierarchy from the input text, that also provides extremely effective compression of large quantities of semi-structured text [18]. In this paper, we address the problem of searching in Sequitur compressed text directly. We show a compressed pattern matching algorithm that finds a pattern in compressed text without explicit decompression. We show that our algorithm is approximately 1.27 times faster than a decompression followed by an ordinal search.

本文言語English
ページ(範囲)469-478
ページ数10
ジャーナルData Compression Conference Proceedings
出版ステータスPublished - 2001 1 1
外部発表はい
イベントData Compression Conference - Snowbird, UT, United States
継続期間: 2001 3 272001 3 29

ASJC Scopus subject areas

  • コンピュータ ネットワークおよび通信

フィンガープリント

「Compressed pattern matching for Sequitur」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル