1 Introduction to Database Systems CSE 444 Lecture 20: Query Execution: Relational Algebra May 21, 2008.

Slides:



Advertisements
Similar presentations
Relational Algebra, Join and QBE Yong Choi School of Business CSUB, Bakersfield.
Advertisements

Tallahassee, Florida, 2014 COP4710 Database Systems Relational Algebra Fall 2014.
CS CS4432: Database Systems II Logical Plan Rewriting.
Lecture 07: Relational Algebra
1 Relational Algebra. Motivation Write a Java program Translate it into a program in assembly language Execute the assembly language program As a rough.
Relational Algebra (end) SQL April 19 th, Complex Queries Product ( pid, name, price, category, maker-cid) Purchase (buyer-ssn, seller-ssn, store,
Relational Algebra Ch. 7.4 – 7.6 John Ortiz. Lecture 4Relational Algebra2 Relational Query Languages  Query languages: allow manipulation and retrieval.
1 Relational Algebra Lecture #9. 2 Querying the Database Goal: specify what we want from our database Find all the employees who earn more than $50,000.
Relational Algebra Maybe -- SQL. Confused by Normal Forms ? 3NF BCNF 4NF If a database doesn’t violate 4NF (BCNF) then it doesn’t violate BCNF (3NF) !
CMPT 354, Simon Fraser University, Fall 2008, Martin Ester 52 Database Systems I Relational Algebra.
Oct 28, 2003Murali Mani Relational Algebra B term 2004: lecture 10, 11.
M.P. Johnson, DBMS, Stern/NYU, Sp20041 C : Database Management Systems Lecture #9 Matthew P. Johnson Stern School of Business, NYU Spring, 2004.
Lecture #3 Functional Dependencies Normalization Relational Algebra Thursday, October 12, 2000.
1 Lecture 22: Query Execution Wednesday, March 2, 2005.
1 Lecture 07: Relational Algebra. 2 Outline Relational Algebra (Section 6.1)
Database Systems: A Practical Approach to Design, Implementation and Management International Computer Science S. Carolyn Begg, Thomas Connolly Lecture.
1 Lecture 7: Query Execution and Optimization Tuesday, February 20, 2007.
Correlated Queries SELECT title FROM Movie AS Old WHERE year < ANY (SELECT year FROM Movie WHERE title = Old.title); Movie (title, year, director, length)
Relational Schema Design (end) Relational Algebra Finally, querying the database!
One More Normal Form Consider the dependencies: Product Company Company, State Product Is it in BCNF?
Relation Decomposition A, A, … A 12n Given a relation R with attributes Create two relations R1 and R2 with attributes B, B, … B 12m C, C, … C 12l Such.
Lecture 3: Relational Algebra and SQL Tuesday, March 25, 2008.
1.1 CAS CS 460/660 Introduction to Database Systems Relational Algebra.
1 Lecture 23: Query Execution Wednesday, March 8, 2006.
Transactions, Relational Algebra, XML February 11 th, 2004.
CSE 544: Relational Operators, Sorting Wednesday, 5/12/2004.
1 Lecture 7: Normal Forms, Relational Algebra Monday, 10/15/2001.
Relational Algebra 2. Relational Algebra Formalism for creating new relations from existing ones Its place in the big picture: Declartive query language.
Database Management Systems, R. Ramakrishnan1 Relational Algebra Module 3, Lecture 1.
1 CS 430 Database Theory Winter 2005 Lecture 5: Relational Algebra.
Lecture 13: Relational Decomposition and Relational Algebra February 5 th, 2003.
The Relational Model Lecture 16. Today’s Lecture 1.The Relational Model & Relational Algebra 2.Relational Algebra Pt. II [Optional: may skip] 2 Lecture.
CSC271 Database Systems Lecture # 7. Summary: Previous Lecture  Relational keys  Integrity constraints  Views.
Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 6 The Relational Algebra and Relational Calculus.
1 Lecture 10: Database Design and Relational Algebra Monday, October 20, 2003.
1 Lecture 5: Relational Algebra and XML Monday, April 26th, 2004.
1 CSE544: Lecture 7 XQuery, Relational Algebra Monday, 4/22/02.
LECTURE THREE RELATIONAL ALGEBRA 11. Objectives  Meaning of the term relational completeness.  How to form queries in relational algebra. 22Relational.
Relational Algebra COMP3211 Advanced Databases Nicholas Gibbins
©Silberschatz, Korth and Sudarshan2.1Database System Concepts - 6 th Edition Chapter 8: Relational Algebra.
Lecture 14: Relational Algebra Projects XML?
Summary of Relational Algebra
Relational Algebra.
COMP3017 Advanced Databases
COP4710 Database Systems Relational Algebra.
Relational Algebra at a Glance
Lecture 8: Relational Algebra
Chapter 2: Intro to Relational Model
Database Management Systems (CS 564)
Lecture 18 The Relational Model.
Lecture 10: Relational Algebra (continued), Datalog
April 6th – relational algebra
Lecture 4: Updates, Views, Constraints and Other Fun Features
RDBMS RELATIONAL DATABASE MANAGEMENT SYSTEM.
Lecture 12: SQL Friday, October 20, 2000.
Lecture 33: The Relational Model 2
Where are we? Until now: Modeling databases (ODL, E/R): all about the schema Now: Manipulating the data: queries, updates, SQL Then: looking inside -
Lecture 4: SQL Thursday, January 11, 2001.
Chapter 2: Intro to Relational Model
Relational Algebra Friday, 11/14/2003.
Chapter 2: Intro to Relational Model
CS639: Data Management for Data Science
Lecture 23: Query Execution
Chapter 2: Intro to Relational Model
Lecture 22: Query Execution
Lecture 3: Relational Algebra and SQL
Relational Schema Design (end) Relational Algebra SQL (maybe)
Syllabus Introduction Website Management Systems
Lecture 11: Functional Dependencies
Lecture 20: Query Execution
Presentation transcript:

1 Introduction to Database Systems CSE 444 Lecture 20: Query Execution: Relational Algebra May 21, 2008

2 DBMS Architecture How does a SQL engine work ? SQL query  relational algebra plan Relational algebra plan  Optimized plan Execute each operator of the plan

3 Relational Algebra Formalism for creating new relations from existing ones Its place in the big picture: Declartive query language Algebra Implementation SQL, relational calculus Relational algebra Relational bag algebra

4 Relational Algebra Five operators: –Union:  –Difference: - –Selection:  –Projection:  –Cartesian Product:  Derived or auxiliary operators: –Intersection, complement –Joins (natural,equi-join, theta join, semi-join) –Renaming: 

5 1. Union and 2. Difference R1  R2 Example: –ActiveEmployees  RetiredEmployees R1 – R2 Example: –AllEmployees -- RetiredEmployees

6 What about Intersection ? It is a derived operator R1  R2 = R1 – (R1 – R2) Also expressed as a join (will see later) Example –UnionizedEmployees  RetiredEmployees

7 3. Selection Returns all tuples which satisfy a condition Notation:  c (R) Examples –  Salary > (Employee) –  name = “Smith” (Employee) The condition c can be =,, , <>

8  Salary > (Employee) SSNNameSalary John Smith Fred SSNNameSalary Smith Fred500000

9 4. Projection Eliminates columns, then removes duplicates Notation:  A1,…,An (R) Example: project social-security number and names: –  SSN, Name (Employee) – Output schema: Answer(SSN, Name)

10  Name,Salary (Employee) SSNNameSalary John John John NameSalary John20000 John60000

11 5. Cartesian Product Each tuple in R1 with each tuple in R2 Notation: R1  R2 Example: –Employee  Dependents Very rare in practice; mainly used to express joins

12

13 Relational Algebra Five operators: –Union:  –Difference: - –Selection:  –Projection:  –Cartesian Product:  Derived or auxiliary operators: –Intersection, complement –Joins (natural,equi-join, theta join, semi-join) –Renaming: 

14 Renaming Changes the schema, not the instance Notation:  B1,…,Bn (R) Example: –  LastName, SocSocNo (Employee) –Output schema: Answer(LastName, SocSocNo)

15 Renaming Example Employee NameSSN John Tony LastNameSocSocNo John Tony  LastName, SocSocNo (Employee)

16 Natural Join Notation: R1 R2 Meaning: R1 R2 =  A (  C (R1  R2)) Where: –The selection  C checks equality of all common attributes –The projection eliminates the duplicate common attributes

17 Natural Join Example Employee NameSSN John Tony Dependents SSNDname Emily Joe NameSSNDname John Emily Tony Joe Employee Dependents =  Name, SSN, Dname (  SSN=SSN2 (Employee   SSN2, Dname (Dependents))

18 Natural Join R= S= R S= AB XY XZ YZ ZV BC ZU VW ZV ABC XZU XZV YZU YZV ZVW

19 Natural Join Given the schemas R(A, B, C, D), S(A, C, E), what is the schema of R S ? Given R(A, B, C), S(D, E), what is R S ? Given R(A, B), S(A, B), what is R S ?

20 Theta Join A join that involves a predicate R1  R2 =   (R1  R2) Here  can be any condition

21 Eq-join A theta join where  is an equality R1 A=B R2 =  A=B (R1  R2) Example: –Employee SSN=SSN Dependents Most useful join in practice

22 Semijoin R |  S =  A1,…,An (R S) Where A 1, …, A n are the attributes in R Example: –Employee |  Dependents

23 Semijoins in Distributed Databases Semijoins are used in distributed databases SSNName... SSNDnameAge... Employee Dependents network Employee ssn=ssn (  age>71 (Dependents)) T =  SSN  age>71 (Dependents) R = Employee |  T Answer = R Dependents

24 Complex RA Expressions Person Purchase Person Product  name=fred  name=gizmo  pid  ssn seller-ssn=ssnpid=pidbuyer-ssn=ssn  name

25 Operations on Bags A bag = a set with repeated elements All operations need to be defined carefully on bags {a,b,b,c}  {a,b,b,b,e,f,f}={a,a,b,b,b,b,b,c,e,f,f} {a,b,b,b,c,c} – {b,c,c,c,d} = {a,b,b}  C (R): preserve the number of occurrences  A (R): no duplicate elimination Cartesian product, join: no duplicate elimination Important! Relational Engines work on bags, not sets! Reading assignment: 5.3 – 5.4

26 Note: RA has Limitations ! Cannot compute “transitive closure” Find all direct and indirect relatives of Fred Cannot express in RA !!! Need to write C program Name1Name2Relationship FredMaryFather MaryJoeCousin MaryBillSpouse NancyLouSister

27 From SQL to RA SELECT DISTINCT P.buyer FROM Purchase P, Person Q WHERE P.buyer=Q.name AND P.city=‘Seattle’ AND Q.age > 20 SELECT DISTINCT P.buyer FROM Purchase P, Person Q WHERE P.buyer=Q.name AND P.city=‘Seattle’ AND Q.age > 20 Purchase Person buyer=name city=‘Seattle’ and age > 20 buyer  Purchase(buyer, product, city) Person(name, age)

28 Also… SELECT DISTINCT P.buyer FROM Purchase P, Person Q WHERE P.buyer=Q.name AND P.city=‘Seattle’ AND Q.age > 20 SELECT DISTINCT P.buyer FROM Purchase P, Person Q WHERE P.buyer=Q.name AND P.city=‘Seattle’ AND Q.age > 20 Purchase Person buyer=name city=‘Seattle’ buyer  Purchase(buyer, product, city) Person(name, age) age > 20 

29 Non-monontone Queries (in class) SELECT DISTINCT P.product FROM Purchase P WHERE P.city=‘Seattle’ AND not exists (select * from Purchase P2, Person Q where P2.product = P.product and P2.buyer = Q.name and Q.age > 20) SELECT DISTINCT P.product FROM Purchase P WHERE P.city=‘Seattle’ AND not exists (select * from Purchase P2, Person Q where P2.product = P.product and P2.buyer = Q.name and Q.age > 20) Purchase(buyer, product, city) Person(name, age)

30 Extended Logical Algebra Operators (operate on Bags, not Sets) Union, intersection, difference Selection  Projection  Join Duplicate elimination  Grouping  Sorting 

31 Logical Query Plan SELECT city, count(*) FROM sales GROUP BY city HAVING sum(price) > 100 SELECT city, count(*) FROM sales GROUP BY city HAVING sum(price) > 100 sales(product, city, price)  city, sum(price)→p, count(*) → c  p > 100  city, c T1(city,p,c) T2(city,p,c) T3(city, c) T1, T2, T3 = temporary tables

32 Logical v.s. Physical Algebra We have seen the logical algebra so far: –Five basic operators, plus group-by, plus sort The Physical algebra refines each operator into a concrete algorithm

33 Physical Plan SELECT DISTINCT P.buyer FROM Purchase P, Person Q WHERE P.buyer=Q.name AND P.city=‘Seattle’ AND Q.age > 20 SELECT DISTINCT P.buyer FROM Purchase P, Person Q WHERE P.buyer=Q.name AND P.city=‘Seattle’ AND Q.age > 20 Purchase Person buyer=name city=‘Seattle’ buyer  Purchase(buyer, product, city) Person(name, age) age > 20  index-join sequential scan  Hash-based dup. elim

34 Physical Plans Can Be Subtle SELECT * FROM Purchase P WHERE P.city=‘Seattle’ SELECT * FROM Purchase P WHERE P.city=‘Seattle’ Purchase City-index buyer city=‘Seattle’  primary-index-join sequential scan Where did the join come from ?