1997 Fiscal Year Final Research Report Summary
Speedup of Text Database by Data Compression
| Project/Area Number |
07558159
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (A)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 展開研究 |
|---|
| Research Field |
計算機科学
|
|---|
| Research Institution | Kyushu Institute of Technology |
|---|
Principal Investigator |
SHINOHARA Takeshi Kyushu Institute of Technology, Department of Atrificial Intelligence, Professor, 情報工学部, 教授 (60154225)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
FUKAMACHI Shuichi Kyushu Institute of Technology, Department of Atrificial Intelligence, Research, 情報工学部, 助手 (30274559)
SHIMOZONO Shinichi Kyushu Institute of Technology, Department of Atrificial Intelligence, Associate, 情報工学部, 助教授 (70243988)
ISHIZAKA Hiroki Kyushu Institute of Technology, Department of Atrificial Intelligence, Associate, 情報工学部, 助教授 (70260726)
|
|---|
| Project Period (FY) |
1995 – 1997
|
| Keywords | Information Retrieval / Sequential Pattern Matching / Data Compression / Text Database |
|---|
| Research Abstract |
The objective of this research is to establish a speedup method for sequential pattern matching by data compression and demonstrate its availability in text database.
We design a pattern matching machine for compressed data by Huffman codes without decoding. In the experiment on this algorithm, although the effect of this method depends on the characteristics of data, the text size and the response time of searching are reduced to 60% and 70%, respectively, for English text.
We also design a similar technique for new compression scheme, called Byte-Pair-Encoding (BPE,for short). This technique compresses English text to around 50% and reduces search time to 60%. BPE is basically a fixed length code, and therefore compresses text by BPE is efficiently distributed to processors in parallel environment.
|
