期刊文献+

基于语义和Chord算法的P2P搜索模型

Searching model in P2P network based on semantics and Chord arithmetic
下载PDF
导出
摘要 基于有组织的P2P网络,给出了一个将语义和Chord算法融合的搜索算法,以解决搜索信息的表达能力和负载平衡问题.算法的基本思想是将一个引入超级节点和域组概念的有组织P2P结构作为基于语义的P2P网络的拓扑结构,利用超级节点和相似度思想,使含有相似主题的结点尽可能链接在同一个超级节点上,并利用关键字和语义的二次比较来进行查询定位,实现了在搜索效率和准确性上的相互协调.最后在现有Edutella架构基础上,分别对有组织语义P2P网络和Chord算法进行扩展,构建搜索算法的实验环境.实验表明,该方法提高了P2P系统的搜索成功率和搜索效率. To resolve the problems of expressive ability of search information and load equation, a new search algorithm which is based on semantic content and Chord arithmetic is presented. The idea of the algorithm is: using the organizational peer to peer (P2P) network with the super-node and domain to build the topology structure which is based on semantic P2P network, and using the concepts of super-node and similitude degree to make nodes having similar theme connected to the same super-node and to query and locate by two times comparison of keywords and semantic content, then the efficiency and accuracy of the search can be achieved. Finally, the organizational semantic P2P network and Chord algorithm are extended to construct the experiment environment on the foundation of Edutella structure. The experiment shows that the success probability and searching efficiency are improved by constructing the organizational P2P networks based on semantic.
出处 《东南大学学报(自然科学版)》 EI CAS CSCD 北大核心 2008年第A01期335-338,共4页 Journal of Southeast University:Natural Science Edition
基金 国家自然科学基金资助项目(60873203) 河北省科学技术研究与发展计划资助项目(04213529,04213534)
关键词 语义 搜索 超级节点 备用超级节点 相似度 semantics searching super peer standby super peer similarity measurement
  • 相关文献

参考文献8

  • 1Wang J Z, Bhulawala V. Design and implementation of a P2P cooperative proxy cache system [J]. Journal of lnterconnection Networks, 2007, 8(2): 147-162.
  • 2Kevin H, Wu J, John S. On the session lifetime distribution of Gnutella [J]. International Journal of Parallel, Emergent and Distributed Systems, 2008, 23(1): 1-15.
  • 3Cohen E, Fiat A, Kaplan H. Associative search in peer to peer networks: harnessing latent semantics [J]. Computer Networks, 2007, 51(8): 1861-1881.
  • 4Stoica I, Morris R, Karger D, et al. Chord: a scalable peer-to-peer lookup service for intemet applications [C]// Proceeding of the ACM SIGCOMM Conference. San Diego, CA, 2001: 149-160.
  • 5Francis D H, Madria S, Sabharwal C. A scalable constraint-based Q-hash indexing for moving objects [J]. Information Sciences, 2008, 178(6): 1442-1460.
  • 6Kontopoulos E, Bassiliades N, Antoniou G. Deploying defeasible logic rule bases for the semantic web [J]. Data & Knowledge Engineering, 2008, 66(1): 116-146.
  • 7Dzbor M, Stutt A, Motta E, et al. Representations for semantic learning webs: semantic Web technology in learning support [J]. Journal of Computer Assisted Learning, 2007, 23(1): 69-82.
  • 8Nejdl W, Wolpers M, Siberski W, et al. Super-peer-based routing strategies for RDF-based peer-to-peer networks [J]. Web Semantics: Science, Services and Agents on the World Wide Web, 2004, 1(2): 177-186.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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