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

2001 Fiscal Year Final Research Report Summary

A fast n-gram full text search independent of document size and it application to a huge text base

Research Project

Project/Area Number 10480082
Research Category

Grant-in-Aid for Scientific Research (B)

Allocation TypeSingle-year Grants
Section一般
Research Field 情報システム学(含情報図書館学)
Research InstitutionThe University of Tokushima

Principal Investigator

AOE Junichi  The University of Tokushima, Information Science, Professor, 工学部, 教授 (90108853)

Co-Investigator(Kenkyū-buntansha) SHISHIBORI Masami  The University of Tokushima, Information Science, Associate Professor, 工学部, 助教授 (50274262)
SATO Takashi  Osaka Kyoiku University, Information Science, Associate Professor, 教育学部, 助教授 (20124117)
KITA Kenji  The University of Tokushima, Information Science, Professor, 工学部, 教授 (10243734)
Project Period (FY) 1998 – 2001
KeywordsText database / Retrieval method / Keyword Search / test retrieval
Research Abstract

Research results are evaluated as follows:
1. Improvement of dynamic n-gram storage structures
The ratio of improving approaches by Heisei 11, 12 and 13 became 25 %.
2. Compression evaluation for postings
Experimental results in the final year reaches 85 % compression to the previous approaches.
3. Retrieval Efficiency in partial Matching
The speed is improved about 30 % for the old in des tables.
4. Evaluation of practical text databases
It is verified that n-gram full text search presented in this search is independent of the size of documents.

  • Research Products

    (10 results)

All Other

All Publications (10 results)

  • [Publications] M.Jung: "A Dynamic Construction Algorithm for the Compact tree"Information Processing & Management. 38. 221-236 (2002)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] S.Lee, J.Aoe: "Extraction of Field coherent passages"Information Processing & Management. 38. 173-207 (2002)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] EL-Sayed AHam: "Words Tendency Depending on Time-Series Variation"Information Processing & Management. 38. 157-171 (2002)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 森田和宏: "ダブル配列における動的更新の効率化アルゴリズム"情報処理学会論文誌. 42. 2229-2238 (2001)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Y.Yamakawa: "A Method for Improving Full Text Search Using Signature Files"Computer Mathematics. 77. 73-88 (2001)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Jung,M., Aoe,J.: "A dynamic Construction Algorithm for the compact tree"Information Processing & Management. 38, No. 2. 221-236 (2002)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Lee,S., Aoe,J.: "Extraction of Field Coherent Passages"Information Processing & Management. 38, No. 2. 173-207 (2002)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Atlam,El-Sayed, Aoe,J.: "Words Tendancy Repending on Time-Series Variation"Information Processing & Management. 38, No. 2. 157-171 (2002)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Morita,Kazuhiro, Aoe,J.: "Dynamic Updating Method of Double-Array Structures"Information Processing. 77, No. 5. 73-88 (2001)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Yamakawa,Y., Aoe,J.: "A Method for Improving Full Text Search Using Signatures"Computer Mathematics. 42. 73-88 (2001)

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 2003-09-17  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi