Optimization of SQL queries using universal quantifiers, set int

Details Optimization of SQL queries using universal quantifiers, set int Optimization of SQL queries using universal quantifiers, set int

1995-02-07

1996-12-31

Amsbury, Wayne

Boots, shoes, and leggings

364DIG1, 3642821, G06F 1730

Patent

active

055903240

ABSTRACT:
A method and apparatus for optimizing SQL queries by propagating and exploiting column nullability. Column nullability is identified and propagated using a three-valued logic, wherein a column of a table can be identified nullability information is exploited to optimize query operations through transformations. In one aspect of the present invention, quantified predicates (such as ">ALL") are transformed into simple predicates involving singleton subqueries so that indexing can be exploited. In another aspect of the present invention, "is not null" predicates are generated and pushed for certain aggregate queries. In still another aspect of the present invention, intersect operations are transformed into joins. The end result is that the present invention can significantly enhance the performance of the queries.

REFERENCES:
patent: 4769772 (1988-09-01), Dwyer
patent: 4829427 (1989-05-01), Green
patent: 5001477 (1991-03-01), Hicks et al.
patent: 5091852 (1992-02-01), Tsunchida et al.
patent: 5367675 (1994-11-01), Cheng et al.
patent: 5495605 (1996-02-01), Cadot
patent: 5511186 (1996-04-01), Carhart et al.
patent: 5519859 (1996-05-01), Grace
Selinger et al, "Access Path Selection in a Relational Database Management System", IBM Research Division, San Jose, CA (US), ACM, 1979, pp. 23-34.
Dayal et al., "An Extended Relational Algebra with Control Over Duplicate Elimination", Computer Corporation of America, Cambridge, MA, (US), ACM 1982, pp. 117-123.
Kim, Won, IBM Research "On Optimizing an SQL-Like Nested Query", ACM Transactions on Database Systems, vol. 7, No. 3, Sep. 1982, pp. 443-469.
Dayal, Umeshwar, "Of Nests and Trees: A Unified Approach to Processing Queries that Contain Nested Subqueries, Aggregates, and Quantifiers", Computer Corporation of America, Cambridge, MA (US), Proceedings of the 13th VLDB Conference, 1987, pp. 197-208.
Ganski et al., "Optimization of Nested SQL Queries Revisited", ACM, 1987, pp. 23-33.
Haas et al., "Extensible Query Processing in Starburst", IBM Almaden Research Center, San Jose, CA (US), ACM 1989, pp. 377-388.
Date, C. J. & Darwen, Hugh., "Relational Database Management" Relational Database Writings 1989-1991, Part II, pp. 133-154.
Pirahesh et al., "Extensible/Rule Based Query Rewrite Optimization in Starburst", IBM Almaden Research Center, San Jose, CA (US), ACM Sigmond, Jun. 1992, pp. 39-48.
Levy et al., "Query Optimization by Predicate Move-Around", Proceedings of the 20th VLDB Conference, Santiago, Chile, 1994, pp. 96-107.
Paulley et al., "Exploiting Uniqueness in Query Optimization", Department of computer Science, University of Waterloo, Ontario, Canada, IEEE 1994, pp. 68-79.
Lohman et al., "Research Report--Query Processing in R*", IBM Research Laboratory, San Jose, CA (US) IBM Research Division, Apr. 1984, pp. 1-33.
Yan et al, "Performing Broup-By before Join", Proc. The 10th International Conference on Data Engineering, 14-18 Feb. 94, pp. 89-100.

Affiliated with

Also associated with

Rating

Optimization of SQL queries using universal quantifiers, set int does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Optimization of SQL queries using universal quantifiers, set int, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimization of SQL queries using universal quantifiers, set int will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1149675