二元互关联后继树精简索引模型研究  

Research on Streamline Inter-relevant Successive Trees

作　　者：霍林[1,2] 黄俊文[2] 卢正鼎[1] 黄保华[2] 潘英花[2] 王力[2] 

机构地区：[1]华中科技大学计算机学院,湖北武汉430074 [2]广西大学计算机与电子信息学院,广西南宁530004

出　　处：《小型微型计算机系统》2011年第2期286-290,共5页Journal of Chinese Computer Systems

基　　金：国家"八六三"高技术研究发展计划项目(2007AA01Z403)资助

摘　　要：全文检索领域的关键问题是索引模型以及索引的创建与检索算法.基于二元互关联后继树模型,提出一个实用性能好的后继节点有序的后继树精简索引模型(SIRST),并给出此模型下索引的创建与检索算法.通过将该模型与使用广泛的倒排文件模型(IF)进行比较,表明SIRST的检索效率远远高于IF,同时,随着文本集规模越来越大,SIRST的创建效率优势愈发明显.The key question of full-text retrieval domain is the index model as well as the index building and retrieval algorithms. In this paper, a novel index model named Streamline Inter-Relevant Successive Trees （ SIRST ） is proposed, which has sorted successive node and streamline node information based on the index model of Inter-Relevant Successive Trees （ IRST）, and its building and re- trieval algorithms is presented. The performance study, comparing the cost of the index building and retrieval with the traditional Inverted Files （IF） model and SIRST under various text sets and query strings, shows that SIRST is outperforms them.

关 键 词：二元互关联后继树 后继节点有序 互关联后继树精简索引模型 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]