Stream Data Compression by Online Grammar Compression and VF Coding Algorithm
Project/Area Number |
15K00002
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Multi-year Fund |
Section | 一般 |
Research Field |
Theory of informatics
|
Research Institution | Hokkaido University |
Principal Investigator |
Kida Takuya 北海道大学, 情報科学研究科, 准教授 (70343316)
|
Co-Investigator(Renkei-kenkyūsha) |
SAKAMOTO HIROSHI 九州工業大学, 大学院情報工学研究院, 教授 (50315123)
|
Project Period (FY) |
2015-04-01 – 2018-03-31
|
Project Status |
Completed (Fiscal Year 2017)
|
Budget Amount *help |
¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2017: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2016: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2015: ¥2,080,000 (Direct Cost: ¥1,600,000、Indirect Cost: ¥480,000)
|
Keywords | データ圧縮 / VF符号化 / 圧縮照合 / 文法圧縮 / VF符号 / 高階圧縮 / ラムダ式 / 大規模データ / 透過的データ圧縮法 / 透過的データ圧縮 |
Outline of Final Research Achievements |
In this study, the applicant addressed the problem of improving the Re-Pair-VF algorithm which is a combination of VF code and grammar compression. Re-Pair-VF has better compression performance than the existing VF code, but it is difficult to apply it to large-scale data because it is based on Re-Pair which is offline type grammar transformation. Therefore, the applicant modified Re-Pair and developed online grammar transformation algorithm. Moreover, the applicant proposed an ALT (Adaptive LT-Repair) method that compresses while adaptively expanding the block length using the algorithm.
|
Report
(4 results)
Research Products
(10 results)