Encyclopedia of Database Systems

2009 Edition
| Editors: LING LIU, M. TAMER ÖZSU

Query Load Balancing in Parallel Database Systems

  • Luc Bouganim
Reference work entry
DOI: https://doi.org/10.1007/978-0-387-39940-9_1080

Synonyms

Definition

The goal of parallel query execution is minimizing query response time using inter- and intra-operator parallelism. Inter-operator parallelism assigns different operators of a query execution plan to distinct (sets of) processors while intra-operator parallelism uses several processors for the execution of a single operator thanks to data partitioning. Conceptually, parallelizing a query amounts to divide the query work in small pieces or tasks assigned to different processors. The response time of a set of parallel tasks being that of the longest one, the main difficulty is to produce and execute these tasks such that the query load is evenly balanced within the processors. This is made more complex by the existence of dependencies between tasks (e.g., pipeline parallelism) and synchronizations points. Query load balancing relates to static and/or dynamic techniques and algorithms to balance the query load within the processors so that the...

This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Bouganim L., Florescu D., and Valduriez P. 1996, Dynamic load balancing in hierarchical parallel database systems. In Proc. 22th Int. Conf. on Very Large Data Bases, pp. 436–447.Google Scholar
  2. 2.
    Brunie L. and Kosch H. Control strategies for complex relational query processing in shared nothing systems. ACM SIGMOD Rec., 25(3):34–39, 1996.Google Scholar
  3. 3.
    DeWitt D.J., Naughton J.F., Schneider D.A., and Seshadri S. 1992, Practical skew handling in parallel joins. In Proc.18th Int. Conf. on Very Large Data Bases, pp. 27–40.Google Scholar
  4. 4.
    Hong W. Exploiting inter-operation parallelism in XPRS. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1992, pp. 19–28.Google Scholar
  5. 5.
    Hsiao H., Chen M.S., and Yu P.S. On parallel execution of multiple pipelined hash joins. In Proc. ACM SIGMOD Int. Conf. on Management of Data, ACM, New York, pp. 185–196.1994,Google Scholar
  6. 6.
    Kitsuregawa M. and Ogawa Y. 1990, Bucket spreading parallel hash: a new, robust, parallel hash join method for data skew in the super database computer. In Proc. 16th Int. Conf. on Very Large Data Bases, pp. 210–221.Google Scholar
  7. 7.
    Lakshmi M.S. and Yu P.S. Effect of skew on join performance in parallel architectures. In Int. Symp. Databases in Parallel and Distributed Systems, Austin, TX, pp. 107–120.1988,Google Scholar
  8. 8.
    Lynch C. 1988, Selectivity estimation and query optimization in large databases with highly skewed distributions of column values. In Proc. 14th Int. Conf. on Very Large Data Bases, pp. 240–251.Google Scholar
  9. 9.
    Metha M. and DeWitt D. Managing intra-operator parallelism in parallel database systems. In Proc. 21th Int. Conf. on Very Large Data Bases, Morgan Kaufmann, San Francisco, CA, pp. 382–394.1995,Google Scholar
  10. 10.
    Özsu T. and Valduriez P. Principles of Distributed Database Systems (2nd edn.). Prentice Hall, 1999 (3rd edn., forthcoming).Google Scholar
  11. 11.
    Rahm E. and Marek R. 1995.Dynamic multi-resource load balancing in parallel database systems. In Proc. 21th Int. Conf. on Very Large Data Bases,Google Scholar
  12. 12.
    Shekita E.J. and Young H.C. 1993, Multi-join optimization for symmetric multiprocessor. In Proc. 19th Int. Conf. on Very Large Data Bases, pp. 479–492.Google Scholar
  13. 13.
    Walton C.B., Dale A.G., and Jenevin R.M. 1991, A taxonomy and performance model of data skew effects in parallel joins. In Proc. 17th Int. Conf. on Very Large Data Bases, pp. 537–548.Google Scholar
  14. 14.
    Wolf J.L., Dias D.M., Yu P.S., Turek J. New Algorithms for parallelizing relational database joins in the presence of data skew. IEEE Trans. Knowl. Data Eng., 6(6):990–997, 1994.Google Scholar
  15. 15.
    Wilshut N., Flokstra J., and Apers P.G. 1995, Parallel evaluation of multi-join queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 115–126.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  • Luc Bouganim
    • 1
  1. 1.INRIARocquencourt, Lechesnay CedexFrance