期刊文献+

基于关键字关联及节点兴趣的搜索机制

Search Mechanism Based on Keyword Relationship and Node Interest
下载PDF
导出
摘要 P2P节点用户的搜索内容在一定程度上体现了用户的兴趣。为此,提出一种基于关键字关联和节点兴趣的P2P信息搜索机制。该机制注重关键字之间关系的学习,通过用户操作发现节点兴趣。在搜索中利用关键字的语义关系增加命中目标,提高搜索成功率。根据节点兴趣缩小搜索范围、降低搜索开销。实验结果表明,采用快速建立索引表的方法和反馈机制能有效提高搜索性能。 The search content of node Peer-to-Peer(P2P) users reflects the user interest.So this paper proposes a search mechanism based on keywords relationship and node interest.The mechanism learns focus on the relationship between keywords,finds node by user interest.The use of keywords in the search increases the target semantic relations,and improves the search success rate.According to the node of interest,it narrows search and reduces the search overhead.Experimental results show that the fast index table method and the feedback mechanism can effectively improve the search performance.
出处 《计算机工程》 CAS CSCD 北大核心 2011年第6期162-164,共3页 Computer Engineering
基金 湖南省科技计划基金资助项目(2010CK3069) 湖南省大学生研究性学习和创新性实验计划基金资助项目"自组织适应模式的P2P路由算法的研究与实践"(湘教通[2009]320号406) 长沙理工大学城南学院教研教改课题基金资助项目(CN1006)
关键词 P2P网络 节点兴趣 关键字关联 信息搜索 Peer-to-Peer(P2P) network node interest keyword relationship information retrieval
  • 相关文献

参考文献6

  • 1Sripanidkulchai K, Maggs B, Zhang Hui. Efficient Content Location Using Interest-based Locality in Peer-to-Peer Systems[C]//Proc. of IEEE Conference on Computer Communications. San Francisco, USA: IEEE Press, 2003.
  • 2Gkantsidis C, Mihail M, Saberi A. Random Walks in Peer-to-Peer Networks[C]//Proc. of IEEE Conference on Computer Communications. Hong Kong, China: IEEE Press, 2004.
  • 3Guo Leitao, Yang Shoubao, Wang Jing. Trust Model Based on Similarity Measure of Vectors in P2P Networks[C]//Proc. of the 4th International Conference on Grid and Cooperative Computing. Beijing, China: [s. n.], 2005.
  • 4Xue Guangtao, You Jinyuan, Jia Zhaoqing. An Interest Group Model for Content Location in Peer-to-Peer Systems[C]//Proc. of CEC-East'04. Beijing, China: IEEE Computer Society, 2004.
  • 5段世惠,王劲林.基于Bloom Filter路由表的P2P搜索算法[J].计算机工程,2010,36(2):25-27. 被引量:2
  • 6孙力,陈兰,袁媛.基于节点兴趣的非结构化P2P搜索机制[J].计算机工程,2009,35(23):76-77. 被引量:6

二级参考文献13

  • 1朱晓姝,周娅,黄桂敏.基于小世界层次分布式路由模型研究[J].计算机工程,2006,32(15):120-122. 被引量:7
  • 2Hildrum K, Kubiatowicz J, Rao S. Distributed Object Location in a Dynamic Network[C]//Proceedings of the 14th ACM Symp. on Parallel Algorithms and Architectures. Winnipeg, USA: ACM Press, 2002: 41-52.
  • 3Sripanidkulchai K, Maggs B, Zhang Hui. Efficient Content Location Using Interest-based Locality in Peer to Peer Systems[C]//Proc. of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies. San Francisco; USA: IEEE Press, 2003: 2166-2176.
  • 4Reynolds P, Vahdat A. Efficient Peer to Peer Keyword Searching[M]. Berlin, Germany: Springer-Verlag, 2003.
  • 5Matei R, Inn, F, Adriana I. Mapping the Gnutella Network: Properties of Large-scale Peer-to-Peer Systems and Implications for.
  • 6System Design[J]. IEEE Internet Computing Journal, 2002, 6(1): 50-57.
  • 7Christos G, Milena M, Amin S. Random Walks in Peer-to-Peer Networks[C]//Proc. of the IEEE INFOCOM'04. New York, USA: IEEE Press, 2004: 120-130.
  • 8Crespo A, Garcia-Molnia H. Routing Indices for Peer-to-Peer Systems[C]//Proc. of the 22nd IEEE International Conference on Distributed Computing Systems. Vienna, Austria: [s. n.], 2002.
  • 9Joseph S R H. Neuro Grid: Semantically Routing Queries in Peer-to-Peer Netwokrs[C]//Proc. of International workshop on Peer-to-Peer Computing Pisa, Italy:[s. n ], 2002.
  • 10Bloom B. Space/time Trade-offs in Hash Coding with Allowable Errors[J]. Communications of the ACM, 1970, 13(7): 422-426.

共引文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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