4) Consider the following set F of FDs on the relation schema R(A, B, C, D,...

 

Transcribed Image Text:

4) Consider the following set F of FDs on the relation schema R(A, B, C, D, E, F): ABCD, BC DE, B D, D A a. Compute B. (10) b. Prove, using Armstrong's axioms (see ppt), that AF is a superkey. (10) c. Compute a minimal cover (canonical cover) for the above set of FDs F. You must give every step of your derivation with an explanation. (10) d. Give a 3NFdecomposition of R based on the minimal cover. (10) e. Give a 3BCNFdecomposition of R using the original set of FDs F. (10) 4) Consider the following set F of FDs on the relation schema R(A, B, C, D, E, F): ABCD, BC DE, B D, D A a. Compute B. (10) b. Prove, using Armstrong's axioms (see ppt), that AF is a superkey. (10) c. Compute a minimal cover (canonical cover) for the above set of FDs F. You must give every step of your derivation with an explanation. (10) d. Give a 3NFdecomposition of R based on the minimal cover. (10) e. Give a 3BCNFdecomposition of R using the original set of FDs F. (10)