Encyclopedia of Database Systems

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

Query Processing (in Relational Databases)

  • Volker MarklEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_296


Query compilation and execution


Query processing denotes the compilation and execution of a query specification usually expressed in a declarative database query language such as the structured query language (SQL). Query processing consists of a compile-time phase and a runtime phase. At compile-time, the query compiler translates the query specification into an executable program. This translation process (often called query compilation) is comprised of lexical, syntactical, and semantical analysis of the query specification as well as a query optimization and code generation phase. The code generated usually consists of physical operators for a database machine. These operators implement data access, joins, selections, projections, grouping, and aggregation. At runtime, the database engine interprets and executes the program implementing the query specification to produce the query result.

Historical Background

In the 1960s and 1970s, navigational database...

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

Recommended Reading

  1. 1.
    Codd EF. A relational model of data for large shared data banks. Commun ACM. 1970;13(6):377–87.zbMATHCrossRefGoogle Scholar
  2. 2.
    Freytag JC, Maier D, Vossen G. 1994. Query processing for advanced database systems. Morgan Kaufmann.Google Scholar
  3. 3.
    Graefe G. Volcano – an extensible and parallel query evaluation system. IEEE Trans Knowl Data Eng. 1994;6(1):120–35.CrossRefGoogle Scholar
  4. 4.
    Graefe G. Query evaluation techniques for large databases. ACM Comput Surv. 1993;25(2):73–170.CrossRefGoogle Scholar
  5. 5.
    Lorie RA, Fischer NJ. An access specification language for a relational data base system. IBM J Res Dev. 1979;23(3):286–98.zbMATHCrossRefGoogle Scholar
  6. 6.
    Markl V, Haas PJ, Kutsch M, Megiddo N, Srivastava U, Tran TM. Consistent selectivity estimation via maximum entropy. VLDB J. 2007;16(1):55–76.CrossRefGoogle Scholar
  7. 7.
    Selinger PG, Astrahan MM, Chamberlin DD, Lorie RA, Price TG. Access path selection in a relational database management system. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1979. p. 23–34.Google Scholar
  8. 8.
    Yu CT, Meng W. Principles of database query processing for advanced applications. Morgan Kaufmann; 1997.Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.IBM Almaden Research CenterSan JoseUSA

Section editors and affiliations

  • Evaggelia Pitoura
    • 1
  1. 1.Dept. of Computer ScienceUniv. of IoanninaIoanninaGreece