By Topic

A Query Processing Mechanism for Top-k Query in P2P Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Matsunam, H. ; Osaka University ; Terada, T. ; Nishio, S.

Recently, there has been an increasing interest in content sharing on peer-to-peer (P2P) networks. Since such a system employs a flooding mechanism for queries and because each peer returns many search results, the system’s response to a query creates heavy traffic. Therefore, we propose a new and more efficient query processing method for top-k queries on P2P networks. We focus on the fact that users usually need search results only with a higher score. Our method reduces the reply traffic by controlling the number of query replies. Moreover, we evaluate the proposed method by simulation studies.

Published in:

Data Engineering Workshops, 2005. 21st International Conference on

Date of Conference:

05-08 April 2005