SQL: Queries, Programming, Triggers



Similar documents
SQL: Queries, Programming, Triggers

Example Instances. SQL: Queries, Programming, Triggers. Conceptual Evaluation Strategy. Basic SQL Query. A Note on Range Variables

Chapter 5. SQL: Queries, Constraints, Triggers

Relational Algebra and SQL

Boats bid bname color 101 Interlake blue 102 Interlake red 103 Clipper green 104 Marine red. Figure 1: Instances of Sailors, Boats and Reserves

Θεµελίωση Βάσεων εδοµένων

UNIT 6. Structured Query Language (SQL) Text: Chapter 5

COMP 5138 Relational Database Management Systems. Week 5 : Basic SQL. Today s Agenda. Overview. Basic SQL Queries. Joins Queries

The SQL Query Language. Creating Relations in SQL. Referential Integrity in SQL. Basic SQL Query. Primary and Candidate Keys in SQL

Relational Algebra. Module 3, Lecture 1. Database Management Systems, R. Ramakrishnan 1

Chapter 5 More SQL: Complex Queries, Triggers, Views, and Schema Modification

Proposed solutions Project Assignment #1 (SQL)

The Relational Model. Why Study the Relational Model?

Lecture 6. SQL, Logical DB Design

Query-by-Example (QBE)

Database Security. Chapter 21

INFO/CS 330: Applied Database Systems

The Relational Model. Ramakrishnan&Gehrke, Chapter 3 CS4320 1

Part A: Data Definition Language (DDL) Schema and Catalog CREAT TABLE. Referential Triggered Actions. CSC 742 Database Management Systems

Introduction to Microsoft Jet SQL

The Relational Model. Why Study the Relational Model? Relational Database: Definitions. Chapter 3

More on SQL. Juliana Freire. Some slides adapted from J. Ullman, L. Delcambre, R. Ramakrishnan, G. Lindstrom and Silberschatz, Korth and Sudarshan

The Relational Model. Why Study the Relational Model? Relational Database: Definitions

IT2304: Database Systems 1 (DBS 1)

SQL NULL s, Constraints, Triggers

Relational Database: Additional Operations on Relations; SQL

IT2305 Database Systems I (Compulsory)

4. SQL. Contents. Example Database. CUSTOMERS(FName, LName, CAddress, Account) PRODUCTS(Prodname, Category) SUPPLIERS(SName, SAddress, Chain)

SQL: QUERIES, CONSTRAINTS, TRIGGERS

6 QUERY-BY-EXAMPLE (QBE)

Relational Databases

3. Relational Model and Relational Algebra

Instant SQL Programming

Oracle SQL. Course Summary. Duration. Objectives

Security and Authorization. Introduction to DB Security. Access Controls. Chapter 21

SUBQUERIES AND VIEWS. CS121: Introduction to Relational Database Systems Fall 2015 Lecture 6

Data Modeling. Database Systems: The Complete Book Ch ,

Introduction to database design

Chapter 13: Query Optimization

There are five fields or columns, with names and types as shown above.

CS2Bh: Current Technologies. Introduction to XML and Relational Databases. The Relational Model. The relational model

EECS 647: Introduction to Database Systems

Outline. Data Modeling. Conceptual Design. ER Model Basics: Entities. ER Model Basics: Relationships. Ternary Relationships. Yanlei Diao UMass Amherst

Answer Key. UNIVERSITY OF CALIFORNIA College of Engineering Department of EECS, Computer Science Division

Week 4 & 5: SQL. SQL as a Query Language

Relational Division and SQL

Oracle Database: SQL and PL/SQL Fundamentals

Oracle Database: SQL and PL/SQL Fundamentals NEW

1 Structured Query Language: Again. 2 Joining Tables

Lecture 4: More SQL and Relational Algebra

Introduction to SQL: Data Retrieving

Review Entity-Relationship Diagrams and the Relational Model. Data Models. Review. Why Study the Relational Model? Steps in Database Design

History of SQL. Relational Database Languages. Tuple relational calculus ALPHA (Codd, 1970s) QUEL (based on ALPHA) Datalog (rule-based, like PROLOG)

Advance DBMS. Structured Query Language (SQL)

Comp 5311 Database Management Systems. 3. Structured Query Language 1

Databases 2011 The Relational Model and SQL

SQL Tables, Keys, Views, Indexes

Procedural Extension to SQL using Triggers. SS Chung

Databases and BigData

SQL SELECT Query: Intermediate

DBMS / Business Intelligence, SQL Server

A Comparison of Database Query Languages: SQL, SPARQL, CQL, DMX

Duration Vendor Audience 5 Days Oracle End Users, Developers, Technical Consultants and Support Staff

2874CD1EssentialSQL.qxd 6/25/01 3:06 PM Page 1 Essential SQL Copyright 2001 SYBEX, Inc., Alameda, CA

Oracle Database: SQL and PL/SQL Fundamentals

BCA. Database Management System

Introducción a las bases de datos SQL Libro de referencia

CS143 Notes: Views & Authorization

Chapter 6: Integrity Constraints

Chapter 8. SQL-99: SchemaDefinition, Constraints, and Queries and Views

Oracle Database 10g: Introduction to SQL

Information Systems SQL. Nikolaj Popov

Chapter 14: Query Optimization

Oracle Database 12c: Introduction to SQL Ed 1.1

Financial Data Access with SQL, Excel & VBA

Data Structure: Relational Model. Programming Interface: JDBC/ODBC. SQL Queries: The Basic From

The Relational Data Model and Relational Database Constraints

Programming with SQL

Microsoft Access 3: Understanding and Creating Queries

SQL DATA DEFINITION: KEY CONSTRAINTS. CS121: Introduction to Relational Database Systems Fall 2015 Lecture 7

Introduction to SQL for Data Scientists

SQL Simple Queries. Chapter 3.1 V3.0. Napier University Dr Gordon Russell

Elena Baralis, Silvia Chiusano Politecnico di Torino. Pag. 1. Active database systems. Triggers. Triggers. Active database systems.

Intermediate SQL C H A P T E R4. Practice Exercises. 4.1 Write the following queries in SQL:

How To Create A Table In Sql (Ahem)

Chapter 6: Physical Database Design and Performance. Database Development Process. Physical Design Process. Physical Database Design

Database Management Systems. Chapter 1

SQL Server for developers. murach's TRAINING & REFERENCE. Bryan Syverson. Mike Murach & Associates, Inc. Joel Murach

CSI 2132 Lab 3. Outline 09/02/2012. More on SQL. Destroying and Altering Relations. Exercise: DROP TABLE ALTER TABLE SELECT

Relational model. Relational model - practice. Relational Database Definitions 9/27/11. Relational model. Relational Database: Terminology

Why Is This Important? Database Application Development. SQL in Application Code. Overview. SQL in Application Code (Contd.

CSC 443 Data Base Management Systems. Basic SQL

The process of database development. Logical model: relational DBMS. Relation


CSE 530A Database Management Systems. Introduction. Washington University Fall 2013

A basic create statement for a simple student table would look like the following.

Review: Participation Constraints

Physical Design. Meeting the needs of the users is the gold standard against which we measure our success in creating a database.

In This Lecture. Security and Integrity. Database Security. DBMS Security Support. Privileges in SQL. Permissions and Privilege.

Oracle Database 11g SQL

Transcription:

SQL: Queries, Programming, Triggers CSC343 Introduction to Databases - A. Vaisman 1 R1 Example Instances We will use these instances of the Sailors and Reserves relations in our examples. If the key for the Reserves relation contained only the attributes sid and bid, how would the semantics differ? S1 S2 sid bid day 22 101 10/10/96 58 103 11/12/96 sid sname rating age 22 dustin 7 45.0 31 lubber 8 55.5 58 rusty 10 35.0 sid sname rating age 28 yuppy 9 35.0 31 lubber 8 55.5 44 guppy 5 35.0 58 rusty 10 35.0 CSC343 Introduction to Databases - A. Vaisman 2 Basic SQL Query SELECT FROM WHERE [DISTINCT] target-list relation-list qualification relation-list A list of relation names (possibly with a range-variable after each name). target-list A list of attributes of relations in relation-list qualification Comparisons (Attr op const or Attr1 op Attr2, where op is one of < <,>,=,<=,>==,like), >, =,,, combined using AND, OR and NOT. DISTINCT is an optional keyword indicating that the answer should not contain duplicates. Default is that duplicates are not eliminated! Conceptual Evaluation Strategy Semantics of an SQL query defined in terms of the following conceptual evaluation strategy: Compute the cross-product of relation-list. Discard resulting tuples if they fail qualifications. Delete attributes that are not in target-list. If DISTINCT is specified, eliminate duplicate rows. This strategy is probably the least efficient way to compute a query! An optimizer will find more efficient strategies to compute the same answers. CSC343 Introduction to Databases - A. Vaisman 3 CSC343 Introduction to Databases - A. Vaisman 4

Conceptual Evaluation Strategy Semantics of an SQL query based on R.A: SELECT R.A,S.B FROM R, S WHERE R.C=S.C ==============> Π R.A,S.B σ R.C=S.C (R x S) Example of Conceptual Evaluation, Reserves R ---->range variable WHERE S.sid=R.sid AND R.bid=103 (sid) sname rating age (sid) bid day 22 dustin 7 45.0 22 101 10/10/96 22 dustin 7 45.0 58 103 11/12/96 31 lubber 8 55.5 22 101 10/10/96 31 lubber 8 55.5 58 103 11/12/96 58 rusty 10 35.0 22 101 10/10/96 58 rusty 10 35.0 58 103 11/12/96 CSC343 Introduction to Databases - A. Vaisman 5 CSC343 Introduction to Databases - A. Vaisman 6 A Note on Range Variables Find sailors who ve reserved at least one boat OR Really needed only if the same relation appears twice in the FROM clause. The previous query can also be written as:, Reserves R WHERE S.sid=R.sid AND bid=103 SELECT sname FROM Sailors, Reserves WHERE Sailors.sid=Reserves.sid ANDbid=103 It is good style, however, to use range variables always! CSC343 Introduction to Databases - A. Vaisman 7, Reserves R WHERE S.sid=R.sid Would adding DISTINCT to this query make a difference? What is the effect of replacing S.sid by S.snamein the SELECT clause? Would adding DISTINCT to this variant of the query make a difference?. CSC343 Introduction to Databases - A. Vaisman 8

Expressions and Strings SELECT S.age, age1=s.age-5, 2*S.age AS age2 WHERE S.sname LIKE B_%B Illustrates use of arithmetic expressions and string pattern matching: Find triples (of ages of sailors and two fields defined by expressions) for sailors whose names begin and end with B and contain at least three characters. AS and = are two ways to name fields in result. LIKE is used for string matching. `_ stands for any one character and `% stands for 0 or more arbitrary characters. CSC343 Introduction to Databases - A. Vaisman 9 Find sid s of sailors who ve reserved a red or a green boat UNION: Can be used to compute the union of any two union-compatible sets of tuples (which are themselves the result of SQL queries). If we replace OR by AND in the first version, what do we get? Also available: EXCEPT (What do we get if we replace UNION by EXCEPT?), Boats B, Reserves R AND(B.color= red OR B.color= green ), Boats B, Reserves R ANDB.color= red UNION, Boats B, Reserves R ANDB.color= green CSC343 Introduction to Databases - A. Vaisman 10 Find sid s of sailors who ve reserved a red and a green boat, Boats B1, Reserves R1, INTERSECT: Can be used to Boats B2, Reserves R2 compute the intersection WHERE S.sid=R1.sid AND R1.bid=B1.bid of any two unioncompatible sets of tuples. AND S.sid=R2.sid AND R2.bid=B2.bid AND(B1.color= red AND B2.color= green ) Included in the SQL/92 Key field! standard, but some systems don t support it., Boats B, Reserves R ANDB.color= red INTERSECT, Boats B, Reserves R ANDB.color= green CSC343 Introduction to Databases - A. Vaisman 11 Nested Queries Find names of sailors who ve reserved boat #103: WHERE S.sid IN (SELECT R.sid FROM Reserves R WHERE R.bid=103) A very powerful feature of SQL: a WHERE clause can itself contain an SQL query! (Actually, so can FROM and HAVING clauses, not supported by all systems.) To find sailors who ve not reserved #103, use NOT IN. To understand semantics of nested queries, think of a nested loopsevaluation: For each Sailors tuple, check the qualification by computing the subquery. CSC343 Introduction to Databases - A. Vaisman 12

Nested Queries with Correlation Find names of sailors who ve reserved boat #103: WHERE EXISTS (SELECT * FROM Reserves R WHERE R.bid=103 AND S.sid=R.sid) EXISTS is another set comparison operator, like IN. If UNIQUE is used, and * is replaced by R.bid, finds sailors with at most one reservation for boat #103. (UNIQUE checks for duplicate tuples; * denotes all attributes. Why do we have to replace * by R.bid?) Illustrates why, in general, subquery must be recomputed for each Sailors tuple. CSC343 Introduction to Databases - A. Vaisman 13 More on Set-Comparison Operators We ve already seen IN, EXISTS and UNIQUE. Can also use NOT IN, NOT EXISTS and NOT UNIQUE. Also available: op ANY, op ALL, op IN >, <, =,,, Find sailors whose rating is greater than that of some sailor called Horatio: SELECT * WHERE S.rating > ANY (SELECT S2.rating 2 WHERE S2.sname= Horatio ) CSC343 Introduction to Databases - A. Vaisman 14 Rewriting INTERSECT Queries Using IN Find sid s of sailors who ve reserved both a red and a green boat:, Boats B, Reserves R AND B.color= red AND S.sid IN (SELECT S2.sid 2, Boats B2, Reserves R2 WHERE S2.sid=R2.sid AND R2.bid=B2.bid AND B2.color= green ) Similarly, EXCEPT queries re-written using NOT IN. To find names (not sid s) of Sailors who ve reserved both red and green boats, just replace S.sid by S.sname in SELECT clause. (What about INTERSECT query?) CSC343 Introduction to Databases - A. Vaisman 15 Division in SQL Find sailors who ve reserved all boats. Let s do it the hard way, without EXCEPT: (2) WHERE NOT EXISTS (SELECT B.bid FROM Boats B WHERE NOT EXISTS ((SELECT B.bid FROM Boats B) EXCEPT (SELECT R.bid FROM Reserves R WHERE R.sid=S.sid)) WHERE NOT EXISTS (SELECT Sailors S such that... R.bid FROM Reserves R there is no boat B without... WHERE R.bid=B.bid AND R.sid=S.sid)) a Reserves tuple showing S reserved B CSC343 Introduction to Databases - A. Vaisman 16 (1)

Aggregate Operators Significant extension of relational algebra. SELECT COUNT (*) SELECT AVG (S.age) WHERE S.rating=10 COUNT (*) COUNT ( [DISTINCT] A) SUM ( [DISTINCT] A) AVG ( [DISTINCT] A) MAX (A) MIN (A) single column WHERE S.rating= (SELECT MAX(S2.rating) 2) SELECT COUNT (DISTINCT S.rating) SELECT AVG ( DISTINCT S.age) WHERE S.sname= Bob WHERE S.rating=10 CSC343 Introduction to Databases - A. Vaisman 17 Find name and age of the oldest sailor(s) The first query is illegal! (We ll look into the reason a bit later, when we discuss GROUP BY.) The third query is equivalent to the second query, and is allowed in the SQL/92 standard, but is not supported in some systems., MAX (S.age), S.age WHERE S.age = (SELECT MAX (S2.age) 2), S.age WHERE (SELECT MAX (S2.age) 2) = S.age CSC343 Introduction to Databases - A. Vaisman 18 GROUP BY and HAVING So far, we ve applied aggregate operators to all (qualifying) tuples. Sometimes, we want to apply them to each of several groupsof tuples. Consider: Find the age of the youngest sailor for each rating level. In general, we don t know how many rating levels exist, and what the rating values for these levels are! Suppose we know that rating values go from 1 to 10; we can write 10 queries that look like this (!): For i = 1, 2,..., 10: SELECT MIN (S.age) WHERE S.rating = i CSC343 Introduction to Databases - A. Vaisman 19 Queries With GROUP BY and HAVING SELECT [DISTINCT] target-list FROM relation-list WHERE qualification GROUP BY grouping-list HAVING group-qualification The target-list contains (i) attribute names (ii) terms with aggregate operations (e.g., MIN (S.age)). The attribute list (i) must be a subset of grouping-list. Intuitively, each answer tuple corresponds to a group, and these attributes must have a single value per group. (A group is a set of tuples that have the same value for all attributes in grouping-list.) CSC343 Introduction to Databases - A. Vaisman 20

Find the age of the youngest sailor with age 18, for each rating with at least 2 such sailors SELECT S.rating, MIN (S.age) WHERE S.age >= 18 GROUP BY S.rating HAVING COUNT (*) > 1 Only S.rating and S.age are mentioned in the SELECT, GROUP BY or HAVING clauses; 2nd column of result is unnamed. (Use AS to name it.) sid sname rating age 22 dustin 7 45.0 31 lubber 8 55.5 71 zorba 10 16.0 64 horatio 7 35.0 29 brutus 1 33.0 58 rusty 10 35.0 rating age 1 33.0 7 45.0 7 35.0 8 55.5 10 35.0 rating 7 35.0 Answer relation CSC343 Introduction to Databases - A. Vaisman 21 For each red boat, find the number of reservations for this boat SELECT B.bid, COUNT (*) AS scount, Boats B, Reserves R AND B.color= red GROUP BY B.bid Grouping over a join of three relations. CSC343 Introduction to Databases - A. Vaisman 22 Find the age of the youngest sailor with age > 18, for each rating with at least 2 sailors (of any age) SELECT S.rating, MIN (S.age) WHERE S.age > 18 GROUP BY S.rating HAVING 1 < (SELECT COUNT (*) 2 WHERE S.rating=S2.rating) Shows HAVING clause can also contain a subquery. Compare this with the query where we considered only ratings with 2 sailors over 18! Find those ratings for which the average age is the minimum over all ratings Aggregate operations cannot be nested! Correct solution (in SQL/92): SELECT Temp.rating, Temp.avgage FROM (SELECT S.rating, AVG (S.age) AS avgage GROUP BY S.rating) AS Temp WHERE Temp.avgage = (SELECT MIN (Temp.avgage) FROM Temp) CSC343 Introduction to Databases - A. Vaisman 23 CSC343 Introduction to Databases - A. Vaisman 24

Null Values Field values in a tuple are sometimes unknown (e.g., a rating has not been assigned) or inapplicable (e.g., no spouse s name). SQL provides a special value null for such situations. The presence of null complicates many issues. E.g.: Special operators needed to check if value is/is not null. Is rating>8 true or false when rating is equal to null? What about AND, OR and NOT connectives? We need a 3-valued logic (true, false and unknown). Meaning of constructs must be defined carefully. (e.g., WHERE clause eliminates rows that don t evaluate to true.) New operators (in particular, outer joins) possible/needed. CSC343 Introduction to Databases - A. Vaisman 25 Integrity Constraints (Review) An IC describes conditions that every legal instance of a relation must satisfy. Inserts/deletes/updates that violate IC s are disallowed. Can be used to ensure application semantics (e.g., sid is a key), or prevent inconsistencies (e.g., sname has to be a string, age must be < 200) Types of IC s: Domain constraints, primary key constraints, foreign key constraints, general constraints. Domain constraints: Field values must be of right type. Always enforced. CSC343 Introduction to Databases - A. Vaisman 26 General Constraints Useful when more general ICs than keys are involved. Can use queries to express constraint. Constraints can be named. CREATE TABLE Sailors ( sid INTEGER, sname CHAR(10), rating INTEGER, age REAL, PRIMARY KEY (sid), CHECK ( rating >= 1 AND rating <= 10 ) CREATE TABLE Reserves ( sname CHAR(10), bid INTEGER, day DATE, PRIMARY KEY (bid,day), CONSTRAINT nointerlakeres CHECK (`Interlake <> ( SELECT B.bname Boats B FROM WHERE B.bid=bid))) CSC343 Introduction to Databases - A. Vaisman 27 Constraints Over Multiple Relations Awkward and wrong! If Sailors is empty, the number of Boats tuples can be anything! ASSERTION is the right solution; not associated with either table. CREATE TABLE Sailors ( sid INTEGER, sname CHAR(10), rating INTEGER, age REAL, PRIMARY KEY (sid) ) CREATE ASSERTION smallclub Number of boats plus number of sailors is < 100 CHECK ( (SELECT COUNT (S.sid) ) + (SELECT COUNT (B.bid) FROM Boats B) < 100 ) CSC343 Introduction to Databases - A. Vaisman 28

Triggers Triggers: Example (SQL:1999) Trigger: procedure that starts automatically if specified changes occur to the DBMS Three parts (ECA rules): Event (activates the trigger) Condition (tests whether the triggers should run) Action (what happens if the trigger runs) CREATE TRIGGER youngsailorupdate AFTER INSERT ON SAILORS REFERENCING NEW TABLE NewSailors FOR EACH STATEMENT INSERT INTO YoungSailors(sid, name, age, rating) SELECT sid, name, age, rating FROM NewSailors N WHERE N.age <= 18 CSC343 Introduction to Databases - A. Vaisman 29 CSC343 Introduction to Databases - A. Vaisman 30 Summary SQL was an important factor in the early acceptance of the relational model; more natural than earlier, procedural query languages. Relationally complete; in fact, significantly more expressive power than relational algebra. Even queries that can be expressed in RA can often be expressed more naturally in SQL. Many alternative ways to write a query; optimizer should look for most efficient evaluation plan. In practice, users need to be aware of how queries are optimized and evaluated for best results. Summary (Contd.) NULL for unknown field values brings many complications SQL allows specification of rich integrity constraints Triggers respond to changes in the database CSC343 Introduction to Databases - A. Vaisman 31 CSC343 Introduction to Databases - A. Vaisman 32