Abstract: The key research work on full-text index is the search model and the efficient search algorithm upon model, with inter-relevant successive trees of excellent full-text search model, this paper presents a search algorithm based on successive parts, which accelerates the full-text search rate, and demonstrates the advantages of inter-relevant successive trees in full-text domain.

Key words: Inter-relevant successive trees(IRST), Successive parts, Successive sequences

摘要： 全文检索领域的关键问题是索引模型以及该模型之上的高效搜索算法，基于一种优秀的全文索引模型互关联后继树提出了基于后继区间的搜索算法，大大提升了全文的检索速度，从而更加充分地体现了互关联后继树模型在全文领域的优势。

关键词: 互关联后继树, 后继区间, 后继序列

CLC Number: 

• TP311.12