Exploitation of uniqueness properties using a 1-tuple condition

Details Exploitation of uniqueness properties using a 1-tuple condition Exploitation of uniqueness properties using a 1-tuple condition

1995-02-07

1997-03-25

Kulik, Paul V.

Boots, shoes, and leggings

364DIG1, 3642821, 3642834, G06F 1730

Patent

active

056153619

ABSTRACT:
The present invention optimizes SQL queries by exploiting uniqueness properties. In identifying whether the generalized 1-tuple condition exists, the query is first analyzed to determine whether any columns referenced in a predicate of the query are bound. According to the present invention, columns may be bound to constant values or correlated columns or columns that are already bound. The bound columns, if any, are then analyzed to determine whether any of the bound columns comprise a key for its associated table. If these conditions exist, then the query satisfies the 1-tuple condition, in that it returns at most one tuple. Once the generalized 1-tuple condition has been identified to exist for the query, important query transformations can be performed for optimization purposes. These query transformations comprise the transformation of scalar subqueries into joins, or the elimination of distinctiveness requirements (i.e., DISTINCT keywords) from SELECT clauses.

REFERENCES:
patent: 4829427 (1989-05-01), Green
patent: 5091852 (1992-02-01), Tsunchida et al.
patent: 5367675 (1994-11-01), Cheng et al.
patent: 5469568 (1995-11-01), Schiefer et al.
patent: 5546570 (1996-08-01), McPherson et al.
patent: 5548755 (1996-08-01), Leung et al.
patent: 5548758 (1996-08-01), Pirahesh et al.
patent: 5557791 (1996-09-01), Cheng et al.
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 Resarch Laboratory, San Jose, CA (US) IBM Research Division, Apr. 1984, pp. 1-33.

Affiliated with

Also associated with

Rating

Exploitation of uniqueness properties using a 1-tuple condition does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Exploitation of uniqueness properties using a 1-tuple condition , we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exploitation of uniqueness properties using a 1-tuple condition will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2212048