期刊文献+

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

Parallel Query and Ranking Mechanism in Super-peers Network
下载PDF
导出
摘要 超级节点网络中的超级节点可能成为网络性能的瓶颈并影响检索结果的统一排序,针对该问题提出一种并行查询和排序机制。给出类特征等索引建立方法和查询节点选择算法,减少超级节点的存储和计算负担,使其在负载能力范围内,尽可能多地连接普通节点。在获取全局参数的前提下,提出查询节点的查询和排序方法,以提高检索质量。实验结果验证了该机制的有效性。 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.
出处 《计算机工程》 CAS CSCD 北大核心 2010年第2期97-99,共3页 Computer Engineering
基金 湖南省教育厅科研基金资助项目(07B007)
关键词 超级节点网络 信息检索 并行查询 super-peers network information retrieval parallel query
  • 相关文献

参考文献5

  • 1Shen Hengtao, Shu Yanfeng, Yu Bei. Efficient Semantic-based Content Search in P2P Network[J]. 1EEE Transactions on Knowledge and Data Engineering, 2004, 16(7): 813-826.
  • 2Airiau S, Sen S, Dasgupta P. Effect of Joining Decisions on Peer Clusters[C]//Proc. of the 5th International Joint Conference on Autonomous Agents and Multiagent System. Hakodate, Japan: [s. n.], 2006.
  • 3Montresor A. A Robust Protocol for Building Super Peer Overlay Topologies[C]//Proc. of the 4th International Conference on Peer-to-Peer Computing. Zurich, Switzerland: [s. n.], 2004.
  • 4何盈捷,王珊,杜小勇.纯Peer to Peer环境下有效的Top-k查询[J].软件学报,2005,16(4):540-552. 被引量:23
  • 5Cuenca-Acuna F M, Peery C, Martin R P, et al. PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities[C]//Proc. of HPDC'03. Seattle, USA: [s. n.], 2003: 236-249.

二级参考文献18

  • 1Napster Home Page. http://www.napster.com/
  • 2Gnutella Home Page. http://www.gnutella.com/
  • 3Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H. Chord: A scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM Computer Communication Review, 2001,31 (4): 149-160.
  • 4Baeza-Yates R, Ribeiro-Neto B. Modem Information Retrieval. Boston: Addison Wesley, 1999.27-30.
  • 5Palmer CR, Steffan JG. Generating network topologies that obey power law. In: Proc. of the GLOBECOM. San Francisco: IEEE,2000. 434-438. http://citeseer. ist.psu.edu/palmer00generating.html
  • 6Ripeanu M. Peer-to-Peer architecture case study: Gnutella network. Technical Report, TR-2001-26, University of Chicago, 2001.
  • 7Buckley C. Implementation of the SMART information retrieval system. Technical Report, TR35-686, Cornell University, 1985.
  • 8Yu C, Philip G, Meng WY. Distributed top-n query processing with possibly uncooperative local systems. In: Freytag JC,Lockemann PC, Abiteboul S, Carey MJ, Selinger PG, Heuer A, eds. Proc. of the 29th Int'l Conf. on Very Large Data Bases. Berlin:Morgan Kaufmann Publishers, 2003.117-128.
  • 9Gravano L, Garcia-Molina H, Tomasic A. The effectiveness of GLOSS for the text database discovery problem. In: Snodgrass RT,Winslett M, eds. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. New York: ACM Press, 1994. 126-137.
  • 10Callan JP, Lu ZH, Croft WB. Searching distributed collections with inference networks. In: Proc. of the 18th Annual Int'l ACM SIGIR Conf. on Research and Development in Information Retrieval. Seattle: ACM Press, 1995.21-28.

共引文献22

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部