By Topic

A distributed top-k query algorithm integrated k-Cone structure for DHT overlay 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)
Guimin Huang ; Inf. & Commun. Sch., Guilin Univ. of Electron. Technol., Guilin, China ; Yuhong Liang ; Ya Zhou

The top-k query algorithm is a useful tool to lookup the best k results from candidate dataset for inquiring action. However, majority top-k query algorithms are applied to client/server networks rather than distributed networks specifically DHT overlay networks. This paper thinks about this problem to design a distributed top-k query algorithm for DHT overlay networks. It first constructs a unique k-Cone structure. And then designs a distributed top-k query algorithm for DHT overlay networks. Finally, an effective offset degree method is also applied to a collection of simulating experiments for verifying efficient as well as reliable of designed algorithm in different network scales. Luckily, a series of experiments give a fact that this distributed top-k query algorithm is a kind of efficient and reliable query algorithm in DHT overlay networks.

Published in:

Multimedia Technology (ICMT), 2011 International Conference on

Date of Conference:

26-28 July 2011