Task 4: Consider the relation schema R(A, B, C, D, E) with the following FDs FD1: {A,B,C} → {D,E} FD2: {B,C,D} → {A,E} FD3: {C} → {D} a) Show that R is not in BCNF. Ans) X = {C} then X+ = {C, D} which is not R therefore X is not a superkey, so R is not in BCNF. b) Decompose R into a set of BCNF relations (describe the process step by step). Ans) FD3 violates BCNF. Decomposing R using FD3. R1(C,D) with FDs: FD3, CK: {C} R2(A,B,C,E) with new FD: {A,B,C} → E (Decomposed from FD1), CK: {A,B,C} {BC}+ = {BC} - Not a candidate key {ABC}+ = {ABCDE} - A candidate key {BCD}+ = {ABCDE} - A candidate key Candidate Keys = {ABC}, {BCD} The result of the decomposition consists of R1 and R2 %3D %3D %3D

Task 4: Consider the relation schema R(A, B, C, D, E) with the following FDs FD1: {A,B,C} → {D,E} FD2: {B,C,D} → {A,E} FD3: {C} → {D} a) Show that R is not in BCNF. Ans) X = {C} then X+ = {C, D} which is not R therefore X is not a superkey, so R is not in BCNF. b) Decompose R into a set of BCNF relations (describe the process step by step). Ans) FD3 violates BCNF. Decomposing R using FD3. R1(C,D) with FDs: FD3, CK: {C} R2(A,B,C,E) with new FD: {A,B,C} → E (Decomposed from FD1), CK: {A,B,C} {BC}+ = {BC} - Not a candidate key {ABC}+ = {ABCDE} - A candidate key {BCD}+ = {ABCDE} - A candidate key Candidate Keys = {ABC}, {BCD} The result of the decomposition consists of R1 and R2 %3D %3D %3D

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

7 PLEASE TYPE ONLY***
Solve the following:
Select all binary relation properties that apply to the following relation: Equal magnitude: |x| = lyl O antisymmetric O reflexive O symmetric O transitive
Give all the keys of R if the functional dependencies on R in each of the following cases
1.A known relationship mode of R (U, F), U= (A, B, C, D, E, G); F={AB->C, D->EG,C->A, BE->C, BC->D, CG->BD, ACD->B, CE->AG}; find the minimum cover of F,then use the Normal Form decomposition algorithm to decompose this mode to 3NF, andcheck if the decomposition has the nonadditive join property.
3,
Given the relation T below, use ordered pair notation to express the relation To T. ToT { Ex: (a, b), (b, c) b Lo a с } T
Given: Relation R = {(a,a), (a.b), (b,a). (b,b). (c,c)} and Set S = {a, b, c} Complete Relation R to be Transitive with Set S
c. For a schema R (A, B, C, D) bearing FDs F={A → B, B + c, C + D,D + A}, find if the decomposition of R into R1 (A, B, C) and R2 (B, c, D) is dependency preserving?
Detailed answer please
Let R be the relation on the set {a,b,c,d} containing the ordered pairs (a,a), (a,c), (b,b), (b,c), (b,d), (c,b), (c,c), (d,a) and (d,d). Find R².
Identify all the functional dependencies in the following relation with columns A, B, C, and D a.A→B b.A→C c.A→D d.B→A e.B→C f.B→D g.C→A h.C→B i.C→D j.D→A k.D→B l.D→C