Supporting efficient distributed top-k monitoring

  • Authors:

  • Bo Deng;Yan Jia;Shuqiang Yang

  • Affiliations:

  • School of Computer Science, National University of Defense Technology, Changsha, China;School of Computer Science, National University of Defense Technology, Changsha, China;School of Computer Science, National University of Defense Technology, Changsha, China

  • Venue:
  • WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper addresses the efficient processing of distributed top-k monitoring, which is continuously reporting the k largest values according to a user-specified ranking function over distributed data streams. To minimize communication requirements, the necessary data transmitting must be selected carefully. We study the optimization problem of which objects are necessary to be transmitted and present a new distributed top-k monitoring algorithm to reduce communication cost. In our approach, few objects are transmitted for maintaining the top-k set and communication cost is independent of k. We verify the effectiveness of our approach empirically using both real-world and synthetic data sets. We show that our approach reduces overall communication cost by a factor ranging from 2 to over an order of magnitude compared with the previous approach when k is no lees than 10.