System for adapting query optimization effort to expected execut

Details System for adapting query optimization effort to expected execut System for adapting query optimization effort to expected execut

1992-04-27

1994-04-05

Kulik, Paul V.

Boots, shoes, and leggings

3642821, 364DIG1, 395650, G06F 1540

Patent

active

053013174

ABSTRACT:
A system for the automatic adjustment of resources devoted to query optimization according to estimated query execution time. The disclosed system permits the query optimizer to automatically trade off the time spent estimating the execution cost of alternate query execution plans against the potential savings in execution time that one of those alternate plans may yield. The number of alternate plans considered is adjusted by selecting compile-time parameters and heuristic criteria for limiting the primitive database operators used in the alternate plans, thereby establishing a new search space. The parameters and criteria are adjusted according to the estimate of execution cost for the optimal plan from a first search space. The first search space may be relatively small and quickly evaluated. Evaluation of larger subsequent search spaces is optional according to an automatic thresholding process of the disclosed system.

REFERENCES:
patent: 4531186 (1985-07-01), Knapman
patent: 4769772 (1988-09-01), Dwyer
patent: 4829427 (1989-05-01), Green
patent: 4956774 (1990-09-01), Shibamiya
patent: 5043872 (1991-08-01), Cheng
patent: 5091852 (1992-02-01), Tsuchida
An Introduction to Database Systems; CJ Date; vol. 1 4th Ed.; Addison-Wesley Publishing Co. 1986; pp. 333-359.
Extensible Enumeration of Feasible Jons for Relational Query Optimization; IBM 1988; by K. Ono et al.
Measuring the Complexity of Join Enumeration in Query Optimization by K. Ono et al; IBM 1990; pp. 314-325.
Access Path Selection in Relational Database Systems by M. S. Lakshmi et al; IBM; vol. 30, No. 9; pp. 420-421.
Relational Assignments for Distributed Database Systems by D. Cornell et al; IBM; vol. 31, No. 1; pp. 219-225.
Extended Disjunctive Normal Form for Efficient Processing of Recursive Logic Queries by S. Brady et al; IBM 1987; pp. 360-366.
Distributions of Query Plan Costs for Large Join Queries by A. Swami: IBM 1991; pp. 1-17.
Bayesian Stopping Rules for Multi-Start Global Optimization Methods by C. G. E. Boender; IBM 1987; vol. 37, pp. 59-80.
Optimization of Large Join Queries by A. Swami et al; IBM 1987; ACM-Sigmond Int'l Conf. on the Mgmt. of Data; pp. 8-17.

Affiliated with

Also associated with

Rating

System for adapting query optimization effort to expected execut does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System for adapting query optimization effort to expected execut, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System for adapting query optimization effort to expected execut will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-519903