Dynamic query evaluation plans
- 1 June 1989
- journal article
- conference paper
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 18 (2), 358-366
- https://doi.org/10.1145/66926.66960
Abstract
In most database systems, a query embedded in a program written in a conventional programming language is optimized when the program is compiled. The query optimizer must make assumptions about the values of the program variables that appear as constants in the query, the resources that can be committed to query evaluation, and the data in the database. The optimality of the resulting query evaluation plan depends on the validity of these assumptions. If a query evaluation plan is used repeatedly over an extended period of time, it is important to determine when reoptimization is necessary. Our work aims at developing criteria when reoptimization is required, how these criteria can be implemented efficiently, and how reoptimization can be avoided by using a new technique called dynamic query evaluation plans . We experimentally demonstrate the need for dynamic plans and outline modifications to the EXODUS optimizer generator required for creating dynamic query evaluation plans.Keywords
This publication has 16 references indexed in Scilit:
- Statistical profile estimation in database systemsACM Computing Surveys, 1988
- Query optimization in object-oriented database systems: A prospectusLecture Notes in Computer Science, 1988
- A general framework for computing block accessesInformation Systems, 1987
- R* optimizer validation and performance evaluation for local queriesPublished by Association for Computing Machinery (ACM) ,1986
- Estimating block selectivitiesInformation Systems, 1984
- Estimating record selectivitiesInformation Systems, 1983
- Support for repetitive transactions and ad hoc queries in System RACM Transactions on Database Systems, 1981
- Optimization of query evaluation algorithmsACM Transactions on Database Systems, 1979
- Prolog - the language and its implementation compared with LispPublished by Association for Computing Machinery (ACM) ,1977
- Decomposition—a strategy for query processingACM Transactions on Database Systems, 1976