由于分布式计算环境中数据的分散性,在结构化覆盖网上进行连续查询是一个富有挑战性的工作.本文首次提出基于结构化覆盖网连续top-k联接查询的算法,在对新数据做联接查询前,通过预计算排序函数的估值,对不可能最终影响top-k结果的数据裁剪,达到减少网络流量和计算负载目的.实验证明,这种方法在保证更多的节点参与到查询同时,能有效降低网络流量. Due to the scattered data in distributed computing environment, continuous query on structured overlay network is a challenging task.This paper first presents an algorithm based on structured overlay top-k continuous query, in the new data connection Before the query, we can reduce the network traffic and calculate the load by pre-calculating the evaluation function of the sorting function and cutting the data that can not possibly affect the top-k result.Experiments show that this method can guarantee more nodes to participate in the query , Can effectively reduce network traffic.