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

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

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.