| 基于后继区间的互关联后继树搜索算法 |
| |
| 引用本文： | 王政华,胡运发. 基于后继区间的互关联后继树搜索算法[J]. 计算机工程, 2007, 33(9): 84-86 |
| |
| 作者姓名： | 王政华 胡运发 |
| |
| 作者单位： | 复旦大学计算机与信息技术系,上海,200433 |
| |
| 摘 要： | 全文检索领域的关键问题是索引模型以及该模型之上的高效搜索算法，基于一种优秀的全文索引模型互关联后继树提出了基于后继区间的搜索算法，大大提升了全文的检索速度，从而更加充分地体现了互关联后继树模型在全文领域的优势。
|
| 关 键 词： | 互关联后继树 后继区间 后继序列 |
| 文章编号： | 1000-3428（2007）09-0084-03 |
| 修稿时间： | 2006-05-08 |
Search Algorithm of Inter-relevant Successive Trees Based on Successive Parts |
| |
| WANG Zhenghua,HU Yunfa. Search Algorithm of Inter-relevant Successive Trees Based on Successive Parts[J]. Computer Engineering, 2007, 33(9): 84-86 |
| |
| Authors: | WANG Zhenghua HU Yunfa |
| |
| Affiliation: | School of Computer Information Technology, Fudan University, Shanghai 200433 |
| |
| 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. |
| |
| Keywords: | Inter-relevant successive trees(IRST) Successive parts Successive sequences |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载免费的PDF全文 |
