recategorized by
2,778 views
5 votes
5 votes

Consider the following schema:

$\text{Sailors(sid,sname,rating,age)}$
$\text{Boats(bid,bname,colour)}$
$\text{Reserves(sid,bid,day)}$

Two boats can have the same name but the colour differentiates them.

The two relations

$\rho (Tempsids,(\pi _{sid,bid}\,Reserves)/(\pi_{bid}(\sigma_{bname='Ganga'}\,Boats ))),$
$\pi_{sname}(Tempside\Join Sailors)$

If $/$ is division operation, the above set of relations represents the query

  1. Names of sailors who have reserved all boats called Ganga.
  2. Names of sailors who have not reserved any Ganga boat.
  3. Names of sailors who have reserved at least one Ganga boat.
  4. Names of sailors who have reserved at most one Ganga boat.
recategorized by

2 Answers

Answer:

Related questions

5 votes
5 votes
1 answer
4
gatecse asked Dec 17, 2017
4,355 views
Consider the schema$\text{Sailors(sid,sname,rating,age) with the following data}$$\begin{array}{|l|l|l|l|} \hline \textbf{sid} & \textbf{sname} & \textbf{rating} & \textb...