Database System Concepts, 5th Ed: ©silberschatz, Korth and Sudarshan
Database System Concepts, 5th Ed: ©silberschatz, Korth and Sudarshan
Database System Concepts - 5th Edition, June 15, 3.2 ©Silberschatz, Korth and Sudarshan
History
● IBM Sequel language developed as part of System R project at the
IBM San Jose Research Laboratory
● Renamed Structured Query Language (SQL)
● ANSI and ISO standard SQL:
● SQL-86
● SQL-89
● SQL-92
● SQL:1999 (language name became Y2K compliant!)
● SQL:2003
● Commercial systems offer most, if not all, SQL-92 features, plus
varying feature sets from later standards and special proprietary
features.
● Not all examples here may work on your particular system.
Database System Concepts - 5th Edition, June 15, 3.3 ©Silberschatz, Korth and Sudarshan
Data Definition Language
Allows the specification of not only a set of relations but also
information about each relation, including:
● The schema for each relation.
● The domain of values associated with each attribute.
● Integrity constraints
● The set of indices to be maintained for each relations.
● Security and authorization information for each relation.
● The physical storage structure of each relation on disk.
Database System Concepts - 5th Edition, June 15, 3.4 ©Silberschatz, Korth and Sudarshan
Domain Types in SQL
● char(n). Fixed length character string, with user-specified length n.
● varchar(n). Variable length character strings, with user-specified
maximum length n.
● int. Integer (a finite subset of the integers that is machine-dependent).
● smallint. Small integer (a machine-dependent subset of the integer
domain type).
● numeric(p,d). Fixed point number, with user-specified precision of p
digits, with n digits to the right of decimal point.
● real, double precision. Floating point and double-precision floating point
numbers, with machine-dependent precision.
● float(n). Floating point number, with user-specified precision of at least n
digits.
● More are covered in Chapter 4.
Database System Concepts - 5th Edition, June 15, 3.5 ©Silberschatz, Korth and Sudarshan
Create Table Construct
● An SQL relation is defined using the create table command:
create table r (A1 D1, A2 D2, ..., An Dn,
(integrity-constraint1),
...,
(integrity-constraintk))
● r is the name of the relation
● each Ai is an attribute name in the schema of relation r
● Di is the data type of values in the domain of attribute Ai
● Example:
create table branch
(branch_name char(15) not null,
branch_city char(30),
assets integer)
Database System Concepts - 5th Edition, June 15, 3.6 ©Silberschatz, Korth and Sudarshan
Integrity Constraints in Create Table
● not null
● primary key (A1, ..., An )
Database System Concepts - 5th Edition, June 15, 3.7 ©Silberschatz, Korth and Sudarshan
Drop and Alter Table Constructs
● The drop table command deletes all information about the
dropped relation from the database.
● The alter table command is used to add attributes to an existing
relation:
alter table r add A D
where A is the name of the attribute to be added to relation r and D
is the domain of A.
● All tuples in the relation are assigned null as the value for the
new attribute.
● The alter table command can also be used to drop attributes of a
relation:
alter table r drop A
where A is the name of an attribute of relation r
● Dropping of attributes not supported by many databases
Database System Concepts - 5th Edition, June 15, 3.8 ©Silberschatz, Korth and Sudarshan
Basic Query Structure
● SQL is based on set and relational operations with certain
modifications and enhancements
● A typical SQL query has the form:
● Ai represents an attribute
● Ri represents a relation
● P is a predicate.
● This query is equivalent to the relational algebra expression.
Database System Concepts - 5th Edition, June 15, 3.9 ©Silberschatz, Korth and Sudarshan
The select Clause
● The select clause list the attributes desired in the result of a query
● corresponds to the projection operation of the relational algebra
● Example: find the names of all branches in the loan relation:
select branch_name
from loan
● In the relational algebra, the query would be:
∏branch_name (loan)
● NOTE: SQL names are case insensitive (i.e., you may use upper- or
lower-case letters.)
● Some people use upper case wherever we use bold font.
Database System Concepts - 5th Edition, June 15, 3.10 ©Silberschatz, Korth and Sudarshan
The select Clause (Cont.)
● SQL allows duplicates in relations as well as in query results.
● To force the elimination of duplicates, insert the keyword distinct after
select.
● Find the names of all branches in the loan relations, and remove
duplicates
select distinct branch_name
from loan
Database System Concepts - 5th Edition, June 15, 3.11 ©Silberschatz, Korth and Sudarshan
The select Clause (Cont.)
● An asterisk in the select clause denotes “all attributes”
select *
from loan
● The select clause can contain arithmetic expressions involving the
operation, +, –, *, and /, and operating on constants or attributes of
tuples.
● The query:
select loan_number, branch_name, amount * 100
from loan
would return a relation that is the same as the loan relation, except that
the value of the attribute amount is multiplied by 100.
Database System Concepts - 5th Edition, June 15, 3.12 ©Silberschatz, Korth and Sudarshan
The where Clause
● The where clause specifies conditions that the result must satisfy
● Corresponds to the selection predicate of the relational algebra.
● To find all loan number for loans made at the Perryridge branch with
loan amounts greater than $1200.
select loan_number
from loan
where branch_name = ‘ Perryridge’ and amount > 1200
● Comparison results can be combined using the logical connectives
and, or, and not.
● Comparisons can be applied to results of arithmetic expressions.
Database System Concepts - 5th Edition, June 15, 3.13 ©Silberschatz, Korth and Sudarshan
The where Clause (Cont.)
● SQL includes a between comparison operator
● Example: Find the loan number of those loans with loan amounts
between $90,000 and $100,000 (that is, ≥ $90,000 and ≤ $100,000)
select loan_number
from loan
where amount between 90000 and 100000
Database System Concepts - 5th Edition, June 15, 3.14 ©Silberschatz, Korth and Sudarshan
The from Clause
● The from clause lists the relations involved in the query
● Corresponds to the Cartesian product operation of the relational algebra.
● Find the Cartesian product borrower X loan
select *
from borrower, loan
● Find the name, loan number and loan amount of all customers
having a loan at the Perryridge branch.
Database System Concepts - 5th Edition, June 15, 3.15 ©Silberschatz, Korth and Sudarshan
The Rename Operation
● The SQL allows renaming relations and attributes using the as clause:
old-name as new-name
● Find the name, loan number and loan amount of all customers; rename
the column name loan_number as loan_id.
Database System Concepts - 5th Edition, June 15, 3.16 ©Silberschatz, Korth and Sudarshan
Tuple Variables
● Tuple variables are defined in the from clause via the use of the as
clause.
● Find the customer names and their loan numbers for all customers
having a loan at some branch.
● Find the names of all branches that have greater assets than
some branch located in Brooklyn.
Database System Concepts - 5th Edition, June 15, 3.17 ©Silberschatz, Korth and Sudarshan
String Operations
● SQL includes a string-matching operator for comparisons on character
strings. The operator “like” uses patterns that are described using two
special characters:
● percent (%). The % character matches any substring.
● underscore (_). The _ character matches any character.
● Find the names of all customers whose street includes the substring
“Main”.
select customer_name
from customer
where customer_street like ‘%Main%’
● Match the name “Main%”
like ‘Main\%’ escape ‘\’
● SQL supports a variety of string operations such as
● concatenation (using “||”)
● converting from upper to lower case (and vice versa)
● finding string length, extracting substrings, etc.
Database System Concepts - 5th Edition, June 15, 3.18 ©Silberschatz, Korth and Sudarshan
Ordering the Display of Tuples
● List in alphabetic order the names of all customers having a loan in
Perryridge branch
select distinct customer_name
from borrower, loan
where borrower loan_number = loan.loan_number and
branch_name = ‘Perryridge’
order by customer_name
● We may specify desc for descending order or asc for ascending
order, for each attribute; ascending order is the default.
● Example: order by customer_name desc
Database System Concepts - 5th Edition, June 15, 3.19 ©Silberschatz, Korth and Sudarshan
Duplicates
● In relations with duplicates, SQL can define how many copies of
tuples appear in the result.
● Multiset versions of some of the relational algebra operators – given
multiset relations r1 and r2:
1. σθ (r1): If there are c1 copies of tuple t1 in r1, and t1 satisfies
selections σθ,, then there are c1 copies of t1 in σθ (r1).
2. ΠA (r ): For each copy of tuple t1 in r1, there is a copy of tuple
ΠA (t1) in ΠA (r1) where ΠA (t1) denotes the projection of the single
tuple t1.
3. r1 x r2 : If there are c1 copies of tuple t1 in r1 and c2 copies of
tuple t2 in r2, there are c1 x c2 copies of the tuple t1. t2 in r1 x r2
Database System Concepts - 5th Edition, June 15, 3.20 ©Silberschatz, Korth and Sudarshan
Duplicates (Cont.)
● Example: Suppose multiset relations r1 (A, B) and r2 (C) are as
follows:
r1 = {(1, a) (2,a)} r2 = {(2), (3), (3)}
● Then ΠB(r1) would be {(a), (a)}, while ΠB(r1) x r2 would be
{(a,2), (a,2), (a,3), (a,3), (a,3), (a,3)}
● SQL duplicate semantics:
select A1,, A2, ..., An
from r1, r2, ..., rm
where P
is equivalent to the multiset version of the expression:
Database System Concepts - 5th Edition, June 15, 3.21 ©Silberschatz, Korth and Sudarshan
Set Operations
● The set operations union, intersect, and except operate on relations
and correspond to the relational algebra operations ∪, ∩, −.
● Each of the above operations automatically eliminates duplicates; to
retain all duplicates use the corresponding multiset versions union
all, intersect all and except all.
Database System Concepts - 5th Edition, June 15, 3.22 ©Silberschatz, Korth and Sudarshan
Set Operations
Database System Concepts - 5th Edition, June 15, 3.23 ©Silberschatz, Korth and Sudarshan
Aggregate Functions
● These functions operate on the multiset of values of a column
of a relation, and return a value
avg: average value
min: minimum value
max: maximum value
sum: sum of values
count: number of values
Database System Concepts - 5th Edition, June 15, 3.24 ©Silberschatz, Korth and Sudarshan
Aggregate Functions (Cont.)
● Find the average account balance at the Perryridge branch.
Database System Concepts - 5th Edition, June 15, 3.25 ©Silberschatz, Korth and Sudarshan
Aggregate Functions – Group By
Database System Concepts - 5th Edition, June 15, 3.26 ©Silberschatz, Korth and Sudarshan
Aggregate Functions – Having Clause
● Find the names of all branches where the average account balance is
more than $1,200.
Database System Concepts - 5th Edition, June 15, 3.27 ©Silberschatz, Korth and Sudarshan
Null Values
● It is possible for tuples to have a null value, denoted by null, for some
of their attributes
● null signifies an unknown value or that a value does not exist.
● The predicate is null can be used to check for null values.
● Example: Find all loan number which appear in the loan relation
with null values for amount.
select loan_number
from loan
where amount is null
● The result of any arithmetic expression involving null is null
● Example: 5 + null returns null
● However, aggregate functions simply ignore nulls
● More on next slide
Database System Concepts - 5th Edition, June 15, 3.28 ©Silberschatz, Korth and Sudarshan
Null Values and Three Valued Logic
Database System Concepts - 5th Edition, June 15, 3.29 ©Silberschatz, Korth and Sudarshan
Null Values and Aggregates
● Total all loan amounts
select sum (amount )
from loan
● Above statement ignores null amounts
● Result is null if there is no non-null amount
● All aggregate operations except count(*) ignore tuples with null
values on the aggregated attributes.
Database System Concepts - 5th Edition, June 15, 3.30 ©Silberschatz, Korth and Sudarshan
Nested Subqueries
● SQL provides a mechanism for the nesting of subqueries.
● A subquery is a select-from-where expression that is nested within
another query.
● A common use of subqueries is to perform tests for set membership,
set comparisons, and set cardinality.
Database System Concepts - 5th Edition, June 15, 3.31 ©Silberschatz, Korth and Sudarshan
Example Query
● Find all customers who have both an account and a loan at the bank.
● Find all customers who have a loan at the bank but do not have
an account at the bank
Database System Concepts - 5th Edition, June 15, 3.32 ©Silberschatz, Korth and Sudarshan
Example Query
● Find all customers who have both an account and a loan at the
Perryridge branch
Database System Concepts - 5th Edition, June 15, 3.33 ©Silberschatz, Korth and Sudarshan
Set Comparison
● Find all branches that have greater assets than some branch located
in Brooklyn.
select branch_name
from branch
where assets > some
(select assets
from branch
where branch_city = ‘Brooklyn’)
Database System Concepts - 5th Edition, June 15, 3.34 ©Silberschatz, Korth and Sudarshan
Definition of Some Clause
0
(5 < some 5 ) = true
(read: 5 < some tuple in the relation)
6
0
(5 < some 5 ) = false
0
(5 = some 5 ) = true
0
(5 ≠ some 5 ) = true (since 0 ≠ 5)
(= some) ≡ in
However, (≠ some) ≡ not in
Database System Concepts - 5th Edition, June 15, 3.35 ©Silberschatz, Korth and Sudarshan
Example Query
● Find the names of all branches that have greater assets than all
branches located in Brooklyn.
select branch_name
from branch
where assets > all
(select assets
from branch
where branch_city = ‘Brooklyn’)
Database System Concepts - 5th Edition, June 15, 3.36 ©Silberschatz, Korth and Sudarshan
Definition of all Clause
● F <comp> all r ⇔ ∀ t ∈ r (F <comp> t)
0
(5 < all 5 ) = false
6
61
(5 < all ) = true
0
4
(5 = all 5 ) = false
4
(5 ≠ all 6 ) = true (since 5 ≠ 4 and 5 ≠ 6)
(≠ all) ≡ not in
However, (= all) ≡ in
Database System Concepts - 5th Edition, June 15, 3.37 ©Silberschatz, Korth and Sudarshan
Test for Empty Relations
● The exists construct returns the value true if the argument subquery is
nonempty.
● exists r ⇔ r ≠ Ø
● not exists r ⇔ r = Ø
Database System Concepts - 5th Edition, June 15, 3.38 ©Silberschatz, Korth and Sudarshan
Example Query
● Find all customers who have an account at all branches located in
Brooklyn.
● Note that X – Y = Ø ⇔ X ⊆ Y
● Note: Cannot write this query using = all and its variants
Database System Concepts - 5th Edition, June 15, 3.39 ©Silberschatz, Korth and Sudarshan
Test for Absence of Duplicate Tuples
Database System Concepts - 5th Edition, June 15, 3.40 ©Silberschatz, Korth and Sudarshan
Example Query
● Find all customers who have at least two accounts at the Perryridge
branch.
Database System Concepts - 5th Edition, June 15, 3.41 ©Silberschatz, Korth and Sudarshan
Derived Relations
● SQL allows a subquery expression to be used in the from clause
● Find the average account balance of those branches where the average
account balance is greater than $1200.
select branch_name, avg_balance
from (select branch_name, avg (balance)
from account
group by branch_name )
as branch_avg ( branch_name, avg_balance )
where avg_balance > 1200
Note that we do not need to use the having clause, since we compute
the temporary (view) relation branch_avg in the from clause, and the
attributes of branch_avg can be used directly in the where clause.
Database System Concepts - 5th Edition, June 15, 3.42 ©Silberschatz, Korth and Sudarshan
With Clause
● The with clause provides a way of defining a temporary view whose
definition is available only to the query in which the with clause
occurs.
● Find all accounts with the maximum balance
Database System Concepts - 5th Edition, June 15, 3.43 ©Silberschatz, Korth and Sudarshan
Complex Query using With Clause
● Find all branches where the total account deposit is greater than the
average of the total account deposits at all branches.
Database System Concepts - 5th Edition, June 15, 3.44 ©Silberschatz, Korth and Sudarshan
Views
● In some cases, it is not desirable for all users to see the entire logical
model (that is, all the actual relations stored in the database.)
● Consider a person who needs to know a customer’s loan number but
has no need to see the loan amount. This person should see a relation
described, in SQL, by
Database System Concepts - 5th Edition, June 15, 3.45 ©Silberschatz, Korth and Sudarshan
View Definition
● A view is defined using the create view statement which has the
form
create view v as < query expression >
where <query expression> is any legal SQL expression. The view
name is represented by v.
● Once a view is defined, the view name can be used to refer to the
virtual relation that the view generates.
● View definition is not the same as creating a new relation by
evaluating the query expression
● Rather, a view definition causes the saving of an expression;
the expression is substituted into queries using the view.
Database System Concepts - 5th Edition, June 15, 3.46 ©Silberschatz, Korth and Sudarshan
Example Queries
● A view consisting of branches and their customers
Database System Concepts - 5th Edition, June 15, 3.47 ©Silberschatz, Korth and Sudarshan
Views Defined Using Other Views
● One view may be used in the expression defining another view
● A view relation v1 is said to depend directly on a view relation v2 if v2
is used in the expression defining v1
● A view relation v1 is said to depend on view relation v2 if either v1
depends directly to v2 or there is a path of dependencies from v1 to
v2
● A view relation v is said to be recursive if it depends on itself.
Database System Concepts - 5th Edition, June 15, 3.48 ©Silberschatz, Korth and Sudarshan
View Expansion
● A way to define the meaning of views defined in terms of other views.
● Let view v1 be defined by an expression e1 that may itself contain
uses of view relations.
● View expansion of an expression repeats the following replacement
step:
repeat
Find any view relation vi in e1
Replace the view relation vi by the expression defining vi
until no more view relations are present in e1
● As long as the view definitions are not recursive, this loop will
terminate
Database System Concepts - 5th Edition, June 15, 3.49 ©Silberschatz, Korth and Sudarshan
Modification of the Database – Deletion
Database System Concepts - 5th Edition, June 15, 3.50 ©Silberschatz, Korth and Sudarshan
Example Query
● Delete the record of all accounts with balances below the average at
the bank.
Database System Concepts - 5th Edition, June 15, 3.51 ©Silberschatz, Korth and Sudarshan
Modification of the Database – Insertion
or equivalently
Database System Concepts - 5th Edition, June 15, 3.52 ©Silberschatz, Korth and Sudarshan
Modification of the Database – Insertion
● Provide as a gift for all loan customers of the Perryridge branch, a $200
savings account. Let the loan number serve as the account number for
the new savings account
insert into account
select loan_number, branch_name, 200
from loan
where branch_name = ‘Perryridge’
insert into depositor
select customer_name, loan_number
from loan, borrower
where branch_name = ‘ Perryridge’
and loan.account_number = borrower.account_number
● The select from where statement is evaluated fully before any of its
results are inserted into the relation (otherwise queries like
insert into table1 select * from table1
would cause problems)
Database System Concepts - 5th Edition, June 15, 3.53 ©Silberschatz, Korth and Sudarshan
Modification of the Database – Updates
● Increase all accounts with balances over $10,000 by 6%, all other
accounts receive 5%.
● Write two update statements:
update account
set balance = balance * 1.06
where balance > 10000
update account
set balance = balance * 1.05
where balance ≤ 10000
● The order is important
● Can be done better using the case statement (next slide)
Database System Concepts - 5th Edition, June 15, 3.54 ©Silberschatz, Korth and Sudarshan
Case Statement for Conditional Updates
update account
set balance = case
when balance <= 10000 then balance *1.05
else balance * 1.06
end
Database System Concepts - 5th Edition, June 15, 3.55 ©Silberschatz, Korth and Sudarshan
Update of a View
● Create a view of all loan data in the loan relation, hiding the amount
attribute
create view branch_loan as
select branch_name, loan_number
from loan
● Add a new tuple to branch_loan
insert into branch_loan
values (‘Perryridge’, ‘L-307’)
This insertion must be represented by the insertion of the tuple
(‘L-307’, ‘Perryridge’, null )
into the loan relation
Database System Concepts - 5th Edition, June 15, 3.56 ©Silberschatz, Korth and Sudarshan
Updates Through Views (Cont.)
Database System Concepts - 5th Edition, June 15, 3.57 ©Silberschatz, Korth and Sudarshan
Joined Relations**
● Join operations take two relations and return as a result another
relation.
● These additional operations are typically used as subquery
expressions in the from clause
● Join condition – defines which tuples in the two relations match, and
what attributes are present in the result of the join.
● Join type – defines how tuples in each relation that do not match any
tuple in the other relation (based on the join condition) are treated.
Database System Concepts - 5th Edition, June 15, 3.58 ©Silberschatz, Korth and Sudarshan
Joined Relations – Datasets for Examples
● Relation loan
● Relation borrower
Database System Concepts - 5th Edition, June 15, 3.59 ©Silberschatz, Korth and Sudarshan
Joined Relations – Examples
Database System Concepts - 5th Edition, June 15, 3.60 ©Silberschatz, Korth and Sudarshan
Joined Relations – Examples
● loan natural inner join borrower
Database System Concepts - 5th Edition, June 15, 3.61 ©Silberschatz, Korth and Sudarshan
Joined Relations – Examples
● loan full outer join borrower using (loan_number)
● Find all customers who have either an account or a loan (but not
both) at the bank.
select customer_name
from (depositor natural full outer join borrower )
where account_number is null or loan_number is null
Database System Concepts - 5th Edition, June 15, 3.62 ©Silberschatz, Korth and Sudarshan
End of Chapter 3
Database System Concepts - 5th Edition, June 15, 3.64 ©Silberschatz, Korth and Sudarshan
Figure 3.3: Tuples inserted into loan and
borrower
Database System Concepts - 5th Edition, June 15, 3.65 ©Silberschatz, Korth and Sudarshan
Figure 3.4:
The loan and borrower relations
Database System Concepts - 5th Edition, June 15, 3.66 ©Silberschatz, Korth and Sudarshan