纸论述一个新奇好处为有效询问路由的基于的质问处理策略。作为覆盖网络基于 DHT,基于关键词的关联构造最佳的同伴组首先使用纳什平衡;范围;到时间花费了的减少的同伴的重叠,;然后介绍二分层的体系结构因为处理那的质问作为紧缩的表示利用花蕾过滤器减少带宽消费。在真实世界数据集上进行的广泛的实验证明了我们的途径显然减少处理时间,当时改进精确;也记起。
The paper presents a novel benefit based query processing strategy for efficient query routing. Based on DHT as the overlay network, it first applies Nash equilibrium to construct the optimal peer group based on the correlations of keywords and coverage and overlap of the peers to decrease the time cost, and then presents a two-layered architecture for query processing that utilizes Bloom filter as compact representation to reduce the bandwidth consumption. Extensive experiments conducted on a real world dataset have demonstrated that our approach obviously decreases the processing time, while improves the precision and recall as well.