P2P全文搜索引擎中的路由算法  

Routing Algorithm in P2P Content Search Engine

作　　者：徐传运[1] 张杨[1] 毛华扬[2] 

机构地区：[1]重庆大学计算机学院,重庆400044 [2]重庆工学院,重庆400050

出　　处：《计算机工程》2008年第17期85-87,共3页Computer Engineering

基　　金：国家"863"计划基金资助项目(2003AA116010);重庆市自然科学基金资助项目(2004BB2182)

摘　　要：针对P2P全文搜索网络效率低和搜索等待时间长的问题,提出基于k-高频词主题相关性的搜索路由算法,该算法采用k-高频词表示主题,在主题间建立连接,形成主题相关网络。在该网络中,优先将搜索请求路由到拥有较多资源的节点上,从而用较少的时间和网络通信量搜索到较多资源。结果表明,相对于"简单洪泛"算法,该算法在搜索等待时间、减少网络通信量方面表现更优,具有更高的效率。Aiming at existed deficiencies such as network efficiency reduction and long search waiting time in P2P whole-length search, a topic relative search routing algorithm based on k-high frequency term is developed. In the algorithm, topics are expressed by k-high frequency term, and the topic relative network is formed. On the topic relative network, search requests are routed to the nodes which hold more resource firstly in order to search more resource by less time and network traffic. In the algorithm, the efficiency and validity is validated by the experiment. By antitheses analysis, result shows that the algorithm has less search waiting time and network traffic than simple flooding.

关 键 词：全文搜索 主题搜索引擎 路由算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]