Threshold-Based Distributed Continuous Top-k Query Processing for Minimizing Communication Overhead

DOI Web Site 17 References
  • UDOMLAMLERT Kamalas
    Graduate School of Information Science and Technology, Osaka University
  • HARA Takahiro
    Graduate School of Information Science and Technology, Osaka University
  • NISHIO Shojiro
    Graduate School of Information Science and Technology, Osaka University

Abstract

In this paper, we propose a communication-efficient top-k continuous query processing method on distributed local nodes where data are horizontally partitioned. A designated coordinator server takes the role of issuing queries from users to local nodes and delivering the results to users. The final results are requested via a top-k subscription which lets local nodes know which data and updates need to be returned to users. Our proposed method makes use of the active previously posed queries to identify a small set of needed top-k subscriptions. In addition, with the pre-indexed nodes' skylines, the number of local nodes to be subscribed can be significantly reduced. As a result, only a small number of subscriptions are informed to a small number of local nodes resulting in lower communication overhead. Furthermore, according to dynamic data updates, we also propose a method that prevents nodes from reporting needless updates and also maintenance procedures to preserve the consistency. The results of experiments that measure the volume of transferred data show that our proposed method significantly outperforms the previously proposed methods.

Journal

References(17)*help

See more

Related Projects

See more

Keywords

Details 詳細情報について

Report a problem

Back to top