Reordering of complex SQL queries involving groupbys, joins, outer joins and full outer joins

• US 5,960,427 A
• Filed: 08/01/1997
• Issued: 09/28/1999
• Est. Priority Date: 05/30/1996
• Status: Expired due to Term

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Iyer, Balakrishna Raghavendra, Goel, Piyush
• Primary Examiner(s): Kulik, Paul V.
• Application Number:
  US08/905,106
• Time in Patent Office: 788 Days
• Field of Search: 707/4, 707/2
• US Class Current: 1/1
• CPC Class Codes: G06F 16/24537 of operators
• CPC Class Codes: G06F 16/24547 Optimisations to support specific applications; Extensibility of optimisers
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation

Abstract

A method, apparatus, and article of manufacture for query simplification by applying generalized inference propagation and generalized transitive closure in SQL queries having selection, projection, join, outer join, and intersection operations. The disclosed transformations and enumeration method unify and solve the problems of 1) unnesting join aggregate queries, and 2) complete enumeration of queries containing outer joins, when the outer join predicate references an aggregated value, or the predicate references more than two base relations in a query subtree. The system first eliminates redundant sub-expressions and modifies expensive binary operations to inexpensive binary operations, then converts complex predicates to simple predicates by application of a generalized selection (GS) operator.

Claims

1. A method of simplifying a query performed by a computer to retrieve data from a relational database stored in a electronic storage device coupled to the computer, the method comprising the steps of:

(a) eliminating redundant sub-expressions from the query and modifying expensive binary operations in the query to inexpensive binary operations, so that only simple and complex predicates remain in the query; and

(b) converting the complex predicates remaining in the query to simple predicates by application of a generalized selection (GS) operator.

2. The method of claim 1, further comprising the step of applying a simplification identity to a SELECT DISTINCT operator in the query.

3. The method of claim 1, further comprising the step of applying a simplification identity for a push-up of a GROUPBY operator in the query.

4. The method of claim 1, wherein the GS operator, σ

^*_p r₂, r₃ ! (r₁), of relation r₁ with respect to relations r₂ and r₃ comprises the relation (R₁, V₁, E'"'"'), wherein;

space="preserve" listing-type="equation">E'"'"'=σ

.sub.p (r.sub.1){π

.sup.c.sub.R.sbsb.2.sub.V.sbsb.2 (r.sub.1)-π

.sup.c.sub.R.sbsb.2.sub.V.sbsb.2 (σ

.sub.p (r.sub.1))} {π

.sup.c.sub.R.sbsb.3.sub.V.sbsb.3 (r.sub.1)-π

.sup.c.sub.R.sbsb.3.sub.V.sbsb.3 (σ

.sub.p (r.sub.1))}

and wherein r₁ =(R₁, V₁, E₁), r₂ =(R₂, V₂, E₂), and r₃ =(R₃, V₃, E₃) comprise three relations such that R₂ .OR right.R₁, R₃ .OR right.R₁, R₂ ∩

R₃ =.o slashed., V₂ .OR right.V₁, V₃ .OR right.V₁, and V₂ ∩

V₃ =.o slashed., and p denotes a null-intolerant predicate in R₁.

5. The method of claim 1, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU22## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

6. The method of claim 1, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU23## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

7. The method of claim 1, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU24##

space="preserve" listing-type="equation">where ⊙

.di-elect cons.{→

, ←

, ⃡

}wherein X.sub.i =(R.sub.i, V.sub.i, E.sub.i) are relational expressions for 1≦

i≦

3, and p.sub.i,j denote the predicates between expressions X.sub.i and X.sub.j.

8. The method of claim 1, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU25##

space="preserve" listing-type="equation">where ⊙

.di-elect cons.{→

, ←

, ⃡

}

wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

9. The method of claim 1, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU26## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

10. The method of claim 1, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU27## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

11. The method of claim 1, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU28## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

12. The method of claim 1, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU29## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

13. The method of claim 1, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU30## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

14. The method of claim 1, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU31## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

15. The method of claim 1, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU32## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

16. The method of claim 1, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU33## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

17. The method of claim 1, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU34## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

18. An apparatus for simplifying a query performed by a computer to retrieve data from a relational database stored in a electronic storage device, comprising:

(a) means for eliminating redundant sub-expressions from the query and modifying expensive binary operations in the query to inexpensive binary operations, so that only simple and complex predicates remain in the query; and

(b) means for converting the complex predicates remaining in the query to simple predicates by application of a generalized selection (GS) operator.

19. The apparatus of claim 18, further comprising means for applying a simplification identity to a SELECT DISTINCT operator in the query.

20. The apparatus of claim 18, further comprising means for applying a simplification identity for a push-up of a GROUPBY operator in the query.

21. The apparatus of claim 18, wherein the GS operator, σ

^*_p r₂, r₃ ! (r₁), of relation r₁ with respect to relations r₂ and r₃ comprises the relation (R₁, V₁, E'"'"'), wherein;

space="preserve" listing-type="equation">E'"'"'=σ

.sub.p (r.sub.1){π

.sup.c.sub.R.sbsb.2.sub.V.sbsb.2 (r.sub.1)-π

.sup.c.sub.R.sbsb.2.sub.V.sbsb.2 (σ

.sub.p (r.sub.1))}{π

.sup.c.sub.R.sbsb.3.sub.V.sbsb.3 (r.sub.1)-π

.sup.c.sub.R.sbsb.3.sub.V.sbsb.3 (σ

.sub.p (r.sub.1))}

and wherein r₁ =(R₁, V₁, E₁), r₂ =(R₂, V₂, E₂), and r₃ =(R₃, V₃, E₃) comprise three relations such that R₂ .OR right.R₁, R₃ .OR right.R₁, R₂ ∩

R₃ =.o slashed., V₂ .OR right.V₁, V₃ .OR right.V₁, and V₂ ∩

V₃ =.o slashed., and p denotes a null-intolerant predicate in R₁.

22. The apparatus of claim 18, wherein the means for converting comprises means for applying a simplification expression to the query comprising:

##EQU35## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

23. The apparatus of claim 18, wherein the means for converting comprises means for applying a simplification expression to the query comprising:

##EQU36## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

24. The apparatus of claim 18, wherein the means for converting comprises means for applying a simplification expression to the query comprising:

##EQU37##

space="preserve" listing-type="equation">where ⊙

.di-elect cons.{, →

, ←

, ⃡

}wherein X.sub.i =(R.sub.i, V.sub.i, E.sub.i) are relational expressions for 1≦

i≦

3, and p.sub.i,j denote the predicates between expressions X.sub.i and X.sub.j.

25. The apparatus of claim 18, wherein the means for converting comprises means for applying a simplification expression to the query comprising:

##EQU38##

space="preserve" listing-type="equation">where ⊙

.di-elect cons.{, →

, ←

, ⃡

}wherein X.sub.i =(R.sub.i, V.sub.i, E.sub.i) are relational expressions for 1≦

i≦

3, and p.sub.i,j denote the predicates between expressions X.sub.i and X.sub.j.

26. The apparatus of claim 18, wherein the means for converting comprises means for applying a simplification expression to the query comprising:

##EQU39## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

27. The apparatus of claim 18, wherein the means for converting comprises means for applying a simplification expression to the query comprising:

##EQU40## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

28. The apparatus of claim 18, wherein the means for converting comprises means for applying a simplification expression to the query comprising:

##EQU41## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

29. The apparatus of claim 18, wherein the means for converting comprises means for applying a simplification expression to the query comprising:

##EQU42## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

30. The apparatus of claim 18, wherein the means for converting comprises means for applying a simplification expression to the query comprising:

##EQU43## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

31. The apparatus of claim 18, wherein the means for converting comprises means for applying a simplification expression to the query comprising:

##EQU44## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

32. The apparatus of claim 18, wherein the means for converting comprises means for applying a simplification expression to the query comprising:

##EQU45## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

33. The apparatus of claim 18, wherein the means for converting comprises means for applying a simplification expression to the query comprising:

##EQU46## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

34. The apparatus of claim 18, wherein the means for converting comprises means for applying a simplification expression to the query comprising:

##EQU47## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

35. An article of manufacture comprising a computer program carrier embodying one or more instructions of a method of simplifying a query performed by a computer to retrieve data from a relational database stored in a electronic storage device, the method comprising the steps of:

(a) eliminating redundant sub-expressions from the query and modifying expensive binary operations in the query to inexpensive binary operations, so that only simple and complex predicates remain in the query; and

(b) converting the complex predicates remaining in the query to simple predicates by application of a generalized selection (GS) operator.

36. The article of manufacture of claim 35, wherein the method further comprises the step of applying a simplification identity to a SELECT DISTINCT operator in the query.

37. The article of manufacture of claim 35, wherein the method further comprises the step of applying a simplification identity for a push-up of a GROUPBY operator in the query.

38. The article of manufacture of claim 35, wherein the GS operator, σ

^*_p r₂, r₃ ! (r₁), of relation r₁ with respect to relations r₂ and r₃ comprises the relation (R₁, V₁, E'"'"'), wherein;

space="preserve" listing-type="equation">E'"'"'=σ

.sub.p (r.sub.1){π

.sup.c.sub.R.sbsb.2.sub.V.sbsb.2 (r.sub.1)-π

.sup.c.sub.R.sbsb.2.sub.V.sbsb.2 (σ

.sub.p (r.sub.1))}{π

.sup.c.sub.R.sbsb.3.sub.V.sbsb.3 (r.sub.1)-π

.sup.c.sub.R.sbsb.3.sub.V.sbsb.3 (σ

.sub.p (r.sub.1))}

and wherein r₁ =(R₁, V₁, E₁), r₂ =(R₂, V₂, E₂), and r₃ =(R₃, V₃, E₃) comprise three relations such that R₂ .OR right.R₁, R₃ .OR right.R₁, R₂ ∩

R₃ =.o slashed., V₂ .OR right.V₁, V₃ .OR right.V₁, and V₂ ∩

V₃ =.o slashed., and p denotes a null-intolerant predicate in R₁.

39. The article of manufacture of claim 35, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU48## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

40. The article of manufacture of claim 35, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU49## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

41. The article of manufacture of claim 35, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU50##

space="preserve" listing-type="equation">where ⊙

.di-elect cons.{, →

, ←

, ⃡

}wherein X.sub.i =(R.sub.i, V.sub.i, E.sub.i) are relational expressions for 1≦

i≦

3, and p.sub.i,j denote the predicates between expressions X.sub.i and X.sub.j.

42. The article of manufacture of claim 35, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU51##

space="preserve" listing-type="equation">where ⊙

.di-elect cons.{, →

, ←

, ⃡

}wherein X.sub.i =(R.sub.i, V.sub.i, E.sub.i) are relational expressions for 1≦

i≦

3, and p.sub.i,j denote the predicates between expressions X.sub.i and X.sub.j.

43. The article of manufacture of claim 35, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU52## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

44. The article of manufacture of claim 35, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU53## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

45. The article of manufacture of claim 35, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU54## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

46. The article of manufacture of claim 35, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU55## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

47. The article of manufacture of claim 35, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU56## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

48. The article of manufacture of claim 35, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU57## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

49. The article of manufacture of claim 35, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU58## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

50. The article of manufacture of claim 35, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU59## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.

51. The article of manufacture of claim 35, wherein the converting step comprises the step of applying a simplification expression to the query comprising:

##EQU60## wherein X_i =(R_i, V_i, E_i) are relational expressions for 1≦

i≦

3, and p_i,j denote the predicates between expressions X_i and X_j.