计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (2): 75-77.DOI: 10.3778/j.issn.1002-8331.2011.02.024

• 网络、通信、安全 • 上一篇    下一篇

超级节点网络中并行查询和合并机制研究

谭义红1,2,陈治平1,栾悉道1   

  1. 1.长沙大学 信息与计算科学系,长沙 410003
    2.湖南大学 计算机与通信学院,长沙 410082
  • 收稿日期:2009-08-13 修回日期:2009-10-19 出版日期:2011-01-11 发布日期:2011-01-11
  • 通讯作者: 谭义红

Research on parallel query and merging mechanism in super-peers networks

TAN Yihong1,2,CHEN Zhiping1,LUAN Xidao1   

  1. 1.Department of Information and Computing Science,Changsha University,Changsha 410003,China
    2.School of Computer and Communication,Hunan University,Changsha 410082,China
  • Received:2009-08-13 Revised:2009-10-19 Online:2011-01-11 Published:2011-01-11
  • Contact: TAN Yihong

摘要: 针对超级网络中超级节点可能会导致网络瓶颈、检索结果重复问题,提出一种并行查询和合并机制。首先提出超级节点选择查询节点的算法,以减少超级节点的存储和计算负担。然后提出选择下载节点的合并算法,以得到高质量、新颖和更能有效获取的检索结果。实验结果表明了该机制的有效性。

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

Abstract: For a super-peers network facing a few challenges such as network bottleneck and retrieval result duplicated,a mechanism to parallel query and merge the results retrieved is proposed.Firstly,in order to decrease super-peer burden,a method of selecting query-peer in a super-peer is presented.The method and algorithm can let a super-peer connect more client-
peers in the scope of load capacity.A method of detecting duplicated results is presented,and a strategy of selecting download peer for duplicated results based on download data quantity and response time.The strategy can efficient reduce retrieval overlap,network transfers quantity for downloading results and response time for acquiring results.The experimental results show that the proposed mechanism is efficient.

Key words: super-peers networks, information retrieval, parallel query, retrieval result merging

中图分类号: