Methods to Retrieve Optimal States and to Compress Dictionaries for Double Array Structures by Deleting CHECK

• Project/Area Number: 24500118
• Research Category: Grant-in-Aid for Scientific Research (C)
• Allocation Type: Multi-year Fund
• Section: 一般
• Research Field: Media informatics/Database
• Research Institution: The University of Tokushima
• Principal Investigator: FUKETA Masao 徳島大学, ソシオテクノサイエンス研究部, 准教授 (10304552)
• Project Period (FY): 2012-04-01 – 2015-03-31
• Project Status: Completed (Fiscal Year 2014)
• Budget Amount: ¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000); Fiscal Year 2014: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000); Fiscal Year 2013: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000); Fiscal Year 2012: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
• Keywords: トライ / ダブル配列 / 情報検索 / キーワード検索 / 圧縮アルゴリズム / 圧縮

Outline of Final Research Achievements

Retrieval is very important processing for various applications in computers. Double Array is the method to retrieve words at fast speed. Although it uses two arrays called BASE and CHECK, the proposed method is to compress space usage and keep the retrieval speed of Double Array by deleting CHECK. From experimental results, the proposed method is efficient in some keysets.

Research Products

• [Presentation] Comparisons of Efficient Implementations for DAWG (2014)
  • Author(s): Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe
  • Organizer: 7th International Conference on Computer Science and Information Technology (ICCSIT2014)
  • Place of Presentation: Hotel Avenida Palace(Barcelona, Spain)
  • Year and Date: 2014-12-22 – 2014-12-24
• [Presentation] A Retrieval Method for Double Array Structures by Using Byte N-Gram (2013)
  • Author(s): Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe
  • Organizer: 6th International Conference on Computer Science and Information Technology (ICCSIT2013)
  • Place of Presentation: Timhotel Berthier Paris( France)