A Method of retrieving sentences and its intersection on large text bases

一种基于大文本的句子及其交集检索方法

• 批准号: 07680432
• 负责人: AOE Junichi
• 金额: $ 1.6万
• 依托单位: The University of Tokushima
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (C)
• 财政年份: 1995
• 资助国家: 日本
• 起止时间: 1995 至 1997
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-07680432/
• 关键词: text retrieval; text data; intersection; compact index; information retrieval; 文書処理; キーワード抽出; 文書管理

Storing and retrieving an useful text is animportant task in document management systems because text retrieval is the most time-consuming part of them. Inverted filing is a well-knownapproach, but there are some problems when storing a huge number ofsentences. They arise when the intersection is computed for large postings indexed by terms, or keywords. Moreover, disk access for postings also takes a lot of time in this situation. This research presents a technique fo rthe storing of multi-stages of postings and retrieving them partly in order to compute efficiently the intersection between postings for the requested terms. From the simulation results, it is shown that the presentedalgorithm is 6 to 88 times faster than the traditional approach.

存储和检索有用的文本是文档管理系统中的一项重要任务，因为文本检索是其中最耗时的部分。倒排归档是一种众所周知的方法，但在存储大量句子时存在一些问题。当计算按术语或关键字索引的大型帖子的交集时，就会出现这种情况。此外，在这种情况下，用于过帐的磁盘访问也需要花费大量时间。这项研究提出了一种存储多阶段帖子并部分检索它们的技术，以便有效计算所请求术语的帖子之间的交集。仿真结果表明，该算法比传统方法快 6 至 88 倍。

项目成果

T.Arita, M.Shishibori and J.Aoe: "An Efficient Algorithm for Full Text Retrieval for Multiple Keywords" International Journal of Information Sciences. Vol.104. 345-362 (1988)

T.Arita、M.Shishibori 和 J.Aoe：“多关键词全文检索的高效算法”国际信息科学杂志。

J.AOE: "A Trie Compaction Algorithm for Large Set of Keys" IEEE Transactions on Knowledge and Data Engineering. (発表予定). (1996)

J.AOE：“用于大型密钥集的 Trie 压缩算法”IEEE 知识和数据工程汇刊（即将发表）。

Masao Fuketa and Jun-ichi Aoe: "A Fast Algorithm of Retrieving Common Sentences" International Journal of Information Sciences. (in press). (1998)

Masao Fuketa 和 Jun-ichi Aoe：“常见句子检索的快速算法”国际信息科学杂志。

H.Mochizuki: "A Substring Search Algorithm in Extendible Hashing" International Journal of Information Science. (印刷中). (1998)

H. Mochizuki：“可扩展散列中的子串搜索算法”国际信息科学杂志（1998 年出版）。

J.AOE: "A Trie Compaction Algorithm for A Large Set of Keys" IEEE Transactions on Knowledge and Data Eng.(1996)

J.AOE：“A Large Set of Keys 的 Trie 压缩算法”IEEE Transactions on Knowledge and Data Eng.(1996)