Query Optimization (in Relational Databases)
- Thomas NeumannAffiliated withMax-Planck Institute for Informatics
Database queries are given in declarative languages, typically SQL. The goal of query optimization is to choose the best execution strategy for a given query under the given resource constraints. While the query specifies the user intent (i.e., the desired output), it does not specify how the output should be produced. This allows for optimization decisions, and for many queries there is a wide range of possible execution strategies, which can differ greatly in their resulting performance. This renders query optimization an important step during query processing.
One of the first papers to discuss query optimization in relational database systems was the seminal System R paper . It introduced a dynamic programming algorithm for optimizing the join order, and coined the concept of interesting orders for exploiting available orderings. Later approaches increased the set of optimized operators ...
Reference Work Entry Metrics
- Query Optimization (in Relational Databases)
- Reference Work Title
- Encyclopedia of Database Systems
- pp 2273-2278
- Print ISBN
- Online ISBN
- Springer US
- Copyright Holder
- Springer Science+Business Media, LLC
- Additional Links
- Industry Sectors
- eBook Packages
- Editor Affiliations
- 1. College of Computing, Georgia Institute of Technology
- 2. Database Research Group David R. Cheriton School of Computer Science, University of Waterloo
- Thomas Neumann (1)
- Author Affiliations
- 1. Max-Planck Institute for Informatics, Saarbrücken, Germany
To view the rest of this content please follow the download PDF link above.