Question

Using 3NF, decompose R into the proper tables —Show your steps
R = (A, B, C, D, E, F)FDs = { A -> C, A -> D, B -> E, B -> D, A -> A, AB -> A, A -> F }
Find out the minimal set of the above FD.

Answer 1

All attributes of an original schema (R) must appear in the ... The decomposition of a relation scheme R with FDs F is a set of tables (fragments) R i with FDs F i. F i is the subset of dependencies in F+ (the closure of F) that ... Assume there is a dependency B→ C, where the LHS is not the key ... CD → E and B → D are lost.