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

  

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

PDF (PC)

1200

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

No related articles found!
Viewed
Full text
113
HTML PDF
Just accepted Online first Issue Just accepted Online first Issue
0 0 0 0 0 113

  From local
  Times 113
  Rate 100%

Abstract
687
Just accepted Online first Issue
0 0 687
  From Others local
  Times 686 1
  Rate 100% 0%

Cited
Web of Science  Crossref   ScienceDirect  Search for Citations in Google Scholar >>
 
This page requires you have already subscribed to WoS.
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of Journal of Shandong University (Engineering Science)
Supported by Beijing Magtech Co.Ltd