Advertisement

Gscheduler: A Query Scheduler Based on Query Interactions

  • Muhammad AmjadEmail author
  • Jinwen Zhang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11242)

Abstract

The workload in a database system encompasses cluster of multiple queries running concurrently. The requirement of business is that the workload which consists of different mixes of queries should complete within a short period. We propose a scheduler called Gscheduler, which schedules queries to form good queries mixes in order to finish the workload quickly. The rationale is that a query mix consisting of multiple queries that interact each other and the interactions can significantly delay or accelerate the execution of the mix. We propose a notion called mix rating to measure query interactions in a mix, which is used to differentiate good mixes from bad mixes. Experimental results show the effectiveness of the scheduler.

Keywords

Query interactions Workload management Query scheduler Performance management 

Notes

Acknowledgment

This work is supported by the National Natural Science Foundation of China under contract #61572345.

References

  1. 1.
    Zhang, J., Niu, B.: A clustering-based sampling method for building query response time model. Comput. Syst. Sci. Eng. 32(4), 319–331 (2017)Google Scholar
  2. 2.
    Ahmad, M., Aboulnaga, A., Babu, S., Munagala, K.: Modeling and exploiting query interactions in database systems. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management (CIKM), pp. 183–192. ACM, New York (2008)Google Scholar
  3. 3.
    Kelly, T.: Detecting performance anomalies in global applications. In: Proceedings of Second Workshop on Real, Large Distributed Systems (WORLDS), San Francisco (2005)Google Scholar
  4. 4.
    Ibaraki, T., Kameda, T., Katoh, N.: Cautious transaction schedulers for database concurrency control. IEEE Trans. Softw. Eng. 14(7), 997–1009 (1988)CrossRefGoogle Scholar
  5. 5.
    Katoh, N., Ibaraki, T., Kameda, T.: Cautious transaction schedulers with admission control. Trans. Database Syst. 10(2), 205–229 (1985)CrossRefGoogle Scholar
  6. 6.
    Duggan, J., Çetintemel, U., Papaemmanouil, O., Upfal, E.: Performance prediction for concurrent database workloads. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 337–348. ACM, New York (2011)Google Scholar
  7. 7.
    Ahmad, M., Aboulnaga, A., Babu, S., Munagala, K.: Interaction-aware scheduling of report generation workload. Int. J. Very Large Data Bases 20(4), 589–615 (2011)CrossRefGoogle Scholar
  8. 8.
    Tozer, B., Brecht, T., Aboulnaga, A.: Q-Cop: avoiding bad query mixes to minimize client timeouts under heavy loads. In: Proceedings of the 26th International Conference on Data Engineering, pp. 397–408. IEEE Computer Society, Long Beach (2010)Google Scholar
  9. 9.
    Mozafari, B., Curino, C., Jindal, A., Madden, S.: Performance and resource modeling in highly-concurrent OLTP workloads. In: Proceedings of the ACM SIGMOD/PODS Conference, pp. 301–312. ACM, New York (2013)Google Scholar
  10. 10.
    Akdere, M., Çetintemel, U., Riondato, M., Upfal, E.: Learning-based query performance modeling and prediction. In: Proceedings of 28th International Conference on Data Engineering, 2012, pp. 390–401. IEEE Computer Society, Washington, DC (2012)Google Scholar
  11. 11.
    Ganapathi, A., Kuno, H.A., Dayal, U., Wiener, J.L.: Predicting multiple metrics for queries: better decisions enabled by machine learning. In: Proceedings of the 25th International Conference on Data Engineering, pp. 592–603. IEEE Computer Society, Shanghai (2009)Google Scholar
  12. 12.
    Baoning, N., Patrick, M., Wendy, P., Paul, B.: Adapting mixed workloads to meet SLOs in autonomic DBMSs. In: Proceeding of the 23rd International Conference on Data Engineering Workshops, pp. 478–484. IEEE Computer Society, Istanbul (2007)Google Scholar
  13. 13.
    Marcus, R., Papaemmanouil, O.: WiSeDB: a learning-based workload management advisor for cloud databases. Proc. VLDB Endow. 9(10), 780–791 (2016)CrossRefGoogle Scholar
  14. 14.
    Elnikety, S., Nahum, E., Tracey, J., Zwaenepoel, W.: A method for transparent admission control and request scheduling in e-commerce web sites. In: Proceedings of the 13th International Conference on World Wide Web, New York, NY, USA, pp. 276–286 (2004)Google Scholar
  15. 15.
    Ryser, H.: Combinatorial Mathematics (14), p. 154. The Mathematical Association of America (1963)Google Scholar
  16. 16.
    Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)zbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Taiyuan University of TechnologyJinzhongChina

Personalised recommendations