Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/42013
Title: Efficient dynamic operator placement in a locally distributed continuous query system
Authors: Zhou, Y.
Ooi, B.C. 
Tan, K.-L. 
Wu, J.
Issue Date: 2006
Citation: Zhou, Y.,Ooi, B.C.,Tan, K.-L.,Wu, J. (2006). Efficient dynamic operator placement in a locally distributed continuous query system. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4275 LNCS - I : 54-71. ScholarBank@NUS Repository.
Abstract: In a distributed processing environment, the static placement of query operators may result in unsatisfactory system performance due to unpredictable factors such as changes of servers' load, data arrival rates, etc. The problem is exacerbated for continuous (and long running) monitoring queries over data streams as any suboptimal placement will affect the system for a very long time. In this paper, we formalize and analyze the operator placement problem in the context of a locally distributed continuous query system. We also propose a solution, that is asynchronous and local, to dynamically manage the load across the system nodes. Essentially, during runtime, we migrate query operators/fragments from overloaded nodes to lightly loaded ones to achieve better performance. Heuristics are also proposed to maintain good data flow locality. Results of a performance study shows the effectiveness of our technique. © Springer-Verlag Berlin Heidelberg 2006.
Source Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
URI: http://scholarbank.nus.edu.sg/handle/10635/42013
ISBN: 3540482873
ISSN: 03029743
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

77
checked on Aug 19, 2019

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.