Relational Model and Relational Algebra

Transcription

1 Relational Model and Relational Algebra CMPSCI 445 Database Systems Fall 2008 Some slide content courtesy of Zack Ives, Ramakrishnan & Gehrke, Dan Suciu, Ullman & Widom

2 Next lectures: Querying relational data Today Relational model, Relational algebra Wednesday SQL Homework 1 assigned Friday Next Week More SQL

3 The Relational Model The relational data model (Codd, 1970): Data independence: details of physical storage are hidden from users High-level declarative query language say what you want, not how to compute it. mathematical foundation

4 Relational Database: Definitions

5 Relational Database: Definitions Relational database: a set of relations

6 Relational Database: Definitions Relational database: a set of relations Relation: made up of 2 parts: Schema : specifies name of relation, plus name and type/domain of each column. Instance : a table, with rows and columns.

7 Relational Database: Definitions Relational database: a set of relations Relation: made up of 2 parts: Schema : specifies name of relation, plus name and type/domain of each column. Instance : a table, with rows and columns. Students(sid: string, name: string, login: string, age: integer, gpa: real). Restriction: all attributes are of atomic type, no nested tables

8 Relational instances: tables Students

9 Relational instances: tables Students column, attribute, field

10 Relational instances: tables Students column, attribute, field row, tuple

11 Relational instances: tables Students column, attribute, field row, tuple Attribute value

12 Relational instances: tables Students column, attribute, field row, tuple Attribute value A relation is a set of tuples: no tuple can occur more than once Real systems may allow duplicates for efficiency or other reasons we ll come back to this.

13 Example Database STUDENT Takes COURSE sid name 1 Jill 2 Bo 3 Maya sid cid PROFESSOR fid name 1 Diao 2 Saul 8 Weems cid title sem 445 DB F AI S Arch F08 Teaches fid cid

14 Relational Query Languages Query languages: Allow manipulation and retrieval of data from a database. DB query languages!= programming languages not expected to be Turing complete. not intended to be used for complex calculations. support easy, efficient access to large data sets.

15 Query language preliminaries Query Q: R1..Rn R A query is applied to one or more relation instances The result of a query is a relation instance. Input and output schema: Schema of input relations for a query are fixed The schema for the result of a given query is also fixed: determined by definition of query language constructs.

16 What is an Algebra?

17 What is an Algebra? Mathematical system consisting of:

18 What is an Algebra? Mathematical system consisting of: Operands --- variables or values from which new values can be constructed.

19 What is an Algebra? Mathematical system consisting of: Operands --- variables or values from which new values can be constructed. Operators --- symbols denoting procedures that construct new values from given values.

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

21 Relational Algebra Operates on relations, i.e. sets Later: we discuss how to extend this to bags Five basic operators: Union: Difference: - Selection: σ Projection: Π Cartesian Product: Derived or auxiliary operators: Intersection, complement Joins (natural,equi-join, theta join) Renaming: ρ

22 1. Union and 2. Difference R 1 sid name R 2 sid name 1 Jill 1 Jill 2 Bo 4 Bob 3 Maya R 1 R 2 sid name 1 Jill 2 Bo R 1 R 2 sid name 2 Bo 3 Maya 3 Maya 4 Bob

23 What about Intersection? It is a derived operator R 1 R 2 = R 1 (R 1 R 2 ) Also expressed as a join (will see later) R 1 R 2 R 1 R 2

24 3. Selection Returns all tuples which satisfy a condition Course Notation: σ c (R) Examples σ CID > 400 (Course) σ title = AI (Course) cid title sem 445 DB F AI S Arch F08 The condition c can be =, <,, >,, <>

25 4. Projection Eliminates columns, then removes duplicates Notation: Π A1,,An (R) Example: project cid and name Π cid, name (Course) Output schema: Answer(cid, name)

26 4. Projection Eliminates columns, then removes duplicates Notation: Π A1,,An (R) Example: project cid and name Π cid, name (Course) Output schema: Answer(cid, name) Course cid name sem 445 DB F AI S DB S08 Π Answer cid name 445 DB 483 AI

27 5. Cartesian Product Each tuple in R 1 with each tuple in R 2 Notation: R 1 R 2 Very rare in practice; mainly used to express joins Also called Cross Product

28 Cartesian Product Student sid name 1 Jill 2 Bo Takes sid cid

29 Cartesian Product Student sid name 1 Jill 2 Bo Takes sid cid Student Takes sid name sid cid 1 Jill Jill Jill Bo Bo Bo

30 Renaming Changes the schema, not the instance Notation: ρ B1,,Bn (R) Example: ρ courseid, cname, term (Course)

31 Renaming Changes the schema, not the instance Notation: ρ B1,,Bn (R) Example: ρ courseid, cname, term (Course) Course cid name sem 445 DB F AI S DB S08 ρ courseid cname term 445 DB F AI S DB S08

32 Natural Join Notation: R 1 R 2 Meaning: R 1 R 2 = Π A (σ C (R 1 R 2 )) Where: The selection σ C checks equality of all common attributes The projection eliminates the duplicate common attributes

33 Natural join example Student sid name 1 Jill 2 Bo 3 Maya Takes sid cid Calculate: Student Takes 20

34 Natural join example Student sid name 1 Jill 2 Bo 3 Maya Takes sid cid Calculate: Student Takes sid name cid 1 Jill Jill Maya

35 Theta Join A join that involves a predicate R1 θ R2 = σ θ (R1 R2) Here θ can be any condition: =, <,,, >, Example: Student age>age Prof

36 Equi-join A theta join where θ is an equality R 1 A=B R 2 = σ A=B (R 1 R 2 ) Very useful join in practice Example: Student sid=sid Takes

37 Review Five basic operators of the Relational Algebra: Union: Difference: - Selection: σ Projection: Π Cartesian Product: Derived or auxiliary operators: Intersection, complement Joins (natural,equi-join, theta join) Renaming: ρ

38 Combining operators: complex expressions Π name,sid (σ name= DB (Course ( Students Takes ))) Π name,sid σ name= DB Course Students Takes

39 In-class exercise Please calculate: Π name,sid (σ title= DB (Course ( Students Takes ))) Course Students Takes cid title sem 445 DB F AI S Arch F08 sid name 1 Jill 2 Bo 3 Maya sid cid

40 Query equivalence Definition: Query Equivalence Two queries Q and Qʼ are equivalent if: for all databases D, Q(D) = Qʼ(D) 26

41 Query equivalence 26

42 Query Optimization Is Based on Algebraic Equivalences Relational algebra has laws of commutativity, associativity, etc. that imply certain expressions are equivalent. They may be different in cost of evaluation! σ c d (R) σ c ( σ d (R) ) R (S T) (R S) T) σ c (R S) σ c (R) S cascading selection join associativity pushing selections Query optimization finds the most efficient representation to evaluate (or one thatʼs not bad)

43 Relational calculus What is a calculus? The term "calculus" means a system of computation The relational calculus is a system of computing with relations 28

44 Relational calculus (in 1 slide) English: Name and sid of students who are taking the course DB

45 Relational calculus (in 1 slide) English: Name and sid of students who are taking the course DB RA: Π name,sid (Students Takes σ name= DB (Course)

46 Relational calculus (in 1 slide) English: Name and sid of students who are taking the course DB RA: Π name,sid (Students Takes σ name= DB (Course) RC: {xname, xsid xcid xterm Students(xsid,xname) Takes(xsid,xcid) Course(xcid, DB, xterm) }

47 Relational calculus (in 1 slide) English: Name and sid of students who are taking the course DB RA: Π name,sid (Students Takes σ name= DB (Course) RC: {xname, xsid xcid xterm Students(xsid,xname) Takes(xsid,xcid) Course(xcid, DB, xterm) } Where are the joins?

48 Algebra v. Calculus Relational Algebra: More operational; very useful for representing execution plans. Relational Calculus: More declarative, basis of SQL The calculus and algebra have equivalent expressive power (Codd) A language that can express this core class of queries is called Relationally Complete