Efficient dynamic operator placement in a locally distributed continuous query system

38Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Zhou, Y., Ooi, B. C., Tan, K. L., & Wu, J. (2006). Efficient dynamic operator placement in a locally distributed continuous query system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4275 LNCS-I, pp. 54–71). Springer Verlag. https://doi.org/10.1007/11914853_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free