基于不确定数据的分布式Top-k查询算法

目前基于不确定数据的Top-k查询算法仅考虑了集中式的环境,为了解决分布式系统中节省系统带宽的问题,在此基础上,提出了在分布式环境中基于不确定数据的Top-k查询算法UDTopk.该算法定义了一个候选集(candidate set),仅使用候选集中的数据,而不用访问数据集中所有数据,就可以得到正确的Top-k查询答案.算法通过动态维护候选集、仅传输少量数据,达到减少网络中数据传输的目的.实验结果表明,该算法可以有效地节省网络带宽.

Distributed Top-k Query Algorithm Based on Uncertain Data

Top-k query based on uncertain data has quickly attracted a lot of interested users,however,none of them has addressed himself to that the algorithm works in a distributed setting.A distributed Top-k algorithm based on uncertain data(UDTopk) is therefore presented to save the communication bandwidths.A data structure called candidate set is designed and proposed,where only the minimum amount of data is contained and the tuples that have been removed from the set will not affect the answer to a Top-k query.T...