在这篇论文,我们为在分布式的网络优化 top-k 质问建议一个基于过滤器的一致算法(FbUA ) ,它是许多最近的兴趣的一个话题。FbUA 的 Thebasic 想法是在每个节点设置一个过滤器阻止它与贡献 top-k 结果的小机会发送数据。FbUA 能通过在质问车站和参加者节点之间的双程的通讯的二个短语获得准确答案到 top-k 质问。实验结果证明 FbUA 还原剂戏剧性地联网带宽消费。
In this paper we propose a Filter-based Uniform Algorithm (FbUA) for optimizing top-κ query in distributed networks, which has been a topic of much recent interest. The basic idea of FhUA is to set a filter at each node to pre vent it from sending out the data with little chance to contrib ute to the top-κ result. FbUA can gain exact answers to top-κ query through two phrases of round trip communications between query station and participant nodes. The experiment results show that FbUA reduces network bandwidth consumption dramatically.