An Approximate Top-k Query Algorithm in Distributed Networks

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.