A Popularity-Aware Semantic Overlay for Efficient Peer-to-Peer Search

Citations

WEB OF SCIENCE

1
Citations

SCOPUS

1

초록

This paper presents a novel semantic overlay scheme that connects peers based on the similarity of their contents. Semantic closeness among overlay peers can effectively be determined via the exchanges of their content summary using Bloom filters. The overlay link quality is further improved by carefully selecting semantic neighbors according to their potential to contribute to content- based searches. The basic idea behind the semantic neighbor selection is that highly replicated documents should not excessively dominate the overlay topology, overshadowing rare to modestly-replicated items whose query efficiency is often more critical for overall search performance. The efficacy of the proposed semantic overlay is validated through our simulation study which demonstrates superior overlay link quality and query routing performance.

키워드

computer networksdistributed computingdistributed information systemskeyword searchpeer to peer computingNETWORKS
제목
A Popularity-Aware Semantic Overlay for Efficient Peer-to-Peer Search
저자
Lee, ChoonhwaChoi, JunwanKim, Eunsam
DOI
10.4316/AECE.2014.04016
발행일
2014-11
유형
Article
저널명
Advances in Electrical and Computer Engineering
14
4
페이지
105 ~ 108

파일 다운로드