Presentation is loading. Please wait.

Presentation is loading. Please wait.

1 Relational Algebra Basic Operations Algebra of Bags.

Similar presentations

Presentation on theme: "1 Relational Algebra Basic Operations Algebra of Bags."— Presentation transcript:

1 1 Relational Algebra Basic Operations Algebra of Bags

2 2 What is an “Algebra” uMathematical system consisting of: wOperands --- variables or values from which new values can be constructed. wOperators --- symbols denoting procedures that construct new values from given values.

3 3 What is Relational Algebra? uAn algebra whose operands are relations or variables that represent relations. uOperators are designed to do the most common things that we need to do with relations in a database. wThe result is an algebra that can be used as a query language for relations.

4 4 Core Relational Algebra uUnion, intersection, and difference. wUsual set operations, but both operands must have the same relation schema. uSelection: picking certain rows. uProjection: picking certain columns. uProducts and joins: compositions of relations. uRenaming of relations and attributes.

5 5 Selection  R1 := σ C (R2) wC is a condition (as in “if” statements) that refers to attributes of R2. wR1 is all those tuples of R2 that satisfy C.

6 6 Example: Selection Relation Sells: barbeerprice Joe’sBud2.50 Joe’sMiller2.75 Sue’sBud2.50 Sue’sMiller3.00 JoeMenu := σ bar=“Joe’s” (Sells): barbeerprice Joe’sBud2.50 Joe’sMiller2.75

7 7 Projection  R1 := π L (R2) wL is a list of attributes from the schema of R2. wR1 is constructed by looking at each tuple of R2, extracting the attributes on list L, in the order specified, and creating from those components a tuple for R1. wEliminate duplicate tuples, if any.

8 8 Example: Projection Relation Sells: barbeerprice Joe’sBud2.50 Joe’sMiller2.75 Sue’sBud2.50 Sue’sMiller3.00 Prices := π beer,price (Sells): beerprice Bud2.50 Miller2.75 Miller3.00

9 9 Extended Projection  Using the same π L operator, we allow the list L to contain arbitrary expressions involving attributes: 1.Arithmetic on attributes, e.g., A+B->C. 2.Duplicate occurrences of the same attribute.

10 10 Example: Extended Projection R = ( AB ) π A+B->C,A,A (R) =CA1A

11 11 Product  R3 := R1 Χ R2 wPair each tuple t1 of R1 with each tuple t2 of R2. wConcatenation t1t2 is a tuple of R3. wSchema of R3 is the attributes of R1 and then R2, in order. wBut beware attribute A of the same name in R1 and R2: use R1.A and R2.A.

12 12 Example: R3 := R1 Χ R2 R1(A,B ) R2(B,C ) R3(A,R1.B,R2.B,C )

13 13 Theta-Join  R3 := R1 ⋈ C R2  Take the product R1 Χ R2.  Then apply σ C to the result.  As for σ, C can be any boolean-valued condition. wHistoric versions of this operator allowed only A  B, where  is =, <, etc.; hence the name “theta-join.”

14 14 Example: Theta Join Sells(bar,beer,price )Bars(name,addr ) Joe’sBud2.50Joe’sMaple St. Joe’sMiller2.75Sue’sRiver Rd. Sue’sBud2.50 Sue’sCoors3.00 BarInfo := Sells ⋈ = Bars BarInfo(bar,beer,price,name,addr ) Joe’sBud2.50Joe’sMaple St. Joe’sMiller2.75Joe’sMaple St. Sue’sBud2.50Sue’sRiver Rd. Sue’sCoors3.00Sue’sRiver Rd.

15 15 Natural Join uA useful join variant (natural join) connects two relations by: wEquating attributes of the same name, and wProjecting out one copy of each pair of equated attributes.  Denoted R3 := R1 ⋈ R2.

16 16 Example: Natural Join Sells(bar,beer,price )Bars(bar,addr ) Joe’sBud2.50Joe’sMaple St. Joe’sMiller2.75Sue’sRiver Rd. Sue’sBud2.50 Sue’sCoors3.00 BarInfo := Sells ⋈ Bars Note: has become to make the natural join “work.” BarInfo(bar,beer,price,addr ) Joe’sBud2.50Maple St. Joe’sMilller2.75Maple St. Sue’sBud2.50River Rd. Sue’sCoors3.00River Rd.

17 17 Renaming  The ρ operator gives a new schema to a relation.  R1 := ρ R1(A1,…,An) (R2) makes R1 be a relation with attributes A1,…,An and the same tuples as R2. uSimplified notation: R1(A1,…,An) := R2.

18 18 Example: Renaming Bars(name, addr ) Joe’sMaple St. Sue’sRiver Rd. R(bar, addr ) Joe’sMaple St. Sue’sRiver Rd. R(bar, addr) := Bars

19 19 Building Complex Expressions uCombine operators with parentheses and precedence rules. uThree notations, just as in arithmetic: 1.Sequences of assignment statements. 2.Expressions with several operators. 3.Expression trees.

20 20 Sequences of Assignments uCreate temporary relation names. uRenaming can be implied by giving relations a list of attributes.  Example: R3 := R1 ⋈ C R2 can be written: R4 := R1 Χ R2 R3 := σ C (R4)

21 21 Expressions in a Single Assignment  Example: the theta-join R3 := R1 ⋈ C R2 can be written: R3 := σ C (R1 Χ R2) uPrecedence of relational operators: 1.[ σ, π, ρ ] (highest). 2.[ Χ, ⋈ ]. 3.∩. 4.[ ∪, — ]

22 22 Expression Trees uLeaves are operands --- either variables standing for relations or particular, constant relations. uInterior nodes are operators, applied to their child or children.

23 23 Example: Tree for a Query uUsing the relations Bars(name, addr) and Sells(bar, beer, price), find the names of all the bars that are either on Maple St. or sell Bud for less than $3.

24 24 As a Tree: BarsSells σ addr = “Maple St.” σ price<3 AND beer=“Bud” π name ρ R(name) π bar ∪

25 25 Example: Self-Join uUsing Sells(bar, beer, price), find the bars that sell two different beers at the same price. uStrategy: by renaming, define a copy of Sells, called S(bar, beer1, price). The natural join of Sells and S consists of quadruples (bar, beer, beer1, price) such that the bar sells both beers at this price.

26 26 The Tree Sells ρ S(bar, beer1, price) ⋈ π bar σ beer != beer1

27 27 Schemas for Results uUnion, intersection, and difference: the schemas of the two operands must be the same, so use that schema for the result. uSelection: schema of the result is the same as the schema of the operand. uProjection: list of attributes tells us the schema.

28 28 Schemas for Results --- (2) uProduct: schema is the attributes of both relations. wUse R.A, etc., to distinguish two attributes named A. uTheta-join: same as product. uNatural join: union of the attributes of the two relations. uRenaming: the operator tells the schema.

29 29 Relational Algebra on Bags uA bag (or multiset ) is like a set, but an element may appear more than once. uExample: {1,2,1,3} is a bag. uExample: {1,2,3} is also a bag that happens to be a set.

30 30 Why Bags? uSQL, the most important query language for relational databases, is actually a bag language. uSome operations, like projection, are more efficient on bags than sets.

31 31 Operations on Bags uSelection applies to each tuple, so its effect on bags is like its effect on sets. uProjection also applies to each tuple, but as a bag operator, we do not eliminate duplicates. uProducts and joins are done on each pair of tuples, so duplicates in bags have no effect on how we operate.

32 32 Example: Bag Selection R(A,B ) σ A+B < 5 (R) =AB 12

33 33 Example: Bag Projection R(A,B ) π A (R) =A 1 5 1

34 34 Example: Bag Product R(A,B )S(B,C ) R Χ S =AR.BS.BC

35 35 Example: Bag Theta-Join R(A,B )S(B,C ) R ⋈ R.B { "@context": "", "@type": "ImageObject", "contentUrl": "", "name": "35 Example: Bag Theta-Join R(A,B )S(B,C ) 1234 5678 12 R ⋈ R.B

36 36 Bag Union uAn element appears in the union of two bags the sum of the number of times it appears in each bag.  Example: {1,2,1} ∪ {1,1,2,3,1} = {1,1,1,1,1,2,2,3}

37 37 Bag Intersection uAn element appears in the intersection of two bags the minimum of the number of times it appears in either.  Example: {1,2,1,1} ∩ {1,2,1,3} = {1,1,2}.

38 38 Bag Difference uAn element appears in the difference A – B of bags as many times as it appears in A, minus the number of times it appears in B. wBut never less than 0 times. uExample: {1,2,1,1} – {1,2,3} = {1,1}.

39 39 Beware: Bag Laws != Set Laws uSome, but not all algebraic laws that hold for sets also hold for bags.  Example: the commutative law for union (R ∪ S = S ∪ R ) does hold for bags. wSince addition is commutative, adding the number of times x appears in R and S doesn’t depend on the order of R and S.

40 40 Example: A Law That Fails  Set union is idempotent, meaning that S ∪ S = S.  However, for bags, if x appears n times in S, then it appears 2n times in S ∪ S.  Thus S ∪ S != S in general.  e.g., {1} ∪ {1} = {1,1} != {1}.

Download ppt "1 Relational Algebra Basic Operations Algebra of Bags."

Similar presentations

Ads by Google