Question 2 [22 marks] Consider the following database schema: R(A, B, C, D, E, F, G, H) with the set of functional dependencies FD = {F →A, AC →E, E →B, BG →F, BE ➜D, BDH →E, D →H, CD →A, A →E, AD →BE} Q2.1 [12 points] 1. List all the candidate keys for R with respect to the set FD. 2. Explain why R is not in BCNF with respect to FD. 3. Produce a BCNF decomposition of this schema using the algorithm presented in class. For full points, clearly list ALL the relations in the final decomposition and, for each relation, state what is the corresponding set of functional dependencies. Show the full details of your work. Q2.2 [10 points] 1. Explain why R is not in 3NF with respect to FD. 2. Produce a 3NF decomposition of this schema using the technique discussed in class (list both the relations and the corresponding set of functional dependencies). Make sure to identify the minimal basis on which you based your 3NF decomposition. Discuss whether you need to apply the last step of the algorithm discussed in class and add an additional relation. Show the full details of your work.

Solved: Question 2 [22 marks] Consider the following database schema: R(A, B,

Home
questions and answers
question 2 22 marks consider the following database schema r a b c d e

Question

Question 2 [22 marks] Consider the following database schema: R(A, B, C, D, E, F, G, H) with the set of functional dependencies FD = {F →A, AC →E, E →B, BG →F, BE ➜D, BDH →E, D →H, CD →A, A →E, AD →BE} Q2.1 [12 points] 1. List all the candidate keys for R with respect to the set FD. 2. Explain why R is not in BCNF with