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

2014 Fiscal Year Final Research Report

• 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
• 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.

Free Research Field

情報検索