ACM Home Page
Please provide us with feedback. Feedback
Speed up semantic search in p2p networks
Full text PdfPdf (195 KB)
Source
Conference on Information and Knowledge Management archive
Proceeding of the 17th ACM conference on Information and knowledge management table of contents
Napa Valley, California, USA
POSTER SESSION: Poster session 1/information retrieval table of contents
Pages 1341-1342  
Year of Publication: 2008
ISBN:978-1-59593-991-3
Authors
Qiang Wang  University of Waterloo, Waterloo, Canada
Rui Li  Hong Kong University of Science and Technology, Hong Kong, China
Lei Chen  Hong Kong University of Science and Technology, Hong Kong, China
Jie Lian  University of Waterloo, Waterloo, Canada
M. Tamer Özsu  Univeresity of Waterloo, Waterloo, Canada
Sponsors
ACM: Association for Computing Machinery
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 18,   Downloads (12 Months): 71,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1458082.1458269
What is a DOI?

ABSTRACT

Peer-to-peer architectures become popular in modern massively distributed systems, which are often in very large scale and contain a huge volume of heterogeneous data. To facilitate the information retrieval process in P2P networks, we consider semantic search approach, where syntax-based queries are shipped to peers based on semantic correlations. Motivated by an interesting experience in Web information retrieval, we propose a novel ontology-based scheme to measure similarity of peer interests accurately and consistently in a decentralized way, and group peers under a scalable hierarchical overlay network. Given queries, our approach either floods them within local peer groups or guides them towards remote groups based on the similarity of interests. Our work overcomes the limitations of the existing P2P hybrid-search approaches by avoiding costly data popularity measurement. Performance evaluation and comparison against baseline algorithms show that our approach provides a better solution for information retrieval in large-scale P2P networks.



Collaborative Colleagues:
Qiang Wang: colleagues
Rui Li: colleagues
Lei Chen: colleagues
Jie Lian: colleagues
M. Tamer Özsu: colleagues