Question: Question: . 2. CO3 a) Consider the following set of functional dependency for the relation schema R (A, B, ... 2 [C03 | ay] Consider the following set of Fmetonal dependency for the relation schema R= (A.B,C,D, EE M.N,P,B) + AB EEMNPR + ASGD + BEEERMN «MeN ‘Now normalize the given functional dependency up to 3NF ‘©O3 | by | Consider the functional dependency of relation R (A.B, C.D) F= [ASBC, BHC, AB, AB=CD, BD } Compute the canonical cover Fe oF F (@. given Schema R(A,B.C.D.E.EMN,PR) ‘With FDs given as AB ---> E, F, M,N, P.R A>C,D B>E,F,M.N M>N Definition of 3NF: a, FD X->Y is in 3NF ifand only if Xis a candidate key or super key, or Y isa prime attribute Fiding the candidate key for relation R (AB)* = ABCDEFMNPR hence, closure of AB containing all the elements of relation R then we can say that AB is a candidate ky. breaking the elation nto 3NF R(A,C.D) R,(B,E.F.M,N) —— Ry(M,N) Ry(AB) : this relation preserves A+CD BE,F.MN MN ogetessjoinas ABisa ‘candidate key &), for a given relation R(A,B,C,D) and set of FDs are given as F = {A—BC, B>C, AB, ABCD, BD } finding the canonical cover for F st breaking the complex FDS into simpler As A= Band As AB CD = AB C and AB D now finding the minimal cover (Ayr =A, hence A is not covering B,C find closure on A without the help of FD A->B, A>C80, A + B and A C is required also, finding the closure of AB without the use of FD ABCD (AB)” = ABCD hence AB covers CD also then FD AB=>CD isnot eugired minimal cover of Fis A+ B,A+C,B> CB D} this ean also be written as= {A> BC,B> CD}