Exploiting semantics in unstructured peer-to-peer networks

被引:0
作者
Nakauchi, K [1 ]
Ishikawa, Y
Morikawa, H
Aoyama, T
机构
[1] Commun Res Labs, Koganei, Tokyo 1848795, Japan
[2] Univ Tokyo, Sch Engn, Tokyo 1138656, Japan
[3] Univ Tokyo, Sch Frontier Sci, Tokyo 1138656, Japan
[4] Univ Tokyo, Sch Informat Sci & Technol, Tokyo 1138656, Japan
关键词
peer-to-peer network; distributed keyword search; semantic search;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Decentralized and unstructured peer-to-peer (P2P) networks such as Gnutella are attractive for large-scale information retrieval and search systems because of their scalability, fault-tolerance, and self-organizing nature. Because of this decentralized architecture, however, traditional P2P keyword search systems are difficult to globally share useful semantic knowledge among nodes. As a result, traditional P2P keyword search systems cannot support semantic search (support only naive text-match search). In this paper, we describe a design of the semantic P2P keyword search system. We exploit the semantics of correlation among keywords rather than synonym. The key mechanism is query expansion, where a received query is expanded based on keyword relationships. Keyword relationships are improved through search and retrieval processes and each relationship is shared among nodes holding similar data items. This semantic P2P search system has two main advantages. First, expanding search results through query expansion increases the possibility of locating desired data items which would not be found by traditional P2P search systems due to the keywords' textual mismatch. Second, keyword relationships originally introduced for query expansion, can be used for result ranking. Our main challenges are 1) managing keyword relationships in a fully decentralized manner and 2) maintaining the quality of search results, while suppressing result implosion. We also describe the prototype implementation and evaluation of the semantic P2P search system.
引用
收藏
页码:1806 / 1817
页数:12
相关论文
共 50 条
[41]   Analyzing Impacts of Software Diversity on Worm Propagation in Peer-to-Peer Networks [J].
Zhou, Ying ;
Wu, Zhong-fu ;
Li, Feng ;
Wang, Hao ;
Zhu, Zheng-zhou .
INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2006, 6 (2B) :219-225
[42]   Introducing artificial evolution into peer-to-peer networks with the distributed remodeling framework [J].
Michele Amoretti .
Genetic Programming and Evolvable Machines, 2013, 14 :127-153
[43]   Taking a free ride for routing topology inference in peer-to-peer networks [J].
Peng Qin ;
Bin Dai ;
Guan Xu ;
Kui Wu ;
Benxiong Huang .
Peer-to-Peer Networking and Applications, 2016, 9 :1047-1059
[44]   Super-proximity routing in structured peer-to-peer overlay networks [J].
Wu Zeng-de ;
Rao Wei-xiong ;
Ma Fan-yuan .
Journal of Zhejiang University-SCIENCE A, 2004, 5 (1) :16-21
[45]   Self-Organizing scale free topology for Peer-to-Peer networks [J].
Eum, Suyong ;
Arakawa, Shin'ichi ;
Murata, Masayuki .
2009 IEEE GLOBECOM WORKSHOPS, 2009, :562-567
[46]   Design and analysis of parallel file downloading algorithms in peer-to-peer networks [J].
Li, Keqin .
TELECOMMUNICATION SYSTEMS, 2017, 64 (04) :719-734
[47]   Software Bug Ontology Supporting Bug Search on Peer-to-Peer Networks [J].
Ha Manh Tran ;
Son Thanh Le ;
Synh Viet Uyen Ha ;
Tu Kha Huynh .
ADVANCED METHODS AND TECHNOLOGIES FOR AGENT AND MULTI-AGENT SYSTEMS, 2013, 252 :213-222
[48]   A unified trust management strategy for content sharing in Peer-to-Peer networks [J].
Anand, P. M. Rubesh ;
Bhaskar, Vidhyacharan .
APPLIED MATHEMATICAL MODELLING, 2013, 37 (04) :1992-2007
[49]   Survey of research towards robust peer-to-peer networks: Search methods [J].
Risson, John ;
Moors, Tim .
COMPUTER NETWORKS, 2006, 50 (17) :3485-3521
[50]   DHTrust: a robust and distributed reputation system for trusted peer-to-peer networks [J].
Xue, Weilian ;
Liu, Yaqiong ;
Li, Keqiu ;
Chi, Zhongxian ;
Min, Geyong ;
Qu, Wenyu .
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2012, 24 (10) :1037-1051