Abstract
Existing query scheduling strategies over data streams mainly focus on metrics in terms of system performance, such as processing time or memory overhead. However, for commercial stream applications, what actually matters most is the users’ satisfaction about the Quality of Service (QoS) they perceive. Unfortunately, a system-oriented optimization strategy does not necessarily lead to a high degree of QoS. Motivated by this, we study QoS-oriented query scheduling in this paper. One important contribution of this work is that we correlate the operator scheduling problem with the classical job scheduling problem. This not only offers a new angle in viewing the issue but also allows techniques for the well studied job scheduling problems to be adapted in this new context. We show how these two problems can be related and propose a novel operator scheduling strategy inspired by job scheduling algorithms. The performance study demonstrates a promising result for our proposed strategy.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Babcock, B., Babu, S., Datar, M., Motwani, R.: Chain: Operator Scheduling for Memory Minimization in Data. In: SIGMOD, pp. 253–264 (2003)
Babu, S., Srivastava, U., Widom, J.: Exploiting k-constraints to reduce memory overhead in continuous queries over data streams. ACM Trans. Database Syst. 29(3), 545–580 (2004)
Carney, D., Çetintemel, U., Rasin, A., Zdonik, S.B., Cherniack, M., Stonebraker, M.: Operator Scheduling in a Data Stream Manager. In: VLDB, pp. 838–849 (2003)
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey. Annals of Discrete Mathematics 5, 287–326 (1979)
Jiang, Q., Chakravarthy, S.: Scheduling strategies for processing continuous queries over streams. In: Williams, H., MacKinnon, L.M. (eds.) BNCOD 2004. LNCS, vol. 3112, pp. 16–30. Springer, Heidelberg (2004)
Karp, R.M.: Reducibility among Combinatorial Problems. In: Complexity of Computer Computations, pp. 85–103. Plenum, New York (1972)
Lawler, E.L.: Sequencing to minimize the weighted number of tardy jobs. RAIRO Operations Research 10, 27–33 (1976)
Lawler, E.L., Moore, J.: A functional equation and its application to resource allocation and sequencing problems. Management Science 16, 77–84 (1969)
Péridy, L., Pinson, E., Rivreau, D.: Using short-term memory to minimize the weighted number of late jobs on a single machine. European Journal of Operational Research 148(3), 591–603 (2003)
Sharaf, M.A., Chrysanthis, P.K., Labrinidis, A., Pruhs, K.: Efficient Scheduling of Heterogeneous Continuous Queries. In: VLDB, pp. 511–522 (2006)
Stankovic, J.A., Spuri, M., Rmamritham, K., Buttazzo, G.C.: Deadline Scheduling for Real-time Systems - EDF and Related Algorithms. Kluwer Academic Publishers, Norwell (1998)
Urhan, T., Franklin, M.J.: Dynamic Pipeline Scheduling for Improving Interactive Query Performance. In: VLDB, pp. 501–510 (2001)
Wu, J., Tan, K.L., Zhou, Y.: QoS-Oriented Multi-Query Scheduling over Data Streams. Technical Report (2008), http://www.comp.nus.edu.sg/~wuji/TR/QoS.pdf
Wu, J., Tan, K.L., Zhou, Y.: Window-Oblivious Join: A Data-Driven Memory Management Scheme for Stream Join. In: SSDBM Conference, 21 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, J., Tan, KL., Zhou, Y. (2009). QoS-Oriented Multi-query Scheduling over Data Streams. In: Zhou, X., Yokota, H., Deng, K., Liu, Q. (eds) Database Systems for Advanced Applications. DASFAA 2009. Lecture Notes in Computer Science, vol 5463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00887-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-00887-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00886-3
Online ISBN: 978-3-642-00887-0
eBook Packages: Computer ScienceComputer Science (R0)