Estimating the compilation time of a query optimizer

Details Estimating the compilation time of a query optimizer Estimating the compilation time of a query optimizer

2011-04-12

2011-04-12

Colan, Giovanna (Department: 2162)

Data processing: database and file management or data structures

Database and file access

Query optimization

C707S718000, C707S719000

Reexamination Certificate

active

07925646

ABSTRACT:
A compilation time estimator provides a quantified estimate of the optimizer compilation time for a given query optimizer. The estimator automates the optimizer to choose the right level of optimization in commercial database systems. The estimator reuses an optimizer's join enumerator to obtain actual number of joins, but bypasses plan generation to save estimation overhead, and maintains a small number of interesting physical properties to estimate the number of plans by using a linear regression model. The estimator uses the number of generated plans to estimate query compilation time.

REFERENCES:
patent: 5301317 (1994-04-01), Lohman et al.
patent: 5619692 (1997-04-01), Malkemus et al.
patent: 5761653 (1998-06-01), Schiefer et al.
patent: 5761657 (1998-06-01), Hoang
patent: 5987455 (1999-11-01), Cochrane et al.
patent: 6092062 (2000-07-01), Lohman et al.
patent: 6397204 (2002-05-01), Liu et al.
patent: 6847978 (2005-01-01), Ellis et al.
patent: 2002/0198867 (2002-12-01), Lohman et al.
patent: 2003/0212664 (2003-11-01), Breining et al.
Chu et al. (Non-Patent Literature: “Least Expected Cost Query Optimization, An exercise in Utility”, ACM 1999, Philadelphia.
“Least Expected Cost Query Optimization: An Exercise in Utility”; Francis Chu, Joseph Y. Halpern, Praveen Seshadri; ACM 1999, Philadelphia.
Chu et al. “Least Expected Cost Query Optimization, an exercise in Utility,” ACM 1999, Philadelphia.
“Heuristic Method for Joining Relational Data Base Tables,” IBM Technical Disclosure Bulletin, Feb. 1988, pp. 8-11.
Polyzotis et al., “Statistical Synopses for Graph-Structured XML Databases,” ACM SIGMOD, Jun. 4-6, 2002, Madison, Wisconsin, pp. 358-369.
Antoshenkov et al., “Query Processing and Optimization in Oracle Rdb,” VLDB Journal, 1996, pp. 229-237.
Blohsfeld et al., “A Comparison of Selectivity Estimators for Range Queries on Metric Attributes,” ACM SIGMOD, 1999, Philadelphia, PA, pp. 239-250.
Choi et al., “Selectivity Estimation for Spatio-Temporal Queries to Moving Objects,” ACM SIGMOD, Jun. 4-6, 2002, Madison, WI, pp. 440-451.
Swami, “Optimization of Large Join Queries: Combining Heuristics and Combinational Techniques,” ACM SIGMOD 1989, pp. 367-376.
Ioannidis et al., “Randomized Algorithms for Optimizing Large Join Queries,” ACM SIGMOD 1990, pp. 312-321.
“Adaptive Access Plan for Select Queries with Multiple Predicates,” IBM Technical Disclosure Bulletin, V32 N8B, Jan. 1990, pp. 6-10.
“Integrated Buffer Management and Query Optimization Strategy for Relational Databases,” IBM Technical Disclosure Bulletin, V32 N12, May 1990, pp. 253-257.
Ilyas et al., “Estimating Compilation Time of a Query Optimizer,” ACM SIGMOD, Jun. 9-12, 2003, San Diego, CA, 12pgs.

Affiliated with

Also associated with

Rating

Estimating the compilation time of a query optimizer does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Estimating the compilation time of a query optimizer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Estimating the compilation time of a query optimizer will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2738200