By Topic

A Novel Top-k Query Scheme in Unstructured 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)
Zhitao Guan ; Sch. of Comput. Sci. & Technol., North China Electr. Power Univ., Beijing, China ; Guangwei Yan ; Heqing Huang

There're two major problems in the unstructured p2p systems, one is their heavy network traffic; the other is the problem of query effectiveness, which is caused mainly by high numbers of query answers, many of which are irrelevant for users. A potential solution is to use Top-k queries. The objective of a top-k query is to find the k highest ranked answers to the user defined similarity function. Top-k query is widely used in the search engine and gains great success. However, processing top-k query in unstructured p2p network is very challenging because a p2p system is a dynamic and decentralized system. In this paper we present HPJT, a novel P2p Hierarchical Join Top-k query scheme. A fully distributed query processing algorithm for top-k query is proposed, of which the key idea is `put computation to the network'. The simulation results indicate that HPJT shows good performance.

Published in:

Computer and Information Technology, 2009. CIT '09. Ninth IEEE International Conference on  (Volume:2 )

Date of Conference:

11-14 Oct. 2009