Determining validity ranges of query plans based on suboptimality
AssigneeInternational Business Machines Corporation
InventorsVolker G. Markl, Vijayshankar Raman
Life of this patent
Estimating the term…
Loading patent…
AssigneeInternational Business Machines Corporation
InventorsVolker G. Markl, Vijayshankar Raman
Estimating the term…
“Determining Validity Ranges of Query Plans Based on Suboptimality” A method for approximating a validity range for a domain of cardinalities of input to an optimal query plan is provided. Such a validity range is iteratively approximated using a modified Newton-Raphson method to find roots of cost functions for optimal and alternative query plans, respectively. The Newton-Raphson method is combined with a method of incrementing roots of cost functions, known as input cardinalities, such that discontinuous and non-differentiable points in cost functions are avoided. In this manner, input cardinalities remain within a domain for which a valid range can be specified. Additionally, a robustness measure is determined by a sensitivity analysis performed on an approximated validity range. Using a robustness measure provided by a sensitivity analysis and resultant validity range and, query plan sub-optimality detection is simplified, re-optimization is selectively triggered, and robustness information is provided to a system or user performing corrective actions.
A method for selecting an optimal query plan for the execution of a database query, said method comprising:
A method for determining the sensitivity of a first query plan chosen by a database query optimizer to input row cardinality values inaccurately estimated by a database query execution cost model, said method comprising:
A method for iteratively refining the sensitivity of a first query plan to inaccurate input cardinality values estimated by a database query execution cost model, said sensitivity iteratively refined from an initial approximation of a validity range for bounding the cardinality of at least one input to a first query plan, said first query plan being least-cost for cardinalities of inputs within said range, each of said iterations comprising:
Dependencies are inferred from the claim text.