Consider a relation R with six attributes A , B , C , D , E , F . You are given

Question

Consider a relation R with six attributes A, B, C, D, E, F. You are given the following dependences:

Cà F, E

BCà D,

AD à B, and

ED à C.

Is {(ABCD)} a candidate key of this relation? If not, is {(ABC)}? Justify your answer.

Consider the relation F with five attributes M,O,N,E,Y with the following dependences:

   O à N,

OY àM,

MY à E, and

MN àO.

List all keys for F and justify your answer.

Determine normal form for the relation F and justify your answer.

Assume we are given decomposition: F1(O, Y, M), F2(O, N, E, Y) as indicated in the below figure.

Is the decomposition lossless join? Justify your answer.

Is the decomposition dependency preserving? Justify your answer.

Answer:

Is F1(O, Y, M) not in BCNF? Justify your answer.

Answer:

Explanation / Answer

If we talk about the first problem then ABC is not a candidate key because we cannot drawn all elets with ABC but ABCD is a candidate key whicg can be used as primary key

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.