P2P环境中不确定数据Top-k查询处理算法

近年来随着P2P技术的日益发展,P2P环境中的Top-k查询处理技术也越来越成熟.但是,自从不确定数据在数据库的各个领域受到广泛重视,这就引发了学术界和工业界对研发新型的不确定性数据管理技术的兴趣.所以在P2P环境中对不确定数据进行Top-k查询处理就成为了一个新的挑战.主要研究P2P环境下的不确定数据Top-k查询处理技术.首先给出了在不确定数据集上的Top-k查询的定义;然后,以Chord拓扑为例阐述了在P2P环境中对不确定数据的Top-k查询处理算法,并且在保序散列的基础上提出了基于upper-bound的剪枝策略及其改进的路由剪枝策略;最后,通过大量的实验来验证了所提出算法的性能.

P2P Top-k Query Processing Algorithms over Uncertain Data

With the increasing development of P2P technologies in recent years,P2P top-k query processing has become a more and more mature technology.However,since the uncertain data gained extensively attention in various fields of database,it has aroused some research interests on managing uncertain data in both the academic and industry communities.P2P top-k query processing over uncertain data is thus becoming a new challenge.In this paper,the definition of P2 P top-k query is given,and then a novel P2P top-k query processing algorithm is proposed,which takes the chord topology as an example.Moreover,upper-bound based pruning strategy and corresponding improved strategy are proposed on the basis of locality-preserving hasing.Finally,extensive experiments are conducted to show the effectiveness and efficiency of the proposed algorithms.