Encyclopedia of Database Systems

2009 Edition

Query Plan

Reference work entry
DOI: https://doi.org/10.1007/978-0-387-39940-9_864



A query or execution plan for a query specifies precisely how the query is to be executed. Most often, the plan for a query is represented as a tree whose internal nodes are operators and its leaves correspond to the input relations of the query. The edges of the tree indicate the data flow among the operators. The query plan is executed by the query execution engine.

Key Points

During query processing, an input query is transformed into an internal representation, most often, into a relational algebra expression. To specify how to evaluate a query precisely, each relational operator is then mapped to one or more physical operators, which provide several alternative implementations of relational operators.

A query plan for each query specifies the physical operators to be used for its execution and the order of their invocation. Most commonly, a query plan is represented as a tree....

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

Recommended Reading

  1. 1.
    Graefe G. Query evaluation techniques for large databases. ACM Comput. Surv., 25(2):73–170, 1993.Google Scholar
  2. 2.
    Ramakrishnan R. and Gehrke J. Database Management Systems. McGraw-Hill, New York, 2003.zbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.University of IoanninaIoanninaGreece