EXTENDED RELATIONAL ALGEBRA OUTERJOINS, GROUPING/AGGREGATION INSERT/DELETE/UPDATE

Similar documents
More SQL. Extended Relational Algebra Outerjoins, Grouping/Aggregation Insert/Delete/Update

SQL Continued! Outerjoins, Aggregations, Grouping, Data Modification

Introduction to SQL. Multirelation Queries Subqueries. Slides are reused by the approval of Jeffrey Ullman s

Database Design and Programming

Subqueries. Must use a tuple-variable to name tuples of the result

Why SQL? SQL is a very-high-level language. Database management system figures out best way to execute query

Chapter 6 The database Language SQL as a tutorial

Introduction to SQL. Select-From-Where Statements Multirelation Queries Subqueries

Grouping Operator. Applying γ L (R) Recall: Outerjoin. Example: Grouping/Aggregation. γ A,B,AVG(C)->X (R) =??

The Extended Algebra. Duplicate Elimination. Sorting. Example: Duplicate Elimination

Introduction to SQL. Select-From-Where Statements Multirelation Queries Subqueries. Slides are reused by the approval of Jeffrey Ullman s

CS 317/387. A Relation is a Table. Schemas. Towards SQL - Relational Algebra. name manf Winterbrew Pete s Bud Lite Anheuser-Busch Beers

Introduction to SQL SELECT-FROM-WHERE STATEMENTS SUBQUERIES DATABASE SYSTEMS AND CONCEPTS, CSCI 3030U, UOIT, COURSE INSTRUCTOR: JAREK SZLICHTA

SQL: Data Manipulation Language

CSC 343 Winter SQL: Aggregation, Joins, and Triggers MICHAEL LIUT

Chapter 6 The database Language SQL as a tutorial

CS 464/564 Introduction to Database Management System Instructor: Abdullah Mueen

Databases 1. Defining Tables, Constraints

I Relational Database Modeling how to define

I Relational Database Modeling how to define

Chapter 2 The relational Model of data. Relational model introduction

Databases-1 Lecture-01. Introduction, Relational Algebra

Structured Query Language Continued. Rose-Hulman Institute of Technology Curt Clifton

Beersèname, manfè. Likesèdrinker, beerè. Sellsèbar, beer, priceè. Frequentsèdrinker, barè

SQL. The Basics Advanced Manipulation Constraints Authorization 1. 1

Constraints. Local and Global Constraints Triggers

Transactions, Views, Indexes. Controlling Concurrent Behavior Virtual and Materialized Views Speeding Accesses to Data

Views, Indexes, Authorization. Views. Views 8/6/18. Virtual and Materialized Views Speeding Accesses to Data Grant/Revoke Priviledges

A tuple is dangling if it doesn't join with any

CS145 Introduction. About CS145 Relational Model, Schemas, SQL Semistructured Model, XML

CSCI3030U Database Models

Entity-Relationship Model. Purpose of E/R Model

CS54100: Database Systems

SQL DATA DEFINITION LANGUAGE

SQL DATA DEFINITION LANGUAGE

SQL: Data Definition Language

Constraints and Triggers

SQL DATA DEFINITION LANGUAGE

Likesèdrinker, beerè. Sellsèbar, beer, priceè. Frequentsèdrinker, barè

Missing Information. We ve assumed every tuple has a value for every attribute. But sometimes information is missing. Two common scenarios:

From E/R Diagrams to Relations

CS3DB3/SE4DB3/SE6DB3 TUTORIAL

Database Usage (and Construction)

The Relational Model

CS54100: Database Systems

CS3DB3/SE4DB3/SE6M03 TUTORIAL

Recap and Schedule. Till Now: Today: Ø Query Languages: Relational Algebra; SQL. Ø Datalog A logical query language. Ø SQL Recursion.

e e Conceptual design begins with the collection of requirements and results needed from the database (ER Diag.)

Most database operations involve On- Line Transaction Processing (OTLP).

Introduction to Transactions: Controlling Concurrent "Behavior" Virtual and Materialized Views" Indexes: Speeding Accesses to Data"

Relational Algebra and SQL

On-Line Application Processing

Relational Model, Relational Algebra, and SQL

Entity-Relationship Model

Relational Algebra. ICOM 5016 Database Systems. Roadmap. R.A. Operators. Selection. Example: Selection. Relational Algebra. Fundamental Property

Object-Oriented Database Languages. Object Description Language Object Query Language

Interpretation is not exactly ëmissing value." There could be many reasons why no value is

SQL queries II. Set operations and joins

Relational Algebra BASIC OPERATIONS DATABASE SYSTEMS AND CONCEPTS, CSCI 3030U, UOIT, COURSE INSTRUCTOR: JAREK SZLICHTA

types, but key declarations and constraints Similar CREATE X commands for other schema ëdrop X name" deletes the created element of beer VARCHARè20è,

Relational Databases

CSCD43: Database Systems Technology. Lecture 4

Warehousing. Data Mining

Relational Algebra. B term 2004: lecture 10, 11

SQL: Data Manipulation Language. csc343, Introduction to Databases Diane Horton Winter 2017

SQL: csc343, Introduction to Databases Renée J. Miller and Fatemeh Nargesian and Sina Sina Meraji. Winter 2018

Design Techniques. 1. Avoid redundancy 2. Limit the use of weak entity sets 3. Don t use an entity set when an attribute will do

SQL Aggregation and Grouping. Outline

SQL Aggregation and Grouping. Davood Rafiei

CSCB20 Week 4. Introduction to Database and Web Application Programming. Anna Bretscher Winter 2017

Relational Algebra and SQL. Basic Operations Algebra of Bags

T-SQL Training: T-SQL for SQL Server for Developers

From Relational Algebra to the Structured Query Language. Rose-Hulman Institute of Technology Curt Clifton

Midterm Review. Winter Lecture 13

Today s topics. Null Values. Nulls and Views in SQL. Standard Boolean 2-valued logic 9/5/17. 2-valued logic does not work for nulls

Outerjoins, Constraints, Triggers

CompSci 516: Database Systems

Announcements (September 18) SQL: Part II. Solution 1. Incomplete information. Solution 3? Solution 2. Homework #1 due today (11:59pm)

5.2 E xtended Operators of R elational Algebra

Lecture 3 SQL. Shuigeng Zhou. September 23, 2008 School of Computer Science Fudan University

Relational Algebra. Algebra of Bags

SQL: Part II. Announcements (September 18) Incomplete information. CPS 116 Introduction to Database Systems. Homework #1 due today (11:59pm)

Introduction to Database Systems CSE 444

Basic form of SQL Queries

COMP 330: SQL 3. Chris Jermaine and Kia Teymourian Rice University

Chapter 7: Constraints and Triggers. Foreign Keys Local and Global Constraints Triggers

RELATIONAL DATA MODEL: Relational Algebra

CIS 330: Applied Database Systems

Announcements (September 14) SQL: Part I SQL. Creating and dropping tables. Basic queries: SFW statement. Example: reading a table

ER Model. CSC 343 Winter 2018 MICHAEL LIUT

CS 464/564 Introduction to Database Management System Instructor: Abdullah Mueen

Contains slides made by Naci Akkøk, Pål Halvorsen, Arthur M. Keller, Vera Goebel

Introduction to Database Systems CSE 414

Chapter 2 The relational Model of data. Relational algebra

Relational Query Languages

CSE 544 Principles of Database Management Systems

CSC Web Programming. Introduction to SQL

SQL: Part II. Introduction to Databases CompSci 316 Fall 2018

The Relational Data Model. Functional Dependencies. Example. Functional Dependencies

Logical Query Languages. Motivation: 1. Logical rules extend more naturally to. recursive queries than does relational algebra. Used in SQL recursion.

Transcription:

More SQL EXTENDED RELATIONAL ALGEBRA OUTERJOINS, GROUPING/AGGREGATION INSERT/DELETE/UPDATE 1

The Extended Algebra δ = eliminate duplicates from bags. τ = sort tuples. γ = grouping and aggregation. Outerjoin : avoids dangling tuples = tuples that do not join with anything. 2

Duplicate Elimination R1 := δ(r2). R1 consists of one copy of each tuple that appears in R2 one or more times. 3

Example: Duplicate Elimination R = ( A B ) 1 2 3 4 1 2 δ(r) = A B 1 2 3 4 4

Sorting R1 := τ L (R2). L is a list of some of the attributes of R2. R1 is the list of tuples of R2 sorted first on the value of the first attribute on L, then on the second attribute of L, and so on. Break ties arbitrarily. τ is the only operator whose result is neither a set nor a bag. 5

Example: Sorting R = ( A B ) 1 3 3 4 5 2 τ B (R) = [(5,2), (1,3), (3,4)] 6

Aggregation Operators They apply to entire columns of a table and produce a single result. The most important examples: SUM, AVG, COUNT, MIN, and MAX. 7

Example: Aggregation R = ( A B ) 1 3 3 4 3 2 SUM(A) = 7 COUNT(A) = 3 MAX(B) = 4 AVG(B) = 3 8

Grouping Operator R1 := γ L (R2). L is a list of elements that are either: 1. Individual (grouping ) attributes. 2. AGG(A ), where AGG is one of the aggregation operators and A is an attribute. An arrow and a new attribute name renames the component. 9

Applying γ L (R) Group R according to all the grouping attributes on list L. That is: form one group for each distinct list of values for those attributes in R. Within each group, compute AGG(A ) for each aggregation on list L. Result has one tuple for each group: 1. The grouping attributes and 2. Their group s aggregations. 10

Example: Grouping/Aggregation R = ( A B C ) 1 2 3 4 5 6 1 2 5 γ A,B,AVG(C)->X (R) =?? First, group R by A and B : A B C 1 2 3 1 2 5 4 5 6 Then, average C within groups: A B X 1 2 4 4 5 6 11

Outerjoin Suppose we join R C S. A tuple of R that has no tuple of S with which it joins is said to be dangling. Similarly for a tuple of S. Outerjoin preserves dangling tuples by padding them NULL. 12

Example: Outerjoin R = ( A B ) S = ( B C ) 1 2 2 3 4 5 6 7 (1,2) joins with (2,3), but the other two tuples are dangling. R OUTERJOIN S = A B C 1 2 3 4 5 NULL NULL 6 7 13

Now --- Back to SQL EACH OPERATION HAS A SQL EQUIVALENT 14

SQL Outerjoins syntax R OUTER JOIN S is the core of an outerjoin expression. It is modified by: 1. Optional NATURAL in front of OUTER. 2. Optional ON <condition> after JOIN S. 3. Optional LEFT, RIGHT, or FULL before OUTER. LEFT = pad dangling tuples of R only. RIGHT = pad dangling tuples of S only. FULL = pad both; this choice is the default. Only one of these 15

Aggregations SUM, AVG, COUNT, MIN, and MAX can be applied to a column in a SELECT clause to produce that aggregation on the column. Also, COUNT(*) counts the number of tuples. 16

Example: Aggregation From Sells(bar, beer, price), find the average price of Bud: SELECT AVG(price) FROM Sells WHERE beer = Bud ; 17

Eliminating Duplicates in an Aggregation Use DISTINCT inside an aggregation. Example: find the number of different prices charged for Bud: SELECT COUNT(DISTINCT price) FROM Sells WHERE beer = Bud ; 18

NULL s Ignored in Aggregation NULL never contributes to a sum, average, or count, and can never be the minimum or maximum of a column. But if there are no non-null values in a column, then the result of the aggregation is NULL. Exception: COUNT of an empty table is 0. 19

Example: Effect of NULL s SELECT count(*) FROM Sells WHERE beer = Bud ; The number of bars that sell Bud. SELECT count(price) FROM Sells WHERE beer = Bud ; The number of bars that sell Bud at a known price. 20

Grouping We may follow a SELECT-FROM-WHERE expression by GROUP BY and a list of attributes. The relation that results from the SELECT-FROM-WHERE is grouped according to the values of all those attributes, and any aggregation is applied only within each group. 21

Example: Grouping From Sells(bar, beer, price), find the average price for each beer: SELECT beer, AVG(price) FROM Sells GROUP BY beer; beer AVG(price) Bud 2.33 Miller 2.23 22

Example: Grouping From Sells(bar, beer, price) and Frequents(drinker, bar), find for each drinker the average price of Bud at the bars they frequent: SELECT drinker, AVG(price) FROM Frequents, Sells WHERE beer = Bud AND Frequents.bar = Sells.bar GROUP BY drinker; Compute all drinker-barprice triples for Bud. Then group them by drinker. 23

Restriction on SELECT Lists With Aggregation If any aggregation is used, then each element of the SELECT list must be either: 1. Aggregated, or 2. An attribute on the GROUP BY list. 24

HAVING Clauses HAVING <condition> may follow a GROUP BY clause. If so, the condition applies to each group, and groups not satisfying the condition are eliminated. 25

Example: HAVING From Sells(bar, beer, price) and Beers(name, manf), find the average price of those beers that are either served in at least three bars or are manufactured by Pete s. 26

Solution SELECT beer, AVG(price) FROM Sells GROUP BY beer HAVING COUNT(bar) >= 3 OR beer IN (SELECT name FROM Beers WHERE manf = Pete s ); Beer groups with at least 3 non-null bars or beer groups where the manufacturer is Pete s. Beers manufactured by Pete s. 27

Requirements on HAVING Conditions Anything goes in a subquery. Outside subqueries, they may refer to attributes only if they are either: 1. A grouping attribute, or 2. Aggregated (same condition as for SELECT clauses with aggregation). 28

Database Modifications A modification command does not return a result (as a query does), but changes the database in some way. Three kinds of modifications: 1. Insert a tuple or tuples. 2. Delete a tuple or tuples. 3. Update the value(s) of an existing tuple or tuples. 29

Insertion To insert a single tuple: INSERT INTO <relation> VALUES ( <list of values> ); Example: add to Likes(drinker, beer) the fact that Sally likes Bud. INSERT INTO Likes VALUES( Sally, Bud ); 30

Specifying Attributes in INSERT We may add to the relation name a list of attributes. Two reasons to do so: 1. We forget the standard order of attributes for the relation. 2. We don t have values for all attributes, and we want the system to fill in missing components with NULL or a default value. 31

Example: Specifying Attributes Another way to add the fact that Sally likes Bud to Likes(drinker, beer): INSERT INTO Likes(beer, drinker) VALUES( Bud, Sally ); 32

Adding Default Values In a CREATE TABLE statement, we can follow an attribute by DEFAULT and a value. When an inserted tuple has no value for that attribute, the default will be used. 33

Example: Default Values CREATE TABLE Drinkers ( name CHAR(30) PRIMARY KEY, addr CHAR(50) DEFAULT 123 Sesame St., phone CHAR(16) ); 34

Example: Default Values INSERT INTO Drinkers(name) VALUES( Sally ); Resulting tuple: name address phone Sally 123 Sesame St NULL 35

Inserting Many Tuples We may insert the entire result of a query into a relation, using the form: INSERT INTO <relation> ( <subquery> ); 36

Example: Insert a Subquery Using Frequents(drinker, bar), enter into the new relation PotBuddies(name) all of Sally s potential buddies, i.e., those drinkers who frequent at least one bar that Sally also frequents. 37

The other drinker Solution INSERT INTO PotBuddies (SELECT d2.drinker FROM Frequents d1, Frequents d2 WHERE d1.drinker = Sally AND ); d2.drinker <> Sally AND d1.bar = d2.bar Pairs of Drinker tuples where the first is for Sally, the second is for someone else, and the bars are the same. 38

Deletion To delete tuples satisfying a condition from some relation: DELETE FROM <relation> WHERE <condition>; 39

Example: Deletion Delete from Likes(drinker, beer) the fact that Sally likes Bud: DELETE FROM Likes WHERE drinker = Sally AND beer = Bud ; 40

Example: Delete all Tuples Make the relation Likes empty: DELETE FROM Likes; Note no WHERE clause needed. 41

Example: Delete Some Tuples Delete from Beers(name, manf) all beers for which there is another beer by the same manufacturer. Beers with the same manufacturer and DELETE FROM Beers b1 a different name WHERE EXISTS ( from the name of the beer represented SELECT name FROM Beers b2 by tuple b. WHERE b1.manf = b2.manf AND b1.name <> b2.name); 42

Semantics of Deletion --- (1) Suppose Anheuser-Busch makes only Bud and Bud Lite. Suppose we come to the tuple b for Bud first. The subquery is nonempty, because of the Bud Lite tuple, so we delete Bud. Now, when b is the tuple for Bud Lite, do we delete that tuple too? 43

Semantics of Deletion --- (2) Answer: we do delete Bud Lite as well. The reason is that deletion proceeds in two stages: 1. Mark all tuples for which the WHERE condition is satisfied. 2. Delete the marked tuples. 44

Updates To change certain attributes in certain tuples of a relation: UPDATE <relation> SET <list of attribute assignments> WHERE <condition on tuples>; 45

Example: Update Change drinker Fred s phone number to 555-1212: UPDATE Drinkers SET phone = 555-1212 WHERE name = Fred ; 46

Example: Update Several Tuples Make $4 the maximum price for beer: UPDATE Sells SET price = 4.00 WHERE price > 4.00; 47

Actions Review slides. Read chapter about SQL (Chapters 6.1-4 in 2nd Edition of course book). Play with SQL w3schools.com 48