Skip to main content

Query Processing (in Relational Databases)

  • Reference work entry
  • First Online:
  • 71 Accesses

Synonyms

Query compilation and execution

Definition

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 via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   6,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Recommended Reading

  1. Codd EF. A relational model of data for large shared data banks. Commun ACM. 1970;13(6):377–87.

    Article  MATH  Google Scholar 

  2. Freytag JC, Maier D, Vossen G. 1994. Query processing for advanced database systems. Morgan Kaufmann.

    Google Scholar 

  3. Graefe G. Volcano – an extensible and parallel query evaluation system. IEEE Trans Knowl Data Eng. 1994;6(1):120–35.

    Article  Google Scholar 

  4. Graefe G. Query evaluation techniques for large databases. ACM Comput Surv. 1993;25(2):73–170.

    Article  Google Scholar 

  5. Lorie RA, Fischer NJ. An access specification language for a relational data base system. IBM J Res Dev. 1979;23(3):286–98.

    Article  MATH  Google Scholar 

  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.

    Article  Google Scholar 

  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. Yu CT, Meng W. Principles of database query processing for advanced applications. Morgan Kaufmann; 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Volker Markl .

Editor information

Editors and Affiliations

Section Editor information

Rights and permissions

Reprints and permissions

Copyright information

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

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Markl, V. (2018). Query Processing (in Relational Databases). In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_296

Download citation

Publish with us

Policies and ethics