基于结构化覆盖网的连续top-k联接查询算法  

Algorithms of continuous top-k join query over structured overlay networks

作　　者：赵科军[1,2] 王新军[1,2] 刘洋[2] 仇一泓[2] 

机构地区：[1]山东大学计算机科学与技术学院,山东济南250101 [2]山东大学网络信息中心,山东济南250100

出　　处：《山东大学学报（工学版）》2009年第5期32-37,57,共7页Journal of Shandong University（Engineering Science）

摘　　要：由于分布式计算环境中数据的分散性,在结构化覆盖网上进行连续查询是一个富有挑战性的工作.本文首次提出基于结构化覆盖网连续top-k联接查询的算法,在对新数据做联接查询前,通过预计算排序函数的估值,对不可能最终影响top-k结果的数据裁剪,达到减少网络流量和计算负载目的.实验证明,这种方法在保证更多的节点参与到查询同时,能有效降低网络流量.It is challenging to process continuous queries over structured overlay networks due to the distribution characteristic of the environment. An algorithm based on top-k join queries over structured overlay networks is presented. In the proposed algorithms, the data that can not contribute the finale top-k results was discarded based on the pre-computing results of ranked functions. The performance of the algorithms was analyzed. Our algorithms reduced the network traffic while more nodes participate in the query process.

关 键 词：对等网 结构化覆盖网 连续查询 TOP-K 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]