Invention Grant
- Patent Title: Determining validity ranges of query plans based on suboptimality
- Patent Title (中): 基于次优性确定查询计划的有效范围
-
Application No.: US12028120Application Date: 2008-02-08
-
Publication No.: US08812486B2Publication Date: 2014-08-19
- Inventor: Volker G. Markl , Vijayshankar Raman
- Applicant: Volker G. Markl , Vijayshankar Raman
- Applicant Address: US NY Armonk
- Assignee: International Businesss Machines Corporation
- Current Assignee: International Businesss Machines Corporation
- Current Assignee Address: US NY Armonk
- Agency: IP Authority, LLC
- Agent Ramraj Soundararajan
- Main IPC: G06F7/00
- IPC: G06F7/00

Abstract:
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.
Public/Granted literature
- US20080215531A1 DETERMINING VALIDITY RANGES OF QUERY PLANS BASED ON SUBOPTIMALITY Public/Granted day:2008-09-04
Information query