• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

On high performance VF coding allowing fast and and sophisticated pattern matching

Research Project

Project/Area Number 23700002
Research Category

Grant-in-Aid for Young Scientists (B)

Allocation TypeMulti-year Fund
Research Field Fundamental theory of informatics
Research InstitutionHokkaido University

Principal Investigator

KIDA Takuya  北海道大学, 情報科学研究科, 准教授 (70343316)

Project Period (FY) 2011 – 2013
Project Status Completed (Fiscal Year 2013)
Budget Amount *help
¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
Fiscal Year 2013: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2012: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2011: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Keywords圧縮照合 / データ圧縮 / 文法圧縮 / VF符号 / 大規模データ / 透過的データ圧縮法 / 接尾辞木 / パターン照合
Research Abstract

In this study, the applicant addressed the problem of improving variable-length-to-fixed-length codes (VF codes). A VF code is an encoding scheme that uses a fixed-length code, which provides easy access to compressed data. However, conventional VF codes generally have an inferior compression ratio compared with variable-length codes. The applicant et al. proposed a new VF coding method that applies a fixed-length code to a set of rules extracted using the Re-Pair algorithm, which was proposed by Larsson and Moffat in 1999. The Re-Pair algorithm is a simple offline grammar-based compression method, which has good compression-ratio performance with moderate compression speed. The proposed method is named as Re-Pair-VF coding. The experimental results showed that Re-Pair-VF coding is superior to the existing VF coding method.

Report

(4 results)
  • 2013 Annual Research Report   Final Research Report ( PDF )
  • 2012 Research-status Report
  • 2011 Research-status Report
  • Research Products

    (26 results)

All 2014 2013 2012 2011 Other

All Journal Article (2 results) (of which Peer Reviewed: 2 results) Presentation (23 results) Remarks (1 results)

  • [Journal Article] A Variable-length-to-fixed-length Coding Method Using a Re-Pair Algorithm2013

    • Author(s)
      Satoshi Yoshida and Takuya Kida
    • Journal Title

      IPSJ Transactions on Databases

      Volume: Vol.6, No.4 Pages: 17-23

    • NAID

      130004516294

    • Related Report
      2013 Annual Research Report 2013 Final Research Report
    • Peer Reviewed
  • [Journal Article] Improving Parse Trees for Efficient Variable-to-Fixed Length Codes2012

    • Author(s)
      S. Yoshida, T. Uemura, T. Kida, et al.
    • Journal Title

      Journal of Information Processing

      Volume: 20 Issue: 1 Pages: 238-249

    • DOI

      10.2197/ipsjjip.20.238

    • NAID

      130002116415

    • ISSN
      1882-6652
    • Related Report
      2013 Final Research Report 2011 Research-status Report
    • Peer Reviewed
  • [Presentation] Direct Access to Variable-to-Fixed Length Codes with a Succinct Index2014

    • Author(s)
      Satoshi Yoshida, Hirohito Sasakawa, Kei Sekine, Takuya Kida
    • Organizer
      Proceedings of Data Compression Conference 2014 (DCC 2014)
    • Place of Presentation
      Snowbird, Utah, USA(p.436)
    • Year and Date
      2014-03-27
    • Related Report
      2013 Final Research Report
  • [Presentation] Adaptive Dictionary Sharing Method for Re-Pair Algorithm2014

    • Author(s)
      Kei Sekine, Hirohito Sasakawa, Satoshi Yoshida, Takuya Kida
    • Organizer
      Proceedings of Data Compression Conference 2014 (DCC 2014)
    • Place of Presentation
      Snowbird, Utah, USA(p.425)
    • Year and Date
      2014-03-27
    • Related Report
      2013 Final Research Report
  • [Presentation] Direct Access to Variable-to-Fixed Length Codes with a Succinct Index2014

    • Author(s)
      Satoshi Yoshida, Hirohito Sasakawa, Kei Sekine, Takuya Kida
    • Organizer
      Data Compression Conference 2014
    • Place of Presentation
      Snowbird, Utah, USA
    • Related Report
      2013 Annual Research Report
  • [Presentation] Adaptive Dictionary Sharing Method for Re-Pair Algorithm2014

    • Author(s)
      Kei Sekine, Hirohito Sasakawa, Satoshi Yoshida, Takuya Kida
    • Organizer
      Data Compression Conference 2014
    • Place of Presentation
      Snowbird, Utah, USA
    • Related Report
      2013 Annual Research Report
  • [Presentation] Effective Variable-Length-to-Fixed- Length Coding via a Re-Pair Algorithm2013

    • Author(s)
      Satoshi Yoshida and Takuya Kida
    • Organizer
      Proceedings of Data Compression Conference 2013 (DCC 2013)
    • Place of Presentation
      Snowbird, Utah, USA(p. 532)
    • Year and Date
      2013-03-21
    • Related Report
      2013 Final Research Report
  • [Presentation] Variable-to-Fixed-Length Encoding for Large Texts Using Re-Pair Algorithm with Shared Dictionaries2013

    • Author(s)
      Kei Sekine, Hirohito Sasakawa, Satoshi Yoshida, and Takuya Kida
    • Organizer
      Proceedings of Data Compression Conference 2013 (DCC 2013)
    • Place of Presentation
      Snowbird, Utah, USA(p.518)
    • Year and Date
      2013-03-21
    • Related Report
      2013 Final Research Report
  • [Presentation] 大規模テキストに対する共有辞書を用いたRe-Pair 圧縮法2013

    • Author(s)
      関根渓,笹川裕人,吉田諭史,喜田拓也
    • Organizer
      第5回データ工学と情報マネジメントに関するフォーラム(DEIM2013)
    • Place of Presentation
      福島県(No.C10-2)
    • Year and Date
      2013-03-05
    • Related Report
      2013 Final Research Report
  • [Presentation] 長大な拡張文字列パターンに対するGPU による高速な文字列照合2013

    • Author(s)
      笹川 裕人, 喜田 拓也, 有村 博紀
    • Organizer
      第5回データ工学と情報マネジメントに関するフォーラム (DEIM2013)
    • Place of Presentation
      福島県(No. E2-4)
    • Year and Date
      2013-03-03
    • Related Report
      2013 Final Research Report
  • [Presentation] 共有辞書を用いた効率の良い圧縮アルゴリズム2012

    • Author(s)
      関根渓,笹川裕人,吉田諭史,喜田拓也
    • Organizer
      第156回データベースシステム研究発表会
    • Place of Presentation
      京都府(Vol.2012-DBS-156,No.7)
    • Year and Date
      2012-12-12
    • Related Report
      2013 Final Research Report
  • [Presentation] An Efficient VF Coding via Re-Pair Algorithm2012

    • Author(s)
      Satoshi Yoshida and Takuya Kida
    • Organizer
      International Workshop on Information Search, Integration and Personalization (ISIP'2012)
    • Place of Presentation
      Sapporo, Japan
    • Year and Date
      2012-10-12
    • Related Report
      2013 Final Research Report
  • [Presentation] Analysis of Multiplexed Parse Trees for Almost Instantaneous VF codes2012

    • Author(s)
      Satoshi Yoshida and Takuya Kida
    • Organizer
      Proceedings of the 3rd IIAI International Conference on e-Services and Knowledge Management (IIAI ESKM 2012)
    • Place of Presentation
      Fukuoka, Japan(pp.36-41)
    • Year and Date
      2012-09-20
    • Related Report
      2013 Final Research Report
  • [Presentation] A Multiplexed Parse Tree for Almost Instantaneous VF Codes2012

    • Author(s)
      Satoshi Yoshida and Takuya Kida
    • Organizer
      the 15th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2012)
    • Place of Presentation
      Tokyo, Japan
    • Year and Date
      2012-07-10
    • Related Report
      2013 Final Research Report
  • [Presentation] Re-pair アルゴリズムを用いた効率よいVF 符号2012

    • Author(s)
      吉田諭史, 喜田拓也
    • Organizer
      第4回データ工学と情報マネジメントに関するフォーラム (DEIM2012)
    • Place of Presentation
      兵庫県(D7-1)
    • Year and Date
      2012-03-04
    • Related Report
      2013 Final Research Report
  • [Presentation] 効率よいVF 符号化のための分節木を訓練する新手法2011

    • Author(s)
      吉田諭史,喜田拓也
    • Organizer
      第10回情報科学技術フォーラム
    • Place of Presentation
      函館(No.A-008)
    • Year and Date
      2011-09-07
    • Related Report
      2013 Final Research Report
  • [Presentation] 効率よいVF 符号のためのMDL 原理に基づく分節木の訓練手法2011

    • Author(s)
      吉田諭史,喜田拓也
    • Organizer
      情報処理学会 第152回 データベースシステム・第103回 情報基礎とアクセス技術 合同研究発表会
    • Place of Presentation
      京都府(Vol.2011-IFAT-103 No.14)
    • Year and Date
      2011-08-03
    • Related Report
      2013 Final Research Report
  • [Presentation] 効率よいVF符号化のための分節木を訓練する新手法2011

    • Author(s)
      吉田諭史,喜田拓也
    • Organizer
      第10回情報科学技術フォーラム
    • Place of Presentation
      函館(函館大学)
    • Related Report
      2011 Research-status Report
  • [Presentation] 効率よいVF符号のためのMDL原理に基づく分節木の訓練手法2011

    • Author(s)
      吉田諭史,喜田拓也
    • Organizer
      情報処理学会 第152回 データベースシステム・第103回 情報基礎とアクセス技術 合同研究発表会
    • Place of Presentation
      京都(立命館大学)
    • Related Report
      2011 Research-status Report
  • [Presentation] Effective Variable-Length-to-Fixed-Length Coding via a Re-Pair Algorithm

    • Author(s)
      Satoshi Yoshida and Takuya Kida
    • Organizer
      Proc. of Data Compression Conference 2013 (DCC 2013)
    • Place of Presentation
      The Cliff Lodge convention center (USA)
    • Related Report
      2012 Research-status Report
  • [Presentation] Variable-to-Fixed-Length Encoding for Large Texts Using Re-Pair Algorithm with Shared Dictionaries

    • Author(s)
      Kei Sekine, Hirohito Sasakawa, Satoshi Yoshida, and Takuya Kida
    • Organizer
      Proc. of Data Compression Conference 2013 (DCC 2013)
    • Place of Presentation
      The Cliff Lodge convention center (USA)
    • Related Report
      2012 Research-status Report
  • [Presentation] 大規模テキストに対する共有辞書を用いたRe-Pair圧縮法

    • Author(s)
      関根渓,笹川裕人,吉田諭史,喜田拓也
    • Organizer
      第5回データ工学と情報マネジメントに関するフォーラム(DEIM2013)
    • Place of Presentation
      ホテル華の湯(福島県)
    • Related Report
      2012 Research-status Report
  • [Presentation] 共有辞書を用いた効率の良い圧縮アルゴリズム

    • Author(s)
      関根渓,笹川裕人,吉田諭史,喜田拓也
    • Organizer
      第156回データベースシステム研究発表会
    • Place of Presentation
      キャンパスプラザ京都(京都府)
    • Related Report
      2012 Research-status Report
  • [Presentation] Analysis of Multiplexed Parse Trees for Almost Instantaneous VF codes

    • Author(s)
      Satoshi Yoshida and Takuya Kida
    • Organizer
      Proc. 3rd IIAI International Conference on e-Services and Knowledge Management (IIAI ESKM 2012)
    • Place of Presentation
      Kyushu University (Fukuoka)
    • Related Report
      2012 Research-status Report
  • [Presentation] A Multiplexed Parse Tree for Almost Instantaneous VF Codes

    • Author(s)
      Satoshi Yoshida and Takuya Kida
    • Organizer
      In the 15th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2012)
    • Place of Presentation
      National Institute of Informatics (Tokyo)
    • Related Report
      2012 Research-status Report
  • [Remarks]

    • URL

      http://www-ikn.ist.hokudai.ac.jp/~kida/publication.html

    • Related Report
      2013 Final Research Report

URL: 

Published: 2011-08-05   Modified: 2019-07-29  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi