Given a relation R={A,B,C,D}
Answer the following questions withthe given a set of FDs:
- Identify candidate keys
- State the strongest normal form that R satisfies (e.g., 1NF,2NF, 3NF or BCNF)
- Decompose R into a set of BCNF relations that satisfies thedependency preservation property
- FDs:
A → B
B → C
C → D
- FDs:
AB → C
AB → D
B → C
C → D
- FDs:
A → B
BC → D
A → C
Answer
First of all we are finding the all the candidate keys possiblefor particular set of FD’s then according to theirconditions ,saying whether they are in 1NF or 2NF or 3NFaccordingly.Then they are converted into to the
OR
OR