Chapter 4 The Relational Model

Review Questions

4.1 Discuss each of the following concepts in the context of the relational data model:

(a) Relation A table with columns and rows.

(b) Attribute A named column of a relation.
(c) Domain The set of allowable values for one or more attributes.
(d) Tuple A row of a relation.
(e) Intension The structure of a relation together with a specification of the domains
and any other restrictions on possible values.
Extension An instance of the tuples of a relation.
(f) Degree The number of attributes in a relation.
Cardinality The number of tuples in a relation.

Each term defined in Section 4.2.1.

4.2 Describe the relationship between mathematical relations and relations in the relational data
model?

Let D1, D2, . . . , Dn be n sets. Their Cartesian product is defined as:

D1  D2  . . .  Dn  {(d1, d2, . . . , dn) | d1 D1, d2 D2, . . . , dn Dn}

Any set of n-tuples from this Cartesian product is a relation on the n sets. Now let A1, A2, . . .,
An be attributes with domains D1, D2, . . . , Dn. Then the set {A1:D1, A2:D2, . . . , An:Dn}
is a relation schema. A relation R defined by a relation schema S is a set of mappings from the
attribute names to their corresponding domains. Thus, relation R is a set of n-tuples:

  
(A1:d1, A2:d2, . . . , An:dn) such that d1  D1, d2  D2, . . . , dn  Dn

Each element in the n-tuple consists of an attribute and a value for that attribute.

Discussed fully in Sections 4.2.2 and 4.2.3.

4.3 Describe the term “normalized reaction”. Why are constraints so important in a relational
database?
 Codd described a normalized relation as a relation that does not contain any repeating groups
or multivalued attributes. The attributes are functionally dependent on only the primary key.
Constraints enforce data integrity, consistency, and business rules.

4.4 Discuss the properties of a relation.

A relation has the following properties:

 has a name that is distinct from all other relation names in the relational schema;

 each cell contains exactly one atomic (single) value;

 each attribute has a distinct name;

 the values of an attribute are all from the same domain;

 each tuple is distinct; there are no duplicate tuples;

 the order of attributes has no significance;

 the order of tuples has no significance, theoretically. (However, in practice, the order may
affect the efficiency of accessing tuples.)

Discussed fully in Section 4.2.4.

4.5 Discuss the differences between the candidate keys and the primary key of a relation. Explain
what is meant by a foreign key. How do foreign keys of relations relate to candidate keys? Give
examples to illustrate your answer.

The primary key is the candidate key that is selected to identify tuples uniquely within a relation.
A foreign key is an attribute or set of attributes within one relation that matches the candidate key
of some (possibly the same) relation. Discussed in Section 4.2.5.

4.6 Define the two principal integrity rules for the relational model. Discuss why it is desirable to
enforce these rules.

Two rules are Entity Integrity (Section 4.3.2) and Referential Integrity (Section 4.3.3).

4.7 Define “views”. Why are they important in a database approach?

Views can be described as virtual tables that utilize one or more relational operations operating on
the base relations to produce another relation. Views data are dynamically assigned by the DBMS
through relational operations set by users. Views are useful in a number of ways including those
 described in section 4.4.2. These include data security, easy data customization, data flexibility,
and simplification of complex operations on base relations.

Exercises

The following tables form part of a database held in a relational DBMS:-

Hotel (hotelNo, hotelName, city)

Room (roomNo, hotelNo, type, price)
Booking (hotelNo, guestNo, dateFrom, dateTo, roomNo)
Guest (guestNo, guestName, guestAddress)

where Hotel contains hotel details and hotelNo is the primary key;
Room contains room details for each hotel and (roomNo, hotelNo) forms the primary key;
Booking contains details of the bookings and (hotelNo, guestNo, dateFrom) forms the primary
key;
and Guest contains guest details and guestNo is the primary key.

4.8 Identify the foreign keys in this schema. Explain how the entity and referential integrity rules
apply to these relations.

For each relation, the primary key must not contain any nulls.

Room is related to Hotel through the attribute hotelNo. Therefore, the hotelNo in Room should
either be null or contain the number of an existing hotel in the Hotel relation. In this case study, it
would probably be unacceptable to have a hotelNo in Room with a null value.

Booking is related to Hotel through the attribute hotelNo. Therefore, the hotelNo in Booking
should either be null or contain the number of an existing hotel in the Hotel relation. However,
because hotelNo is also part of the primary key, a null value for this attribute would be
unacceptable. Similarly for guestNo. Booking is also related to Room through the attribute
roomNo.

4.9 Produce some sample tables for these relations that observe the relational integrity rules.
Suggest some general constraints that would be appropriate for this schema.

Student should provide some sample tables, observing entity and referential integrity. In
particular, ensure the uniqueness for the composite primary keys of the Room and Booking tables.
 Some general constraints may be:

 There can be no two bookings for the same room in the same hotel on the same day.
 For the Booking relation, dateFrom must be before dateTo.
 Room price must be greater than 0 and less than £200.

4.10 Analyze the RDBMSs that you are currently using. Determine the support the system provides for
primary keys, alternate keys, foreign keys, relational integrity, and views.

This is a small student project, the result of which is dependent on the system analyzed.

4.11 Implement the above schema in one of the RDBMSs you currently use. Generate two user-
views that are accessible and updatable as well as two other user-views that cannot be
updated.

Students need to practice implementing the above schema. As described in section 4.4.3, it is
possible to update the views provided it fits into the specified criteria. Generated views need to
observe criteria outlined in section 4.4.3
 Chapter 5 Relational Algebra and Relational Calculus

Review Questions

5.1 What is the difference between a procedural and non-procedural language? How would you
classify the relational algebra and relational calculus?

Procedural language: a language that allows user to tell the system what data is needed and
exactly how to retrieve the data.
Non-procedural language: a language that allows user to state what data is needed rather
than how it is to be retrieved.

Informally, we may describe the relational algebra as a (high-level) procedural language: it

can be used to tell the DBMS how to build a new relation from one or more relations in the
database. Again, informally, we may describe the relational calculus as a non-procedural
language: it can be used to formulate the definition of a relation in terms of one or more
database relations.

5.2 Explain the following terms:

 tuple relational calculus

In tuple relational calculus, we are interested in finding tuples for which a predicate is
true. The calculus is based on the use of tuple variables. A tuple variable is a variable that
“ranges over” a named relation: that is, a variable whose only permitted values are tuples
of the relation. (The word “range” here does not correspond to the mathematical use of
range, but corresponds to a mathematical domain.) For example, to specify the range of a
tuple variable S as the Staff relation, we write: Staff(S)
To express the query “Find the set of all tuples S such that F(S) is true,” we can write:
{S | F(S)}
F is called a formula (well-formed formula, or wff in mathematical logic). See section
5.2.1
 domain relational calculus

Variables are used in domain relational calculus also, but in this case the variables take
their values from domains of attributes rather than tuples of relations. An expression in
the domain relational calculus has the following general form:
{d1, d2, . . . , dn | F(d1, d2, … , dm)} m $ n
 Where d1, d2, . . . , dn, . . . , dm represent domain variables and F(d1, d2, . . . , dm)
represents a formula composed of atoms. See section 5.2.2.

5.3 Define the five basic relational algebra operations. Define the Join, Intersection, and Division
operations in terms of these five basic operations.

Five basic operations are:

 Selection and Projection (Unary)

 Cartesian Product, Union, and Set Difference (Binary).

There is also the Join, Intersection, and Division operations:

 Can rewrite -Join in terms of the basic selection and Cartesian product operations:

R 3 F S = F (R  S)

 Can express the intersection operation in terms of the set difference operation:

R  S = R - (R - S)

 Can express the division operation in terms of the basic operations:

T1 = C(R)
T2 = C( (S x T1) - R)
T = T1 - T2

5.4 Discuss the differences between the five Join operations: Theta join, Equijoin, Natural join,
Outer join, and Semijoin. Give examples to illustrate your answer.

Theta join R ⊳ ⊲F S Produces a relation that contains tuples satisfying the predicate F from

the Cartesian product of R and S.

Equijoin R ⊳ ⊲F S Produces a relation that contains tuples satisfying the predicate F

(which only contains equality comparisons) from the Cartesian product

of R and S.
Natural join R⊳⊲S An Equijoin of the two relations R and S over all common attributes

x. One occurrence of each common attribute is eliminated.

(Left) Outer join R⊐⊲S A join in which tuples from R that do not have matching values in the
 common attributes of S are also included in the result relation.
Semijoin R ⊳F S Produces a relation that contains the tuples of R that participate in the

join of R with S.

5.5 There are different types of join operations that can be used to retrieve data, based on
different relations. Describe the relation between theta and equal join.

The Theta join operation (R F S) defines a relation that contains tuples satisfying the
predicate F from the Cartesian product of R and S. The predicate F is of the form R.ai u S.bi,
where u may be one of the comparison operators (<,>,=, ≤, ≥, ≠). In the case where the
predicate F contains only equality (=), the term Equijoin is used instead. Equal join is one
form of theta join.

5.6 Define the structure of a (well-formed) formula in both the tuple relational calculus and
domain relational calculus.

Tuple relational calculus

A (well-formed) formula is made out of one or more atoms, where an atom has one of the
following forms:
 R(Si), where Si is a tuple variable and R is a relation.
 Si.a1 Sj.a2, where Si and Sj are tuple variables, a1 is an attribute of the relation over
which Si ranges, a2 is an attribute of the relation over which Sj ranges, and  is one of the
comparison operators (, , , , , ); the attributes a1 and a2 must have domains
whose members can be compared by 
 Si.a1 c, where Si is a tuple variable, a1 is an attribute of the relation over which Si
ranges, c is a constant from the domain of attribute a1, and  is one of the comparison
operators

We recursively build up formulae from atoms using the following rules:

 an atom is a formula;
 if F1 and F2 are formulae, so are their conjunction F1  F2, their disjunction F1  F2, and
the negation F1;
 if F is a formula with free variable X, then (X)(F) and (X)(F) are also formulae.

Domain relational calculus

A (well-formed) formula is made out of one or more atoms, where an atom has one of the
following forms:
  R(d1, d2,…, dn), where R is a relation of degree n and each di is a domain variable.
 di dj, where di and dj are domain variables and  is one of the comparison operators (,
, , , , ); the domains di and dj must have members that can be compared by 
 di c, where di is a domain variable, c is a constant from the domain of di, and  is one of
the comparison operators

5.7 What is the difference between existential and universal quantifiers in relational calculus?
Give examples to elaborate how the two are applied in a statement

See end of Section 5.2.1.

Exercises

For the following exercises, use the Hotel schema defined at the start of the Exercises at the end of
Chapter 4.

5.8 Describe the relations that would be produced by the following relational algebra operations:

a) hotelNo (price  50 (Room) )

This will produce a relation with a single attribute (hotelNo) giving the number of those
hotels with a room price greater than £50.

b) Hotel.hotelNo  Room.hotelNo(Hotel  Room)

This will produce a join of the Hotel and Room relations containing all the attributes of
both Hotel and Room (there will be two copies of the hotelNo attribute). Essentially this
will produce a relation containing all rooms at all hotels.

c) hotelName (Hotel ⊳ ⊲ Hotel.hotelNo  Room.hotelNo (price  50 (Room)) )

This will produce a join of Hotel and those tuples of Room with a price greater than £50.
Essentially this will produce a relation containing all hotel names with a room price above
£50.

d) Guest ⊐ ⊲ (dateTo  ‘1-Jan-2007’ (Booking))

 This will produce a (left outer) join of Guest and those tuples of Booking with an end date
(dateTo) greater than or equal to 1-Jan-2007. All guests who don’t have a booking with
such a date will still be included in the join. Essentially this will produce a relation
containing all guests and show the details of any bookings they have beyond 1-Jan-2002.

e) Hotel ⊳ Hotel.hotelNo  Room.hotelNo (price  50 (Room)) )

This will produce a (semi) join of Hotel and those tuples of Room with a price greater
than £50. Only those Hotel attributes will be listed. Essentially this will produce a relation
containing all the details of all hotels with a room price above £50.

f) guestName, hotelNo (Booking ⊳ ⊲ Booking.guestNo  Guest.guestNo Guest) 

hotelNo (city ’London’(Hotel))

This will produce a relation containing the names of all guests who have booked all hotels
in London.

5.9 Provide the equivalent tuple relational calculus and domain relational calculus expressions
for each of the relational algebra queries given in Exercise 4.8.

a) hotelNo (price  50 (Room) )

TRC: {R.hotelNo | Room(R)  R.price  50}

DRC: {hotelNo | (rNo, typ, prce) (Room (rNo, hotelNo, typ, prce)  prce  50)}

b) Hotel.hotelNo  Room.hotelNo(Hotel  Room)

TRC: {H, R | Hotel(H)  (R) (Room(R)  (H.hotelNo  R.hotelNo))}

DRC: {hNo, hName, cty, rNo, hNo1, typ, prce | (Hotel(hNo, hName, cty) 

Room(rNo, hNo1, typ, prce)(hNo = hNo1))}

c) hotelName (Hotel ⊳ ⊲ Hotel.hotelNo  Room.hotelNo (price  50 (Room)) )

TRC: {H.hotelName | Hotel(H)  (R) (Room(R)  (H.hotelNo  R.hotelNo) 

(R.price > 50))}

DRC: {hotelName | (hNo, cty, rNo, hNo1, typ, prce)

(Hotel(hNo, hotelName, cty)  Room(rNo, hNo1, typ, prce)(hNo = hNo1) 

(prce > 50))}

d) Guest ⊐ ⊲ (dateTo  ‘1-Jan-2007’ (Booking))

TRC: {G.guestNo, G.guestName, G.guestAddress, B.hotelNo, B.dateFrom,

B.dateTo, B.roomNo | Guest(G)  (B) (Booking(B) 

(G.guestNo  B.guestNo)  (B.dateTo > ‘1-Jan-2007’))}

DRC: {guestNo, guestName, guestAddress, hotelNo, dateFrom, dateTo, roomNo |

(gNo1) (Guest(guestNo, guestName, guestAddress) 

Booking(hotelNo, gNo1, dateFrom, dateTo, roomNo)

(guestNo = gNo1) (dateTo  ‘1-Jan-2007’)))}

e) Hotel ⊳ Hotel.hotelNo  Room.hotelNo (price  50 (Room)) )

TRC: {H.hotelNo, H.hotelName, H.city | Hotel(H)  (R) (Room(R) 

(H.hotelNo  R.hotelNo)  (R.price > 50))}

DRC: {hotelNo, hotelName, city | (rNo, hNo1, typ, prce)

(Hotel(hotelNo, hotelName, city)  Room(rNo, hNo1, typ, prce)

(hotelNo = hNo1)  (prce > 50))}

 f) guestName, hotelNo (Booking ⊳ ⊲ Booking.guestNo  Guest.guestNo Guest) 

hotelNo (city ’London’(Hotel))

TRC: {G.guestName | Guest(G)  (H) (Hotel(H) 

(H.city = ‘London’)  ((B) (Booking(B) 

G.guestNo  B.guestNo H.hotelNo  B.hotelNo))))}

DRC: {guestName | (gNo, gName, gAddress, hNo, gNo1, dFrom, dTo, rNo,

hName, cty, hNo1, typ, prce) (Hotel(hNo, hName, cty) 

(cty = ‘London’) Guest(gNo, gName, gAddress)

Booking(hNo1, gNo1, dFrom, dTo, rNo) 

(gNo = gNo1) (hNo = hNo1)))}

5.10 Describe the relations that would be produced by the following tuple relational calculus
expressions:

(a) {H.hotelName | Hotel(H)  H.city = ‘London’}

This will produce a relation containing the names of all hotels in London.

(b) {H.hotelName | Hotel(H)  (R) (Room(R)  H.hotelNo  R.hotelNo R.price 

50)}

This will produce a relation containing the names of all hotels that have a room price
above £50.

(c) {H.hotelName | Hotel(H)  (B) (G) (Booking(B)  Guest(G)  H.hotelNo 

B.hotelNo B.guestNo = G.guestNo  G.guestName = ‘John Smith’)}

This will produce a relation containing the names of all hotels that have a booking for
a guest called John Smith.

(d) {H.hotelName, G.guestName, B1.dateFrom, B2.dateFrom | Hotel(H)  Guest(G) 

 Booking(B1)  Booking(B2)  H.hotelNo  B1.hotelNo

G.guestNo = B1.guestNo  B2.hotelNo = B1.hotelNo 

B2.guestNo = B1.guestNo  B2.dateFrom  B1.dateFrom}

This will produce a relation containing the names of guests who have more than one
booking at the same hotel, along with the hotel number and the dates of the bookings.

5.11 Provide the equivalent domain relational calculus and relational algebra expressions for each
of the tuple relational calculus expressions given in Exercise 4.10.

(a) {H.hotelName | Hotel(H)  H.city = ‘London’}

DRC: {hotelName | (hNo, cty) (Hotel(hNo, hotelName, cty)  cty = ‘London’)}

RA: hotelName (city  ‘London’ (Hotel) )

(b) {H.hotelName | Hotel(H)  (R) (Room(R)  H.hotelNo  R.hotelNo R.price 

50)}

DRC: {hotelName | (hNo, cty, rNo, hNo1, typ, prce) (Hotel(hNo, hotelName, cty) 

Room(rNo, hNo1, typ, prce)(hNo = hNo1)  (prce > 50)) }

RA: hotelName (Hotel ⊳ ⊲ Hotel.hotelNo  Room.hotelNo (price  50 (Room)) )

(c) {H.hotelName | Hotel(H)  (B) (G) (Booking(B)  Guest(G)  H.hotelNo 

B.hotelNo B.guestNo = G.guestNo  G.guestName = ‘John Smith’)}

DRC: {hotelName | (hNo, cty, gNo, gName, gAddress, hNo1, gNo1, dFrom, dTo,

rNo) (Hotel(hNo, hotelName, cty) 

Guest(gNo, gName, gAddress)

Booking(hNo1, gNo1, dFrom, dTo, rNo) (gNo = gNo1) 

(hNo = hNo1) (gName = ‘John Smith’))}

 RA: hotelName (guestName  ‘John Smith’ (Guest) ⊳ ⊲ Guest.guestNo  guestNo (

Booking ⊳ ⊲ .Booking.hotelNo  Hotel.hotelNo Hotel))

(d) {H.hotelName, G.guestName, B1.dateFrom, B2.dateFrom | Hotel(H)  Guest(G) 

Booking(B1)  Booking(B2)  H.hotelNo  B1.hotelNo

G.guestNo = B1.guestNo  B2.hotelNo = B1.hotelNo 

B2.guestNo = B1.guestNo  B2.dateFrom  B1.dateFrom}

DRC: {hotelName, guestName, dateFrom1, dateFrom2 | (hNo, cty,

gNo, gAddress, hNo1, gNo1, dTo1, rNo1, hNo2, gNo2, dTo2, rNo2)

(Hotel(hNo, hotelName, cty) 

Guest(gNo, guestName, gAddress)

Booking(hNo1, gNo1, dateFrom1, dTo1, rNo1) 

Booking(hNo2, gNo2, dateFrom2, dTo2, rNo2) 

(hNo = hNo1) (gNo = gNo1) (hNo2 = hNo1) (gNo2 = gNo1) 

(dateFrom1  dateFrom2))}

RA: Booking2(hotelNo, guestNo, dateFrom2, dateTo2, roomNo2) 

hotelNo, guestNo, dateFrom, dateTo, roomNo (Booking)

hotelName, guestName, dateFrom, dateFrom2 (Hotel ⊳ ⊲ Hotel.hotelNo  hotelNo

(Guest ⊳ ⊲ Guest.guestNo  guestNo (Booking ⊳ ⊲ Booking.hotelNo  Booking2.hotelNo

 Booking.guestNo  Booking2.guestNo  dateFrom  dateFrom2 Booking2)))

5.12 Generate the relational algebra, tuple relational calculus, and domain relational calculus
expressions for the following queries:

(a) List all hotels.

RA: Hotel

TRC: {H | Hotel(H)}

DRC: {hotelNo, hotelName, city | Hotel(hotelNo, hotelName, city)}

(b) List all single rooms with a price below £20 per night.

RA: type=‘S’  price < 20(Room)

TRC: {R | Room(R)R.type = ‘S’  R.price < 20}

DRC: {roomNo, hotelNo, type, price | (Room(roomNo, hotelNo, type, price) 

type = ‘S’  price < 20)}

(c) List the names and cities of all guests.

RA: guestName, guestAddress(Guest)

TRC: {G.guestName, G.guestAddress | Guest(G)}

DRC: {guestName, guestAddress | (guestNo)

(Guest(guestNo, guestName, guestAddress))}

(d) List the price and type of all rooms at the Grosvenor Hotel.

RA: price, type(Room ⊳ ⊲ hotelNo (hotelName = ‘Grosvenor Hotel’(Hotel)))

TRC: {R.price, R.type | Room(R) H) (Hotel(H)  (R.hotelNo = H.hotelNo) 

(H.hotelName = ‘Grosvenor Hotel’))}

DRC: {price, type | (roomNo, hotelNo, hotelNo1, hotelName, city)

 (Room(roomNo, hotelNo, type, price)  Hotel(hotelNo1, hotelName, city) 

(hotelNo = hotelNo1)  (hotelName = ‘Grosvenor Hotel’))}

(e) List all guests currently staying at the Grosvenor Hotel.

RA: Guest ⊳ ⊲ guestNo (dateFrom  ‘01-01-15’  dateTo  ‘01-01-15’ (

Booking ⊳ ⊲ hotelNo (hotelName = ‘Grosvenor Hotel’(Hotel))))

(substitute ‘01-01-15’ for today’s date).

TRC: {G |Guest(G)  ((B)(H) (Booking(B) Hotel(H) B.dateFrom  ‘01-01-15’) 

(B.dateTo  ‘01-01-15’)  (B.guestNo = G.guestNo) 

(B.hotelNo = H.hotelNo)  (H.hotelName = ‘Grosvenor Hotel’)))}

DRC: {guestNo, guestName, guestAddress | (hotelNo, guestNo1, dateFrom, dateTo,

hotelNo1, hotelName, city)

(Guest(guestNo, guestName, guestAddress) 

Booking(hotelNo, guestNo1, dateFrom, dateTo) 

Hotel(hotelNo1, hotelName, city)  (guestNo = guestNo1) 

(dateFrom  ‘01-01-15’  dateTo  ‘01-01-15’) 

(hotelNo = hotelNo1) hotelName = ‘Grosvenor Hotel’))}

(f) List the details of all rooms at the Grosvenor Hotel, including the name of the guest
staying in the room, if the room is occupied.

RA: (Room ⊳ ⊲ hotelNo (hotelName = ‘Grosvenor Hotel’(Hotel))) ⊐ ⊲ // Outer Join

guestName, hotelNo, roomNo(

(Guest ⊳ ⊲ guestNo (dateFrom  ‘01-01-15’  dateTo  ‘01-01-15’ (

Booking ⊳ ⊲ hotelNo (hotelName=‘Grosvenor Hotel’(Hotel))))

 (substitute ‘01-01-15’ for today’s date).

TRC: {R, G.guestName | (Room(R) (H)(Hotel(H) 

(R.hotelNo = H.hotelNo) H.hotelName = ‘Grosvenor Hotel’))) 

(Guest(G) ((B)(H) (Booking(B)  Hotel(H) 

(G.guestNo  B.guestNo)  (B.hotelNo = H.hotelNo) 

(H.hotelName = ‘Grosvenor Hotel’) 

(B.dateFrom  ‘01-01-15’ B.dateTo  ‘01-01-15’)))}

DRC: {roomNo, hotelNo, type, price, guestName |

(hNo, hName, city, hNo1, gNo1, dFrom, dTo, rNo)

(Room(roomNo, hotelNo, type, price) Hotel(hNo1, hName, city) 

(hotelNo = hNo1)  (hName = ‘Grosvenor Hotel’) ) 

(Guest(guestNo, guestName, guestAddress)  Hotel(hNo, hName, city) 

Booking(hNo1, gNo1, dFrom, dTo, rNo) 

(guestNo  gNo1)  (hNo1 = hNo) (hName = ‘Grosvenor Hotel’) 

(dFrom  ‘01-01-15’ dTo  ‘01-01-15’)))}

(g) List the guest details (guestNo, guestName, and guestAddress) of all guests staying at
the Grosvenor Hotel.

RA: guestNo, guestName, guestAddress(Guest ⊳ ⊲ guestNo (dateFrom  ‘01-01-15’  dateTo  ‘01-01-15’ (

Booking ⊳ ⊲ hotelNo (hotelName=‘Grosvenor Hotel’(Hotel)))))

(substitute ‘01-01-15’ for today’s date).

TRC: {G | Guest(G)  ((B) (H) (Booking(B)  Hotel(H) (B.guestNo = G.guestNo)


 (B.hotelNo = H.hotelNo) H.hotelName = ‘Grosvenor Hotel’) 

(B.dateFrom  ‘01-01-15’  B.dateTo  ‘01-01-15’) ))}

DRC: {guestNo, guestName, guestAddress |

((hNo, gNo, dFrom, dTo, rNo, hNo1, hName, city)

(Guest(guestNo, guestName, guestAddress) 

Booking(hNo, gNo, dFrom, dTo, rNo)  Hotel(hNo1, hName, city) 

(guestNo = gNo)  (hNo = hNo1) hName = ‘Grosvenor Hotel’) 

(dFrom  ‘01-01-15’  dTo  ‘01-01-15’) ))}

5.13 Using relational algebra, produce a report of all employees from the IT and planning
departments who are born after 1990.

The report can be obtained through union operator by combining results of a query that retrieves
employees born after 1990 from IT and the query of the employees born after 1990 from
planning.

deptNo=‘IT’ dob>’31-12-1990’(employee) υ deptNo=‘PL’ dob>’31-12-1990’(employee)

The report could also be produced by a query that uses OR (V) operator to
combine result of the employees born after 1990 from IT and the result of
employees born after 1990 and from Planning department.
((deptNo=‘IT’ dob>’31-12-1990’)  (deptNo=‘PL’ dob>’31-12-1990’)) (employee)

5.14 List all employees.

RA: Employee

TRC: {E | Employee(E)}

DRC: {empNo, fName, lName, address, DOB, sex, position, deptNo |

Employee(empNo, fName, lName, address, DOB, sex, position,
deptNo)}
5.15 List all the details of employees who are female and born after 1990.

RA:  dob>’31-12-1990’(Employee)
sex=‘F’

TRC: {E | Employee(E)E.sex = ‘F’dob>’31-12-1990’)}

DRC: {empNo, fName, lName, address, DOB, sex, position, deptNo | Employee(empNo,

fName, lName, address, DOB, sex, position, deptNo)  (sex=’F’

dob>’31-12-1990’)}

5.16 List all employees who are not managers and are paid more than $1500.

RA: position ≠ ‘manager’ salary>1500 (Employee)

TRC: {E. | Employee(E) E.position ≠ ‘manager’ salary>500)}

DRC: { fName, lName, address | Employee(empNo, fName, lName, address, DOB, sex,

position, deptNo)  (position≠’manager’  salary>1500)}

5.17 Produce a list of the names and addresses of all employees who work for the IT department.

RA: fName, lName,address(Employee ⊳ ⊲ Employee. deptNo=Dept .deptNo ¿¿

TRC: {E.fName, E.lName, E.address | Employee(E)  (D) (Dept(D)  (E.deptNo

= D.deptNo)  (D.deptName = ‘IT’))}

DRC: {fName, lName, address | (empNo, DOB, sex, position, deptNo, deptNo1,

deptName, mgrEmpNo) (Empoyee(empNo, fName, lName, address, DOB,

sex, position, deptNo)  Department (deptNo1, deptName, mgrEmpNo) 

(deptNo = deptNo1)  (deptName = ‘IT’))}

5.18 Produce a list of the names of all employees who work on the SCCS project.

RA:  fName, lName (Employee ⊳ ⊲ empNo (WorksOn projNo ( projName = ‘SCCS’(Project)))

TRC: {E.fName, E.lName | Employee(E)  (W) (P) (WorksOn(W)  Project(P) 

(P.projName = ‘SCCS’)  (P.projNo = W.projNo)  (E.empNo = W.empNo))

DRC: {fName, lName | (empNo, address, DOB, sex, position, deptNo, projNo,

projName, deptNo1, empNo1, projNo1, dateWorked, hoursWorked)

(Employee (empNo, fName, lName, address, DOB, sex, position, deptNo) 

Project (projNo, projName, deptNo1)  WorksOn (empNo1, projNo1,

dateWorked, hoursWorked)  (empNo = empNo1)  (projNo = projNo1) 

(projName = ‘SCCS’))}

5.19 Produce a complete list of all managers who are due to retire this year, in alphabetical order
of surname.

Formulate the following queries in relational algebra.

5.20 Find out how many managers are female.

COUNT empNo(sex = ‘F’  position = ‘manager’(Employee))

5.21 Produce a report of all projects under the IT department.

depno=‘IT’(project)
5.22 Using the union operator, retrieve the list of employees who are neither managers nor
supervisors. Attributes to be retrieved are first name, last name, position, sex and department
number.

position = ‘manager’(fname, lName, sex,position,depno( Employee))

U
position = ‘supervisor’(fname, lName, sex,position,depno( Employee))

5.23 List the total number of employees in each department for those departments with more than
10 employees. Create an appropriate heading for the columns of the results table.

(empCount > 10(R(deptNo, empCount) deptNo COUNT empNo(Employee)))))

The following tables form part of a Library database held in an RDBMS:

Book (ISBN, title, edition, year)

BookCopy (copyNo, ISBN, available)

Borrower (borrowerNo, borrowerName, borrowerAddress)

BookLoan (copyNo, dateOut, dateDue, borrowerNo)

where Book contains details of book titles in the library and the ISBN is the key.

BookCopy contains details of the individual copies of books in the library and
copyNo is the key. ISBN is a foreign key identifying the book title.

Borrower contains details of library members who can borrow books and borrowerNo
is the key.

BookLoan contains details of the book copies that are borrowed by library members and
copyNo/dateOut forms the key. borrowerNo is a foreign key identifying
the borrower.

Formulate the additional queries in relational algebra, tuple relational calculus, and domain relational
calculus.

5.24 List all book titles.

 RA: title(Book)

TRC: {B.title | Book(B)}

DRC: {title | (ISBN, edn, yr) (Book(ISBN, title, edn, yr) }

5.25 List all borrower details.

RA: Borrower

TRC: {B | Borrower(B)}

DRC: {bNo, bName, bAddress | (Borrower(bNo, bName, bAddress) }

5.26 List all book titles published in the year 2012.

RA: title(year=‘2012’(Book))

TRC: {B.title | Book(B)  B.year=’2012’}

DRC: {title | (ISBN, edn, yr) (Book(ISBN, title, edn, yr)  yr=’2012’}

5.27 List all copies of book titles that are available for borrowing.

RA: copyNo, title(Book ⊳ ⊲ ISBN (available=‘Y’(BookCopy)))

TRC: {BC.copyNo, B.title | Book(B)  (BC) (BookCopy(BC)  (B.ISBN = BC.ISBN)

 (BC.available=‘Y’))}

DRC: {copyNo, title | (ISBN, edn, yr, ISBN, avail) (Book(ISBN, title, edn, yr) 
BookCopy(copyNo, ISBN, avail)  avail=’Y’)}

5.28 List all copies of the book title “Lord of the Rings” that are available for borrowing.

RA: copyNo(title=‘Lord of the Rings’ (Book) ⊳ ⊲ ISBN (available=‘Y’(BookCopy)))

TRC: {BC.copyNo | BookCopy(BC)  (B) (Book(B)  (B.ISBN = BC.ISBN) 

(BC.available=‘Y’)  (B.title= ‘Lord of the Rings’))}

 DRC: {copyNo | (ISBN, edn, yr, ISBN, avail) (Book(ISBN, title, edn, yr) 
BookCopy(copyNo, ISBN, avail)  avail=’Y’  title= ‘Lord of the
Rings’)}

5.29 List the names of borrowers who currently have the book title “Lord of the Rings” on loan.

RA: borrowerName( ( (title=‘Lord of the Rings’ (Book)) ⊳ ⊲ ISBN (available=‘N’(BookCopy)) )

⊳ ⊲ copyNo (BookLoan) ⊳ ⊲ borrowerNo (Borrower) )

TRC: {BW.borrowerName | Borrower(BW)  (BL) (B) (BC) (Book(B) 

BookCopy(BC)  BookLoan(BL)  (BC.ISBN = B.ISBN) 

(BW.borrowerNo = BL.borrowerNo)  (BL.copyNo = BC.copyNo) 

(BC.available=‘N’)  (B.title= ‘Lord of the Rings’))}

DRC: {borrowerName | (ISBN, title, edn, yr, copyNo, avail, bNo, bAddress, dOut,
dDue) (Book(ISBN, title, edn, yr)  BookCopy(copyNo, ISBN, avail) 
Borrower(bNo, borrowerName, bAddress)  BookLoan(copyNo, dOut,
dDue, bNo)  avail=’N’  title= ‘Lord of the Rings’)}

5.30 List the names of borrowers with overdue books.

RA: borrowerName(Borrower ⊳ ⊲ borrowerNo (dateDue>‘today’s date’(BookLoan)))

TRC: {BW.borrowerName | Borrower(BW)  (BL) (BookLoan(BL) 

(BW.borrowerNo = BL.borrowerNo)  (BL.dateDue> ‘today’s date’))}

DRC: {borrowerName | (bNo, bAddress, copyNo, dOut, dDue)

(Borrower(bNo, borrowerName, bAddress)  BookLoan(copyNo, dOut,
dDue, bNo)  dDue>‘today’s date’)}

Formulate the following queries in relational algebra.

5.31 How many copies of ISBN “0-321-52306-7” are there?

COUNT copyNo(ISBN = ‘0-321-52306-7’ (BookCopy ))

5.32 How many copies of ISBN “0-321-52306-7” are currently available?

COUNT copyNo(available = ‘Y’  ISBN = ‘0-321-52306-7’ (BookCopy ))

5.33 How many times has the book title with ISBN “0-321-52306-7” been borrowed?

COUNT copyNo((ISBN = ‘0-321-52306-7’ (BookCopy) ⊳ ⊲ copyNo BookLoan)

5.34 Produce a report of book titles that have been borrowed by “Peter Bloomfield”.

title(Book ⊳ ⊲ ISBN ((BookCopy ⊳ ⊲ copyNo BookLoan) ⊳ ⊲ borrowerNo

(borrowerName = ‘Peter Bloomfield’(Borrower)) ))

5.35 For each book title with more than 3 copies, list the names of library members who have
borrowed them.

5.36 Produce a report with the details of borrowers who currently have books overdue.

borrowerName, borrowerAddress(Borrower ⊳ ⊲ borrowerNo (dateDue>‘today’s date’(BookLoan)))

5.37 Produce a report detailing how many times each book title has been borrowed.

ISBN COUNT copyNo(BookCopy ⊳ ⊲ copyNo BookLoan)

5.38 Analyze the RDBMSs that you are currently using. What types of relational languages does
the system provide? For each of the languages provided, what are the equivalent operations
for the eight relational algebra operations defined in Section 5.1?

This is a small student project, the result of which is dependent on the system analyzed.
However, it is likely that the supported languages will be based around SQL and QBE, in
which case, the student should attempt to map the various SQL clauses to the algebra and
calculus. See also Exercise 5.31.
 Chapter 6 SQL: Data Manipulation

Review Questions

6.1 Briefly describe the four basic SQL DML statements and explain their use.

Section 6.3 describes the usage of basic data manipulation SQL statements; SELECT INSERT,
UPDATE and DELETE.

6.2 Explain the importance and application of the WHERE clause in the UPDATE and DELETE
statements.

Application

 Optionally used in the UPDATE and DELETE statements.

 Used when update or delete is done to some few rows
 Not used if the updates is to reflect all the available rows

Importance

 It controls where updates needs to be effected

 Protects data from being changed and deleted unnecessarily
 Enforces data quality

6.3 Explain the function of each of the clauses in the SELECT statement. What restrictions are
imposed on these clauses?

FROM Specifies the table or tables to be used.

WHERE Filters the rows subject to some condition.
GROUP BY Forms groups of rows with the same column value.
HAVING Filters the groups subject to some condition.
SELECT Specifies which columns are to appear in the output.
ORDER BY Specifies the order of the output.

If the SELECT list includes an aggregate function and no GROUP BY clause is being used to
group data together, then no item in the SELECT list can include any reference to a column
unless that column is the argument to an aggregate function.
 When GROUP BY is used, each item in the SELECT list must be single-valued per group.
Further, the SELECT clause may only contain:

 Column names.
 Aggregate functions.
 Constants.
 An expression involving combinations of the above.

All column names in the SELECT list must appear in the GROUP BY clause unless the name is
used only in an aggregate function.

6.4 What restrictions apply to the use of the aggregate functions within the SELECT statement? How
do nulls affect the aggregate functions?

An aggregate function can be used only in the SELECT list and in the HAVING clause.

Apart from COUNT(*), each function eliminates nulls first and operates only on the remaining
non-null values. COUNT(*) counts all the rows of a table, regardless of whether nulls or duplicate
values occur.

6.5 How can results from two SQL queries be combined? Differentiate how the INTERSECT and
EXCEPT commands work.

There are number of relational operators that can be used to combine results of two queries. Some
of them are UNION, INTERSECT, and EXCEPT. For the two results to be semanticaly
combined, order and number of columns from both results should be identical, and the combining
columns should be of the same domain.
The difference between the two is well explained in section 6.3.9 where the intersect returns the
rows that are common to both result sets, and except returns rows that are available in the first
result set and not in the second result set.

6.6 Differentiate between the three types of subqueries. Why is it important to understand the nature
of a subquery result before you write an SQL statement?

The subquery types are scalar, row, and table subquery. The main difference is on the nature of
results they return; scalar subquery returns a single column and single row that is a single value,
row subquery returns multiple columns and single row, while table subquery returns multiple
 columns and multiple rows. It is so import to understand the nature of subquery result so that you
can make the best choice about the operator to be used

Exercises

For the Exercises 6.7 – 6.28, use the Hotel schema defined at the start of the Exercises at the end of
Chapter 3.

Simple Queries

6.7 List full details of all hotels.

SELECT * FROM Hotel;

6.8 List full details of all hotels in London.

SELECT * FROM Hotel WHERE city = ‘London’;

6.9 List the names and addresses of all guests in London, alphabetically ordered by name.

SELECT guestName, guestAddress FROM Guest WHERE address LIKE ‘%London%’

ORDER BY guestName;

Strictly speaking, this would also find rows with an address like: ‘10 London Avenue, New
York’.

6.10 List all double or family rooms with a price below £40.00 per night, in ascending order of price.

SELECT * FROM Room WHERE price < 40 AND type IN (‘D’, ‘F’)
ORDER BY price;

(Note, ASC is the default setting).

6.11 List the bookings for which no dateTo has been specified.

SELECT * FROM Booking WHERE dateTo IS NULL;

Aggregate Functions
6.12 How many hotels are there?

SELECT COUNT(*) FROM Hotel;

6.13 What is the average price of a room?

SELECT AVG(price) FROM Room;

6.14 What is the total revenue per night from all double rooms?

SELECT SUM(price) FROM Room WHERE type = ‘D’;

6.15 How many different guests have made bookings for August?

SELECT COUNT(DISTINCT guestNo) FROM Booking

WHERE (dateFrom <= DATE’2004-08-01’ AND dateTo >= DATE’2004-08-01’) OR
(dateFrom >= DATE’2004-08-01’ AND dateFrom <= DATE’2004-08-31’);

Subqueries and Joins

6.16 List the price and type of all rooms at the Grosvenor Hotel.

SELECT price, type FROM Room

WHERE hotelNo =
(SELECT hotelNo FROM Hotel
WHERE hotelName = ‘Grosvenor Hotel’);

6.17 List all guests currently staying at the Grosvenor Hotel.

SELECT * FROM Guest

WHERE guestNo =
(SELECT guestNo FROM Booking
WHERE dateFrom <= CURRENT_DATE AND
dateTo >= CURRENT_DATE AND
hotelNo =
(SELECT hotelNo FROM Hotel
WHERE hotelName = ‘Grosvenor Hotel’));
6.18 List the details of all rooms at the Grosvenor Hotel, including the name of the guest staying in the
room, if the room is occupied.

SELECT r.* FROM Room r LEFT JOIN

(SELECT g.guestName, h.hotelNo, b.roomNo FROM Guest g, Booking b, Hotel h
WHERE g.guestNo = b.guestNo AND b.hotelNo = h.hotelNo AND
hotelName= ‘Grosvenor Hotel’ AND
dateFrom <= CURRENT_DATE AND
dateTo >= CURRENT_DATE) AS XXX
ON r.hotelNo = XXX.hotelNo AND r.roomNo = XXX.roomNo;

6.19 What is the total income from bookings for the Grosvenor Hotel today?

SELECT SUM(price) FROM Booking b, Room r, Hotel h

WHERE (dateFrom <= CURRENT_DATE AND
dateTo >= CURRENT_DATE) AND
r.hotelNo = h.hotelNo AND r.roomNo = b.roomNo AND
hotelName = ‘Grosvenor Hotel’;

6.20 List the rooms that are currently unoccupied at the Grosvenor Hotel.

SELECT * FROM Room r

WHERE roomNo NOT IN
(SELECT roomNo FROM Booking b, Hotel h
WHERE (dateFrom <= CURRENT_DATE AND
dateTo >= CURRENT_DATE) AND
b.hotelNo = h.hotelNo AND hotelName = ‘Grosvenor Hotel’);

6.21 What is the lost income from unoccupied rooms at the Grosvenor Hotel?

SELECT SUM(price) FROM Room r

WHERE roomNo NOT IN
(SELECT roomNo FROM Booking b, Hotel h
WHERE (dateFrom <= CURRENT_DATE AND
dateTo >= CURRENT_DATE) AND
b.hotelNo = h.hotelNo AND hotelName = ‘Grosvenor Hotel’);
Grouping

6.22 List the number of rooms in each hotel.

SELECT hotelNo, COUNT(roomNo) AS count FROM Room

GROUP BY hotelNo;

6.23 List the number of rooms in each hotel in London.

SELECT hotelNo, COUNT(roomNo) AS count FROM Room r, Hotel h

WHERE r.hotelNo = h.hotelNo AND city = ‘London’
GROUP BY hotelNo;

6.24 What is the average number of bookings for each hotel in August?

SELECT AVG(X)
FROM ( SELECT hotelNo, COUNT(hotelNo) AS X
FROM Booking b
WHERE (dateFrom <= DATE’2004-08-01’ AND
dateTo >= DATE’2004-08-01’) OR
(dateFrom >= DATE’2004-08-01’ AND
dateFrom <= DATE’2004-08-31’)
GROUP BY hotelNo);

Yes - this is legal in SQL-92!

6.25 What is the most commonly booked room type for each hotel in London?

SELECT MAX(X)
FROM ( SELECT type, COUNT(type) AS X
FROM Booking b, Hotel h, Room r
WHERE r.roomNo = b.roomNo AND b.hotelNo = h.hotelNo AND
city = ‘London’
GROUP BY type);

6.26 What is the lost income from unoccupied rooms at each hotel today?

SELECT hotelNo, SUM(price) FROM Room r

 WHERE roomNo NOT IN
(SELECT roomNo FROM Booking b, Hotel h
WHERE (dateFrom <= CURRENT_DATE AND
dateTo >= CURRENT_DATE) AND
b.hotelNo = h.hotelNo)
GROUP BY hotelNo;

Populating Tables

6.27 Insert records into each of these tables.

INSERT INTO Hotel

VALUES (‘H111’, ‘Grosvenor Hotel’, ‘London’);

INSERT INTO Room

VALUES (‘1’, ‘H111’, ‘S’, 72.00);
INSERT INTO Guest
VALUES (‘G111’, ‘John Smith’, ‘London’);
INSERT INTO Booking
VALUES (‘H111’, ‘G111’, DATE’2005-01-01’, DATE’2005-01-02’, ‘1’);

6.28 Update the price of all rooms by 5%.

UPDATE Room SET price = price*1.05;

General

6.29 Investigate the SQL dialect on any DBMS that you are currently using. Determine the compliance
of the DBMS with the ISO standard. Investigate the functionality of any extensions the DBMS
supports. Are there any functions not supported?

This is a small student project, the result of which is dependent on the dialect of SQL being used.

6.30 Demonstrate that queries written using the UNION operator can be rewritten using the OR
operator to produce the same result.

Hint: students should explain a query that can be written in two ways by using UNION and OR
operators.
6.31 Apply the syntax for inserting data into a table.

Description of the data insert can be found in section 6.3.10. Studenst should simulate data entry
by using the provided syntax

Case Study 2

For Exercises 6.32–6.40, use the Projects schema defined in the Exercises at the end of Chapter 5.

6.32 List all employees from BRICS countries in alphabetical order of surname.

SELECT * FROM Employee WHERE address LIKE ‘%Brazil%’ OR address LIKE

‘%Rusia%’ OR address LIKE ‘%India%’ OR address LIKE ‘%China%’ OR address
LIKE ‘%South Africa%’ ORDER BY lName, fName;

6.33 List all the details of employees born between 1980--90.

SELECT * FROM Employee WHERE DOB like ‘%198%’;

6.34 List all managers who are female in alphabetical order of surname, and then first name.

SELECT * FROM Employee where position=‘Manager’ and sex=‘F’ ORDER BY lName,

fName;

6.35 Remove all projects that are managed by the planning department.

DELETE FROM Project p

WHERE projNo IN (SELECT p.projNo
FROM project p, workson w
WHERE P.projno=w.projno);

6.36 Assume the planning department is going to be merged with the IT department. Update
employee records to reflect the proposed change.
 UPDATE employee

SET deptNO=”IT”

WHERE deptNo=”PL”;

6.37 Using the UNION command, list all projects that are managed by the IT and the HR
department.

SELECT * FROM PROJECT

WHERE deptNo=”IT”
UNION
SELECT * FROM PROJECT
WHERE deptNo=”HR”;

6.38 Produce a report of the total hours worked by each female employee, arranged by department
number and alphabetically by employee surname within each department.

SELECT e.lName, e.fName, hoursWorked

FROM WorksOn w, Employee e, Department d
WHERE e.deptNo = d.deptNo
AND e.empNo = w.empNo
AND e.sex=’F’
ORDER by d.deptNo, e.lName;

6.39 Remove all project from the database on which no employees worked.

DELETE FROM Project p

WHERE projNo IN (SELECT p.projNo

FROM project p, workson w

WHERE P.projno=w.projno);

6.40 List the total number of employees in each department for those departments with more than
10 employees. Create an appropriate heading for the columns of the results table.

SELECT COUNT(empNo) AS empCount, deptNo

FROM Employee
 GROUP BY deptNo

HAVING COUNT(empNo) > 10;

Case Study 3

For Exercises 6.41–6.54, use the Library schema defined in the Exercises at the end of Chapter 5.

6.41 List all book titles.

SELECT title FROM Book;

6.42 List all borrower details.

SELECT * FROM Borrower;

6.43 List all books titles published between 2010 and 2014.

SELECT *

FROM book

WHERE year BETWEEN ‘2010’ AND ‘2014’;

6.44 Remove all books published before 1950 from the database.

DELETE FROM book

WHERE year < ‘1950’;

6.45 List all book titles that have never been borrowed by any borrower.

SELECT *

FROM BOOK

WHERE ISBN NOT IN (SELECT ISBN

FROM BOOKCOPY C, BOOKLOAN L

WHERE L.copyno=C.copyno);

6.46 List all book titles that contain the word ‘database’ and are available for loan.
 SELECT b.ISBN, b.title, b.edition, b.year, c.available

FROM book b, bookcopy c

WHERE b.ISBN=c.ISBN AND b.title like ‘%database%’ AND

c.available=’yes’;

6.47 List the names of borrowers with overdue books.

SELECT borrowerName

From Borrower bw, BookLoan bl

WHERE bw.borrowerNo = bl.borrowerNo and dateDue > today’s date;

6.48 How many copies of each book title are there?

SELECT b.title, count (b.copyno) AS numberOfcopies

FROM book b, bookcopy c

WHERE b.ISBN=c.ISBN

Group by b.title;

6.49 How many copies of ISBN “0-321-52306-7” are currently available?

SELECT COUNT(copyNo)

FROM BookCopy

WHERE available = ‘Y’ AND ISBN = ‘0-321-52306-7’;

6.50 How many times has the book with ISBN “0-321-52306-7” been borrowed?

SELECT COUNT(*)

FROM BookCopy bc, BookLoan bl

WHERE bc.copyNo = bl.copyNo AND ISBN = ‘0-321-52306-7’;

6.51 Produce a report of book titles that have been borrowed by “Peter Bloomfield”.
 SELECT DISTINCT title

FROM Borrower bw, Book b, BookCopy bc, BookLoan bl

WHERE bw.borrowerNo = bl.borrowerNo AND bl.copyNo = bc.copyNo

AND bc.ISBN = b.ISBN AND borrowerName = ‘Peter Bloomfield’;

6.52 For each book title with more than 3 copies, list the names of library members who have
borrowed them.

SELECT title, borrowerName

FROM Borrower bw, Book b, BookCopy bc, BookLoan bl

WHERE bw.borrowerNo = bl.borrowerNo AND bl.copyNo = bc.copyNo

AND bc.ISBN = b.ISBN AND EXISTS

(SELECT ISBN, COUNT(bc1.copyNo)

FROM BookCopy bc1

WHERE bc1.ISBN = bc.ISBN

GROUP BY bc1.ISBN

HAVING COUNT(bc1.copyNo) > 3);

6.53 Produce a report with the details of borrowers who currently have books overdue.

SELECT borrowerName, borrowerAddress

From Borrower bw, BookLoan bl

WHERE bw.borrowerNo = bl.borrowerNo and dateDue > today’s date;

6.54 Produce a report detailing how many times each book title has been borrowed.

SELECT ISBN, COUNT(*)

FROM BookCopy bc, BookLoan bl

WHERE bc.copyNo = bl.copyNo

GROUP BY ISBN;