基于后继区间的互关联后继树搜索算法  

Search Algorithm of Inter-relevant Successive Trees Based on Successive Parts

作　　者：王政华[1] 胡运发[1] 

机构地区：[1]复旦大学计算机与信息技术系,上海200433

出　　处：《计算机工程》2007年第9期84-86,共3页Computer Engineering

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

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

分 类 号：TP311.12[自动化与计算机技术—计算机软件与理论]