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

Research Project

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 *help	¥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.

Report

(4 results)