Reusing optimized query blocks in query processing

Details Reusing optimized query blocks in query processing Reusing optimized query blocks in query processing

Filed on

2007-07-17

Date issued

2007-07-17

Examiner

Cottingham, John (Department: 2167)

Patent Class

Data processing: database and file management or data structures

SubClass

Database design

SubSubClass

Data structure types

Other Related Categories

C707S793000, C707S793000

Type

Reexamination Certificate

Status

active

Patent number

10901272

Description

ABSTRACT:
Techniques for reusing optimized query blocks in query processing are provided. The techniques include checking a data structure to determine whether a previously-generated query block information record corresponding to an already-processed first inner query block exists in the data structure, where the already-processed first inner query block corresponds to the first inner query block in a first state in an already-processed form. If the previously-generated query block information record exists in the data structure, then query block information is established for the first inner query block in the first state based on the previously-generated query block information record. Then a cost is determined for a semantically equivalent query that includes the first inner query block in the first state based on the query block information for the first inner query block in the first state.

REFERENCES:
patent: 5412804 (1995-05-01), Krishna
patent: 5822748 (1998-10-01), Cohen et al.
patent: 6370524 (2002-04-01), Witkowski
patent: 2005/0234965 (2005-10-01), Rozenshtein et al.
patent: 2005/0283471 (2005-12-01), Ahmed
patent: 2006/0026115 (2006-02-01), Ahmed
Armed et al.: “Cost-Based Query Transformation in Oracle”, VLDB '06, Sep. 12-15, 2006, Seoul, Korea.
George Lumpkin, Hakan Jakobsson, “Query Optimization in Oracle 9i”, Oracle Corporation, Oracle White Paper, Feb. 2002, pp. 1-30.
Hamid Pirahesh, Joseph M. Hellerstein, Waqar Hasan, “Extensible/Rule Base Query Rewrite Optimization in Starburst”, IBM Almaden Research Center, pp. 1-10.
Umeshwar Dayal, “Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates and Quantifiers”, Proceedings of the 13thVLDB Conference, Brighton 1987, pp. 197-208.
P. Griffiths Selinger, M.M. Astrahan, D.D. Chamberlin, R.A. Lorie, T.G. Price, “Access Path Selection in a Relational Database Management System”, Proceedings of the 1979 ACM SIGMOD International Conference on the Management of Data, 1979, pp. 23-34.

Affiliated with

Also associated with

Rating

Reusing optimized query blocks in query processing does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Reusing optimized query blocks in query processing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reusing optimized query blocks in query processing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3721362