Year: 1996
Type: article
Abstract: Given a query, there are many access plans that a database management sys-tem (DBMS) can follow to process it and produce its answer. All plans are equiv-alent in terms of their final output but vary in their cost, that is, the amount of time that they need to run. This cost difference can be several orders of mag-nitude large. Thus all DBMSs have a module that examines “all ” alternatives and chooses the plan that needs the least amount of time. This module is called the query optimizer. Query optimization is a large area within the database field and has been
Source: ACM Computing Surveys
Author: Yannis E. Ioannidis
Institution: University of Wisconsin–Madison
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Funder: National Science Foundation
OpenAlex ID: W2293896416