University of California Irvine SQL Programming Code Worksheet
Description
Unformatted Attachment Preview
-X and Y are entity sets
-R is a relation
-X1, X2, X3, X4, X5, and X6 are all the instances
of X
-Y1, Y2, Y3, and Y4 are all the instances of Y
-Y2 is Rd by X1, Y3 is Rd by X2
-no other pairs of instances of X and Y are related
by R
Which of the ER diagrams on the next slide is/are consistent
with the above assumptions, and which isn/aren. Be sure
to explain your answers.
(No credit without valid
explanations.)
(i)
1
R
X
1
(ii)
X
X
N
Y
1
R
N
(iv)
Y
R
X
N
(iii)
1
Y
M
R
Y
2. Consider the ER diagram on the next slide.
(i) What is the key of entity set A
(ii) What is the key of entity set B
(iii) What is the key of entity set C
Be sure to explain how you got your answers. (No credit
without valid explanations.)
b4
b3
b5
b2
c2
c3
b6
b1
b7
c4
c1
B
R2
c
1
N
1
a1
a2
N
R1
A
3. Translate the following ER diagram into a minimal storage
relational design. Be sure to explain why itàa minimal
storage design. (No credit without a valid explanation.)
b1
a2
b2
a3
a1
a4
A
B
R
M
N
4. Translate the following ER diagram into a minimal storage
relational design. Be sure to explain why itàa minimal
storage design. (No credit without a valid explanation.)
b1
a2
b2
a3
a1
a4
A
B
R
1
1
5. Translate the following ER diagram into a minimal storage
relational design. Be sure to explain why itàa minimal
storage design. (No credit without a valid explanation.)
d1
d2
D
b1
a1
b2
a2
A
B
R
C
c1
c2
Purchase answer to see full
attachment
Have a similar assignment? "Place an order for your assignment and have exceptional work written by our team of experts, guaranteeing you A results."