Premium
Trust‐aware query routing in P2P social networks
Author(s) -
Wang Qingjie,
Wang Jianrong,
Yu Jian,
Yu Mei,
Zhang Yan
Publication year - 2012
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.1320
Subject(s) - computer science , semantic query , web search query , sargable , query expansion , set (abstract data type) , routing (electronic design automation) , bloom filter , query optimization , scheme (mathematics) , information retrieval , exploit , world wide web , computer security , computer network , search engine , mathematical analysis , mathematics , programming language
SUMMARY Query efficiency is a significant challenge in peer‐to‐peer (P2P) social networks. In this paper, we build a trust‐aware semantic‐based query routing strategy to improve the searching efficiency and enhance the security. Based on the vector space model, similar semantic ordinary peers set up an unstructured semantic social community. Super peers in each community constitute a structured P2P network and store the keywords information in a global inverted file. We exploit Bloom filters to complete multikeyword query. Furthermore, malicious behaviors may take place in P2P social networks. We then build a community‐based trust mechanism. The intracommunity reputations of ordinary peers in a semantic social community are calculated, and the intercommunity reputations of super peers in the structured P2P network are evaluated. This mechanism combines the local trust and the global trust. The results show that the proposed query scheme is able to increase query efficiency and also decrease query cost with significantly reduced malicious behaviors. Copyright © 2011 John Wiley & Sons, Ltd.