%0 Journal Article
%A LI Lei
%A LI Xiao-dong
%A LIU Xin-yang
%T FT：Efficient top-*k* algorithm in distributed networks
%D 2010
%R 10.3778/j.issn.1002-8331.2010.18.029
%J Computer Engineering and Applications
%P 89-92
%V 46
%N 18
%X A new algorithm FT to answer top-k queries（find the k objects with the highest aggregate scores） in a distributed network is proposed.Prior research such as Threshlod Algorithm（TA），Three-Phase Uniform-Threshold（TPUT） algorithm and Hybrid-Threshold（HT） algorithm consume an excessive amount of bandwidth.KLEE algorithm can reduce network bandwidth consumption but it can’t give exact top-k answers.The algorithm FT can both reduce network bandwidth and give the exact top-k answer based on the pretreatment in the first phase and the histogram bloom.This paper implements FT and related algorithms and conducts a comprehensive performance evaluation.Evaluation employs real-world and synthetic data sets.The experiment shows that FT can achieve major performance in terms of network bandwidth.
%U http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2010.18.029