Dynamic optimization for processing a restartable sub-tree...

Details Dynamic optimization for processing a restartable sub-tree... Dynamic optimization for processing a restartable sub-tree...

2006-05-23

2006-05-23

Corrielus, Jean M. (Department: 2162)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000

Reexamination Certificate

active

07051034

ABSTRACT:
Execution of a restartable sub-tree of a query execution plan comprises determining whether use of parallel processes is a preferred or optimal mode of executing the sub-tree. The determination is based, at least in part, on how long it takes to restart the sub-tree using two or more parallel processes and/or how long it takes to probe the sub-tree, i.e., to fetch a row that meets one or more conditions or correlations associated with the sub-query, using the two or more parallel processes. Thus, a dynamic computational cost-based operation is described, which determines at query runtime whether to execute the restartable sub-tree using a single server process or multiple parallel server processes.

REFERENCES:
patent: 5301317 (1994-04-01), Lohman et al.
patent: 5325525 (1994-06-01), Shan et al.
patent: 5694591 (1997-12-01), Du et al.
patent: 5761654 (1998-06-01), Tow
patent: 5852826 (1998-12-01), Graunke et al.
patent: 5857180 (1999-01-01), Hallmark et al.
patent: 6112198 (2000-08-01), Lohman et al.
patent: 6341281 (2002-01-01), MacNicol et al.
patent: 6427032 (2002-07-01), Irons et al.
patent: 6785673 (2004-08-01), Fernandez et al.
patent: 6910032 (2005-06-01), Carlson et al.
patent: 2003/0172059 (2003-09-01), Andrei
patent: 2003/0229639 (2003-12-01), Carlson et al.
patent: 2003/0229640 (2003-12-01), Carlson et al.
patent: 2004/0220923 (2004-11-01), Nica
patent: 2005/0131877 (2005-06-01), Ghosh et al.
patent: 2005/0131890 (2005-06-01), Cruanes et al.
Hong et al. “Optimization of parallel Query Execution pains in XPRS”—1991—IEEE—(pp.: 218-225).
Rao et al. “Reusing Invariants: A New Strategy for Correleated Queries”—1998 ACM (pp.: 37-48).
Kabra et al. “Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans”—1998 ACM (pp.: 106-117).
Ganguly et al. “Query Optimization for parallel Execution”—1992 ACM (pp.: 9-18).
Oracle Corporation, “Parallel Execution with Oracle9i,” An Oracle White Paper, Oct. 2002, pp. 1-25.
Oracle Corporation, “Query Optimization in Oracle9i,” An Oracle White Paper, Feb. 2002, pp. 1-30.

Affiliated with

Also associated with

Rating

Dynamic optimization for processing a restartable sub-tree... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamic optimization for processing a restartable sub-tree..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic optimization for processing a restartable sub-tree... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3628016