By Topic

An Approximate Top-k Query Algorithm in Distributed 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
$33 $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)
Wenhua Li ; Key Lab. of Exploration Technol. for Oil & Gas Resources Oil & Gas Resources, Yangtze Univ., Jingzhou, China ; Wenting Yu ; Feng Xiao

In this paper, we propose a variant algorithm Rough Classification based on the Precutting parameter p (RCP). As the distribution of page requests generally follows a Zipf-like distribution, RCP precuts the object by predicting the derived bounds and so that to drop candidate items. By pretreatment, RCP can reduce bandwidth consumption and the run-time cost with high precision in some cases. Furthermore, by performance evaluations using both theoretical analysis and computer simulations, we show that the proposed algorithm can reduce the bandwidth consumption.

Published in:

Computational Intelligence and Natural Computing, 2009. CINC '09. International Conference on  (Volume:2 )

Date of Conference:

6-7 June 2009