期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

P2P Web搜索中一种有效的查询路由策略

An Effective Query Routing Strategy over P2P Web Search
下载PDF
导出
摘要 有效的多关键字查询路由是P2PWeb搜索中的一个关键问题。文章提出一种基于收益代价比的查询处理方法。该方法基于DHT的P2P覆盖网,挖掘关键字的关联性和节点间覆盖度和重叠度。利用最小独立置换进行重叠检测,因此避免了对相同记录的冗余路由。实验证明了该方法显著减少了查询时间,同时提高了查全率和查准率。 Effective multi-keyword query routing is the key problem over P2P Web search.A novel query processing strategy based on benefit cost ratio was proposed.A P2P overlay based on DHT has been built,and take into account of the correlation of Key words as well as the coverage and overlap among peers.Min-wise independent permutation was applied for overlap detection,so the redundant routing to the same result is avoided.The experimental results show that the method improves the search performance greatly.
作者 王振华 李妹芳 申德荣 于戈
机构地区 东北大学信息科学与工程学院
出处 《计算机与数字工程》 2011年第10期13-15,179,共4页 Computer & Digital Engineering
基金 国家自然科学基金(编号:60973021 61003060)资助
关键词 P2PWeb搜索 多关键字查询处理 最小独立置换 P2P Web search multi-keyword query processing min-wise independent permutation
分类号 TP301 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献10

  • 1方启明,杨广文,武永卫,郑纬民.基于P2P的Wleb搜索技术[J].软件学报,2008,19(10):2706-2719. 被引量：13
  • 2Bender M, Michel S, Triantafillou P, et al. P2P content search., give the Web back to the people[C]// IPTPS. Santa Barbara USA, 2006.
  • 3Callan J. P., Z. Lu, W. B. Croft. Searching distributed collections with inference networks [C]//SIGIR. New York.. ACM Press, 1995 : 21-28.
  • 4L. Gravano, H. Garcia-Molina, A. Tomasic. Gloss: text-source discovery over the internet [J]. ACM Trans. Database Syst. , 1999,24(2): 229-264.
  • 5L. Si, R. Jin, J. Callan, et al. A language modeling framework for resource selection and results merging [C]//CIKM. New York.. ACM Press,2002:391-397.
  • 6T. Suel, C. Mathur, J. Wu, et al. Odissea.. A peer-to-peer architecture for scalable web search and information retrieval[R]. Technical report TR-CIS-2003- 01, Polytechnic Univ. ,2003.
  • 7F. M. Cuenca-Acuna, C. Peery, R. P. Martin, et al. PlanetP.. Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities [R]. Technical Report DCS-TR-487, Dept. of Computer Science, Rutgers University,2002.
  • 8M. Bender, S. Michel, P. Triantafillou, et al. MINERVA.. collaborative P2P search [C]//VLDB. New York.. ACM Press, 2005:126341266.
  • 9A. Z. Broder, M. Charikar, A. M. Frieze, et al. Min-wise independent permutations[C]//STOC. New York:ACM Press, 1998: 327-336.
  • 10M. Mitzenmacher. Compressed Bloom filters [ J ]. IEEE/ACM Transactions on Networking, 2002, 10 (5) :604-612.

二级参考文献70

  • 1Bergman MK. The deep Web: Surfacing hidden value. White paper. The Journal of Electronic Publishing. 2001. http://www.press. umich.edu/j ep/07-01/bergman.html
  • 2Wang CG, Li B. Peer-to-Peer overlay networks: A survey. Technical Report, Department of Computer Science, Hong Kong University of Science and Technology, 2003.
  • 3Reynolds P, Vahdat A. Efficient peer-to-peer keyword searching. In: Endler M, Schmidt D, eds. Middleware 2003. LNCS 2672, Berlin: Springer-Verlag, 2003.21-40.
  • 4Zhong M, Moore J, Shen K, Murphy AL. An evaluation and comparison of current peer-to-peer full-text keyword search techniques. In: Doan A, Neven F, McCann R, Bex GJ, eds. Proc. of the 8th Int'l Workshop on the Web and Databases (WebDB 2005). New York: ACM Press, 2005.61-66.
  • 5Yang Y, Dunlap R, Rexroad M, Cooper BF. Performance of full text search in structured and unstructured peer-to-peer systems. In: Proc. of the 25th IEEE Int'l Conf. on Computer Communications (INFOCOM 2006). IEEE Computer Society, 2006.1-12.
  • 6Yang B, Garcia-Molina H. Improving search in peer-to-peer networks. In: Rodrigues L, Raynal M, Chen W, eds. Proc. of the 22nd Int'l Conf. on Distributed Computing Systems (ICDCS 2002). Washington: IEEE Computer Society, 2002.5-14.
  • 7Risson J, Moors T. Survey of research towards robust peer-to-peer networks: Search methods. Computer Networks, 2006, 50(17):3485-3521.
  • 8Cholvi V, Felber P, Biersack E. Efficient search in unstructured peer-to-peer networks. In: Gibbons PB, Adler M, eds. Proc. of the 16th Annual ACM Syrup. on Parallelism in Algorithms and Architectures (SPAA 2004). New York: ACM Press, 2004.271-272.
  • 9Joung YJ, Fang CT, Yang LW. Keyword search in DHT-based peer-to-peer networks. In: Proc. of the 25th IEEE Int'l Conf. on Distributed Computing Systems (ICDCS 2005). IEEE Computer Society, 2005. 339-348.
  • 10Joung Y J, Yang LW. Wildcard search in structured peer-to-peer networks. IEEE Trans. on Knowledge and Data Engineering, 2007,19(11):1524-1540.

共引文献12

计算机与数字工程
2011年 第10期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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