Decompose r into collections of relations as necessary


Task 2 - Functional Dependencies & Normalization (40 Points)
Question 1
Consider a relation R(ABCDE) with FD's: D->C, CE->A, D->A, and AE->D.

a. What are all the nontrivial FD's that follow from the given FD's? You should restrict yourself to FD's with single attributes on the right side.

b.  What are all the keys of R?

c.  What are all the prime attributes of R?

d. What are all the superkeys of R that are not keys?


Question 2
Given the relation schema R(A,B,C,D) and a set of FD's AB?C, BC?D, CD?A and AD?B 

a.  Indicate all the BCNF violations that have one attribute on the left side.

b.Indicate all the 3NF violations that have one attribute on the left side.

c.Decompose R into collections of relations, as necessary, that are in BCNF.

d.  Decompose R into collections of relations, as necessary, that are in 3NF.

Request for Solution File

Ask an Expert for Answer!!
Basic Computer Science: Decompose r into collections of relations as necessary
Reference No:- TGS0120808

Expected delivery within 24 Hours