Encyclopedia of Database Systems

Living Edition
| Editors: Ling Liu, M. Tamer Özsu


  • Evaggelia Pitoura
Living reference work entry
DOI: https://doi.org/10.1007/978-1-4899-7993-3_872-2


The query execution engine operates on an execution plan produced during query processing which typically is a physical operator graph whose edges specify the dataflow among the operators. There are two basic alternatives for evaluating the execution plan: materialization and pipelining. With materialized evaluation, the results of each operator are created (materialized) and stored in disk and then used as input for the evaluation of the next operator. With pipelining, the results of an operator are passed along as input to the next operator, before the first operator completes its execution. In general, pipelining improves the efficiency of query evaluation by reducing the number of temporary files that are produced.

Key Points

The output of query optimization is an execution plan or operator tree. The execution plan can be thought of as a dataflow graph where the nodes correspond to the physical operators and the edges represent the data flow among these physical...

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. 1993;25(2):73–170.CrossRefGoogle Scholar
  2. 2.
    Silberschatz A, Korth HF, Sudarshan S. Database system concepts. 5th ed. New York: McGraw Hill; 2005.MATHGoogle Scholar

Copyright information

© Springer Science+Business Media LLC 2016

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of IoanninaIoanninaGreece