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

JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE) ›› 2009, Vol. 39 ›› Issue (5): 32-37.

• Articles • Previous Articles Next Articles

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

ZHAO Ke-Jun, WANG Xin-Jun：School of Computer Science and Technology, Shandong University, Jinan 250101, China；  ZHAO Ke-Jun, WANG Xin-Jun, LIU Xiang, CHOU Yi-Hong：Network Center of Shandong University, Jinan 250100， China

Received:2008-12-18 Online:2009-10-16 Published:2009-10-16

Abstract

Abstract:

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.

Key words: structured overlay network; continuous query; top-k

ZHAO Ke-Jun, WANG Xin-Jun, LIU Xiang, CHOU Yi-Hong. Algorithms of continuous top-k join query over structured overlay networks[J].JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2009, 39(5): 32-37.