1 of 52

SQL: Queries, Programming, Triggers

Chapter 5

Database Management Systems, R. Ramakrishnan and J. Gehrke

1

2 of 52

SQL

  • most widely used commercial relational db language
  • originally developed at IBM
  • SQL:1999: current ANSI/ISO standard for SQL

Database Management Systems, R. Ramakrishnan and J. Gehrke

2

3 of 52

SQL

  • Data Definition Language (DDL): subset of SQL that supports creation, deletion, and modification of definitions for tables and views. Other aspects: define integrity constraints on tables; specify access rights or privileges to tables or views
  • Data Manipulation Language (DML): subset of SQL that allows users to pose queries and to insert, delete, and modify rows.
  • Other aspects in pages 131-132

Database Management Systems, R. Ramakrishnan and J. Gehrke

3

4 of 52

Example tables

Sailors(sid: integer, sname: string, rating: integer, age: real)

​

Boats(bid: integer, bname: string, color: string)

​

Reserves(sid: integer, bid: integer, day: date)

​

​

Database Management Systems, R. Ramakrishnan and J. Gehrke

4

5 of 52

Example Instances

  • We will use these instances of the Sailors and Reserves relations in our examples.

R1

S1

S2

Database Management Systems, R. Ramakrishnan and J. Gehrke

5

6 of 52

Basic SQL Query

  • 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 ) 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!

SELECT [DISTINCT] target-list

FROM relation-list

WHERE qualification

Database Management Systems, R. Ramakrishnan and J. Gehrke

6

7 of 52

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.

Database Management Systems, R. Ramakrishnan and J. Gehrke

7

8 of 52

Example of Conceptual Evaluation

SELECT S.sname

FROM Sailors S, Reserves R

WHERE S.sid=R.sid AND R.bid=103

Database Management Systems, R. Ramakrishnan and J. Gehrke

8

9 of 52

A Note on Range Variables

  • Really needed only if the same relation appears twice in the FROM clause. The previous query can also be written as:

SELECT S.sname

FROM Sailors S, Reserves R

WHERE S.sid=R.sid AND bid=103

SELECT sname

FROM Sailors, Reserves

WHERE Sailors.sid=Reserves.sid

AND bid=103

It is good style,

however, to use

range variables

always!

OR

Database Management Systems, R. Ramakrishnan and J. Gehrke

9

10 of 52

Example queries

(Q15) Find the names and ages of all sailors. (see text pp. 134-135)

​

(Q11) Find all sailors with a rating above 7. (see text pp. 135)

Database Management Systems, R. Ramakrishnan and J. Gehrke

10

11 of 52

(Q4) Find sailors who’ve reserved at least one boat

  • Would adding DISTINCT to this query make a difference?
  • What is the effect of replacing S.sid by S.sname in the SELECT clause? Would adding DISTINCT to this variant of the query make a difference?

SELECT S.sid

FROM Sailors S, Reserves R

WHERE S.sid=R.sid

Database Management Systems, R. Ramakrishnan and J. Gehrke

11

12 of 52

Other example queries

  • Q16: pp. 138
  • Q2: pp. 139
  • Q3: pp. 139

Database Management Systems, R. Ramakrishnan and J. Gehrke

12

13 of 52

Expressions and Strings

Q17: pp. 140

​

Read 1st paragraph of Section 5.2.2 in pp. 139-140

​

Each item in a qualification can be as general as

expression1 = expressions2.

​

SELECT S1.sname AS name1, S2.sname AS name2

FROM Sailors S1, Sailors S2

WHERE 2*S1.rating=S2.rating-1

Database Management Systems, R. Ramakrishnan and J. Gehrke

13

14 of 52

Expressions and Strings

SQL provides support for pattern matching through

the LIKE operator, along with the use of the wild-card

symbols % (which stands for zero or more arbitrary

characters) and _ (which stands for exactly one, arbitrary,

character)

​

‘_AB%’ → a pattern that will match every string that contains

at least three characters, with the second and third

characters being A and B respectively.

​

Q18: pp. 140

Database Management Systems, R. Ramakrishnan and J. Gehrke

14

15 of 52

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?)

SELECT R.sid

FROM Boats B, Reserves R

WHERE R.bid=B.bid

AND (B.color=‘red’ OR B.color=‘green’)

SELECT R.sid

FROM Boats B, Reserves R

WHERE R.bid=B.bid

AND B.color=‘red’

UNION

SELECT R.sid

FROM Boats B, Reserves R

WHERE R.bid=B.bid

AND B.color=‘green’

Database Management Systems, R. Ramakrishnan and J. Gehrke

15

16 of 52

Find sid’s of sailors who’ve reserved a red and a green boat

  • INTERSECT: Can be used to compute the intersection of any two union-compatible sets of tuples.
  • Included in the SQL/92 standard, but some systems don’t support it.
  • Contrast symmetry of the UNION and INTERSECT queries with how much the other versions differ.
  • (See page 143 for a subtle bug with a query using INTERSECT)

SELECT S.sid

FROM Sailors S, Boats B1, Reserves R1,

Boats B2, Reserves R2

WHERE S.sid=R1.sid AND R1.bid=B1.bid

AND S.sid=R2.sid AND R2.bid=B2.bid

AND (B1.color=‘red’ AND B2.color=‘green’)

SELECT S.sid

FROM Sailors S, Boats B, Reserves R

WHERE S.sid=R.sid AND R.bid=B.bid

AND B.color=‘red’

INTERSECT

SELECT S.sid

FROM Sailors S, Boats B, Reserves R

WHERE S.sid=R.sid AND R.bid=B.bid

AND B.color=‘green’

Key field!

Database Management Systems, R. Ramakrishnan and J. Gehrke

16

17 of 52

Nested Queries

  • A very powerful feature of SQL: a WHERE clause can itself contain an SQL query! (Actually, so can FROM and HAVING clauses.)
  • To find sailors who’ve not reserved #103, use NOT IN.
  • To understand semantics of nested queries, think of a nested loops evaluation: For each Sailors tuple, check the qualification by computing the subquery.

SELECT S.sname

FROM Sailors S

WHERE S.sid IN (SELECT R.sid

FROM Reserves R

WHERE R.bid=103)

Find names of sailors who’ve reserved boat #103:

Database Management Systems, R. Ramakrishnan and J. Gehrke

17

18 of 52

More Examples

  • Q2 on page 146
  • Q21 on page 146
    • What if we replace the inner occurrence (rather than the out occurrence ) of IN with NOT IN
    • What if we replace both occurrences of IN with NOT IN

Database Management Systems, R. Ramakrishnan and J. Gehrke

18

19 of 52

Nested Queries with Correlation

  • 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 re-computed for each Sailors tuple.

SELECT S.sname

FROM Sailors S

WHERE EXISTS (SELECT *

FROM Reserves R

WHERE R.bid=103 AND S.sid=R.sid)

Find names of sailors who’ve reserved boat #103:

Database Management Systems, R. Ramakrishnan and J. Gehrke

19

20 of 52

Another Example using correlated queries

  • Recall the total participation in page 81 (ER diagram in page 80): Every department must have at least one employee works in it.

How do we find out which departments do not have any employee working in it?

Database Management Systems, R. Ramakrishnan and J. Gehrke

20

21 of 52

Another Example using correlated queries

  • Select D.did

from Departments D

where NOT EXISTS (select *

from Works_IN W

where W.did = D.did)

Database Management Systems, R. Ramakrishnan and J. Gehrke

21

22 of 52

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 ∈ {<,<=,=,<>,>=,>}
  • Find sailors whose rating is greater than that of some sailor called Horatio:

SELECT *

FROM Sailors S

WHERE S.rating > ANY (SELECT S2.rating

FROM Sailors S2

WHERE S2.sname=‘Horatio’)

Database Management Systems, R. Ramakrishnan and J. Gehrke

22

23 of 52

More Examples

  • Q23 on page 148
  • Q24 on page 149

​

IN is equivalent to = ANY

NOT IN is equivalent to <> ALL

Database Management Systems, R. Ramakrishnan and J. Gehrke

23

24 of 52

Rewriting INTERSECT Queries Using IN

  • 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?)

Find sid’s of sailors who’ve reserved both a red and a green boat:

SELECT S.sid

FROM Sailors S, Boats B, Reserves R

WHERE S.sid=R.sid AND R.bid=B.bid AND B.color=‘red’

AND S.sid IN (SELECT S2.sid

FROM Sailors S2, Boats B2, Reserves R2

WHERE S2.sid=R2.sid AND R2.bid=B2.bid

AND B2.color=‘green’)

Database Management Systems, R. Ramakrishnan and J. Gehrke

24

25 of 52

Division in SQL

  • Let’s do it the hard way, without EXCEPT:

SELECT S.sname

FROM Sailors S

WHERE NOT EXISTS

((SELECT B.bid

FROM Boats B)

EXCEPT

(SELECT R.bid

FROM Reserves R

WHERE R.sid=S.sid))

SELECT S.sname

FROM Sailors S

WHERE NOT EXISTS (SELECT B.bid

FROM Boats B

WHERE NOT EXISTS (SELECT R.bid

FROM Reserves R

WHERE R.bid=B.bid

AND R.sid=S.sid))

Sailors S such that ...

there is no boat B without ...

a Reserves tuple showing S reserved B

Find sailors who’ve reserved all boats.

(1)

(2)

Database Management Systems, R. Ramakrishnan and J. Gehrke

25

26 of 52

Aggregate Operators

  • Significant extension of relational algebra.

COUNT (*)

COUNT ( [DISTINCT] A)

SUM ( [DISTINCT] A)

AVG ( [DISTINCT] A)

MAX (A)

MIN (A)

SELECT AVG (S.age)

FROM Sailors S

WHERE S.rating=10

SELECT COUNT (*)

FROM Sailors S

SELECT AVG ( DISTINCT S.age)

FROM Sailors S

WHERE S.rating=10

SELECT S.sname

FROM Sailors S

WHERE S.rating= (SELECT MAX(S2.rating)

FROM Sailors S2)

single column

SELECT COUNT (DISTINCT S.rating)

FROM Sailors S

WHERE S.sname=‘Bob’

Database Management Systems, R. Ramakrishnan and J. Gehrke

26

27 of 52

Assertion

  • Checking whether every department has at least one employee working in it

CREATE ASSERTION Every_dept_has_emp

CHECK ((Select count(D.did)

from Departments D

where NOT EXISTS (select *

from Works_IN W

where W.did = D.did)) = 0)

Database Management Systems, R. Ramakrishnan and J. Gehrke

27

28 of 52

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.

SELECT S.sname, MAX (S.age)

FROM Sailors S

SELECT S.sname, S.age

FROM Sailors S

WHERE S.age =

(SELECT MAX (S2.age)

FROM Sailors S2)

SELECT S.sname, S.age

FROM Sailors S

WHERE (SELECT MAX (S2.age)

FROM Sailors S2)

= S.age

Database Management Systems, R. Ramakrishnan and J. Gehrke

28

29 of 52

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 groups of 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 (!):

SELECT MIN (S.age)

FROM Sailors S

WHERE S.rating = i

For i = 1, 2, ... , 10:

Database Management Systems, R. Ramakrishnan and J. Gehrke

29

30 of 52

Queries With GROUP BY and HAVING

  • 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.)

SELECT [DISTINCT] target-list

FROM relation-list

WHERE qualification

GROUP BY grouping-list

HAVING group-qualification

Database Management Systems, R. Ramakrishnan and J. Gehrke

30

31 of 52

(Q31) Find the age of the youngest sailor for each rating level.

​

Select S.rating, MIN(S.age)

From Sailors S

Group By S.rating

​

Database Management Systems, R. Ramakrishnan and J. Gehrke

31

32 of 52

Conceptual Evaluation

  • The cross-product of relation-list is computed, tuples that fail qualification are discarded, `unnecessary’ fields are deleted, and the remaining tuples are partitioned into groups by the value of attributes in grouping-list.
  • The group-qualification is then applied to eliminate some groups. Expressions in group-qualification must have a single value per group!
    • In effect, an attribute in group-qualification that is not an argument of an aggregate op also appears in grouping-list. (SQL does not exploit primary key semantics here!)
  • One answer tuple is generated per qualifying group.

Database Management Systems, R. Ramakrishnan and J. Gehrke

32

33 of 52

(Q32) Find the age of the youngest sailor who is eligible to vote

(i.e., is at least 18 years old) for each rating level with at least

two such sailors.

​

see pages 155~157

​

Database Management Systems, R. Ramakrishnan and J. Gehrke

33

34 of 52

SQL:1999 Extensions

  • Page 157

HAVING COUNT(*) > 1 and EVERY (S.age <= 60)

​

The EVERY keyword requires that every row in a group must satisfy the attached condition to meet the group-qualification.

Database Management Systems, R. Ramakrishnan and J. Gehrke

34

35 of 52

SQL:1999 Extensions (cont)

  • How is the first query on page 158 different from the preceding query?

Database Management Systems, R. Ramakrishnan and J. Gehrke

35

36 of 52

More examples of aggregate queries

  • Q33 on page 158
  • Why is the first query on page 159 illegal?

Database Management Systems, R. Ramakrishnan and J. Gehrke

36

37 of 52

More examples of aggregate queries

  • Q34 on page 159
  • Alternative formulation of Q34 on the bottom of page 159

Database Management Systems, R. Ramakrishnan and J. Gehrke

37

38 of 52

More examples of aggregate queries

  • Q35 on page 160
  • Q36 on page 160
  • Alternative formulation of Q36 on page 161
  • Q37

Database Management Systems, R. Ramakrishnan and J. Gehrke

38

39 of 52

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.

Database Management Systems, R. Ramakrishnan and J. Gehrke

39

40 of 52

Embedded SQL

  • SQL commands can be called from within a host language (e.g., C or COBOL) program.
    • SQL statements can refer to host variables (including special variables used to return status).
    • Must include a statement to connect to the right database.
  • SQL relations are (multi-) sets of records, with no a priori bound on the number of records. No such data structure in C.
    • SQL supports a mechanism called a cursor to handle this.

Database Management Systems, R. Ramakrishnan and J. Gehrke

40

41 of 52

Cursors

  • Can declare a cursor on a relation or query statement (which generates a relation).
  • Can open a cursor, and repeatedly fetch a tuple then move the cursor, until all tuples have been retrieved.
    • Can use a special clause, called ORDER BY, in queries that are accessed through a cursor, to control the order in which tuples are returned.
      • Fields in ORDER BY clause must also appear in SELECT clause.
    • The ORDER BY clause, which orders answer tuples, is only allowed in the context of a cursor.
  • Can also modify/delete tuple pointed to by a cursor.

Database Management Systems, R. Ramakrishnan and J. Gehrke

41

42 of 52

Cursor that gets names of sailors who’ve reserved a red boat, in alphabetical order

  • Note that it is illegal to replace S.sname by, say, S.sid in the ORDER BY clause! (Why?)
  • Can we add S.sid to the SELECT clause and replace S.sname by S.sid in the ORDER BY clause?

EXEC SQL DECLARE sinfo CURSOR FOR

SELECT S.sname

FROM Sailors S, Boats B, Reserves R

WHERE S.sid=R.sid AND R.bid=B.bid AND B.color=‘red’

ORDER BY S.sname

Database Management Systems, R. Ramakrishnan and J. Gehrke

42

43 of 52

Embedding SQL in C: An Example

char SQLSTATE[6];

EXEC SQL BEGIN DECLARE SECTION

char c_sname[20]; short c_minrating; float c_age;

EXEC SQL END DECLARE SECTION

c_minrating = random();

EXEC SQL DECLARE sinfo CURSOR FOR

SELECT S.sname, S.age FROM Sailors S

WHERE S.rating > :c_minrating

ORDER BY S.sname;

do {

EXEC SQL FETCH sinfo INTO :c_sname, :c_age;

printf(“%s is %d years old\n”, c_sname, c_age);

} while (SQLSTATE != ‘02000’);

EXEC SQL CLOSE sinfo;

​

​

​

Database Management Systems, R. Ramakrishnan and J. Gehrke

43

44 of 52

Database APIs: Alternative to embedding

Rather than modify compiler, add library with database calls (API)

  • special standardized interface: procedures/objects
  • passes SQL strings from language, presents result sets in a language-friendly way
  • Microsoft’s ODBC becoming C/C++ standard on Windows
  • Sun’s JDBC a Java equivalent
  • Supposedly DBMS-neutral
    • a “driver” traps the calls and translates them into DBMS-specific code
    • database can be across a network

Database Management Systems, R. Ramakrishnan and J. Gehrke

44

45 of 52

SQL API in Java (JDBC)

Connection con = // connect

DriverManager.getConnection(url, ”login", ”pass");

Statement stmt = con.createStatement(); // set up stmt

String query = "SELECT name, rating FROM Sailors";

ResultSet rs = stmt.executeQuery(query);

try { // handle exceptions

// loop through result tuples

while (rs.next()) {

String s = rs.getString(“name");

Int n = rs.getFloat(“rating");

System.out.println(s + " " + n);

}

} catch(SQLException ex) {

System.out.println(ex.getMessage ()

+ ex.getSQLState () + ex.getErrorCode ());

}

Database Management Systems, R. Ramakrishnan and J. Gehrke

45

46 of 52

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.

Database Management Systems, R. Ramakrishnan and J. Gehrke

46

47 of 52

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

FROM Boats B

WHERE B.bid=bid)))

Database Management Systems, R. Ramakrishnan and J. Gehrke

47

48 of 52

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),

CHECK

( (SELECT COUNT (S.sid) FROM Sailors S)

+ (SELECT COUNT (B.bid) FROM Boats B) < 100 )

CREATE ASSERTION smallClub

CHECK

( (SELECT COUNT (S.sid) FROM Sailors S)

+ (SELECT COUNT (B.bid) FROM Boats B) < 100 )

​

Number of boats

plus number of

sailors is < 100

Database Management Systems, R. Ramakrishnan and J. Gehrke

48

49 of 52

Triggers

  • Trigger: procedure that starts automatically if specified changes occur to the DBMS
  • Three parts:
    • Event (activates the trigger)
    • Condition (tests whether the triggers should run)
    • Action (what happens if the trigger runs)

​

Database Management Systems, R. Ramakrishnan and J. Gehrke

49

50 of 52

Triggers: Example (SQL:1999)

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

Database Management Systems, R. Ramakrishnan and J. Gehrke

50

51 of 52

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.

Database Management Systems, R. Ramakrishnan and J. Gehrke

51

52 of 52

Summary (Contd.)

  • NULL for unknown field values brings many complications
  • Embedded SQL allows execution within a host language; cursor mechanism allows retrieval of one record at a time
  • APIs such as ODBC and ODBC introduce a layer of abstraction between application and DBMS
  • SQL allows specification of rich integrity constraints
  • Triggers respond to changes in the database

​

​

Database Management Systems, R. Ramakrishnan and J. Gehrke

52