计算机工程 ›› 2010, Vol. 36 ›› Issue (2): 97-99.doi: 10.3969/j.issn.1000-3428.2010.02.034

• 网络与通信 • 上一篇    下一篇

超级节点网络中的并行查询和排序机制

谭义红1,2,林亚平1,欧阳竟成1,李 彬2   

  1. (1. 湖南大学计算机与通信学院,长沙 410082;2. 长沙大学信息与计算科学系,长沙 410003)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-01-20 发布日期:2010-01-20

Parallel Query and Ranking Mechanism in Super-peers Network

TAN Yi-hong1,2, LIN Ya-ping1, OUYANG Jing-cheng1, LI Bin2   

  1. (1. School of Computer and Communication, Hunan University, Changsha 410082;2. Department of Information and Computing Science, Changsha University, Changsha 410003)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-01-20 Published:2010-01-20

摘要: 超级节点网络中的超级节点可能成为网络性能的瓶颈并影响检索结果的统一排序,针对该问题提出一种并行查询和排序机制。给出类特征等索引建立方法和查询节点选择算法,减少超级节点的存储和计算负担,使其在负载能力范围内,尽可能多地连接普通节点。在获取全局参数的前提下,提出查询节点的查询和排序方法,以提高检索质量。实验结果验证了该机制的有效性。

关键词: 超级节点网络, 信息检索, 并行查询

Abstract: Super peers in super-peers network may become the network performance bottleneck and affect retrieval result global ranking. Aiming at this problem, this paper presents a parallel query and ranking mechanism. A building method for indexes such as class feature and a selection algorithm for query peers are presented to decrease the storage and computation burden of super peers and make it connect more common peers as possible in the scope of load capacity. A query and ranking method of query peers is presented to improve retrieval quality. Experimental results show that the mechanism is efficient.

Key words: super-peers network, information retrieval, parallel query

中图分类号: