DB_Design:GA7.5. 3NF Decomposition 2 Consider the functional dependencies on R(A,B,C,D,E,F): A->D;AB->C;AC->B;B->E;C->F Decompose the above relation into 3NF. All relations with the same LHS of the minimal FD should be grouped in one relation. e.g. A->B;A->C, ==> A->BC Give your relations an arbitrary and UNIQUE one-character name. e.g. A->B; B-C on relation S(A,B,C) decomposes into: V(A,B);P(B,C) Relations:

DB_Design:GA7.5. 3NF Decomposition 2 Consider the functional dependencies on R(A,B,C,D,E,F): A->D;AB->C;AC->B;B->E;C->F Decompose the above relation into 3NF. All relations with the same LHS of the minimal FD should be grouped in one relation. e.g. A->B;A->C, ==> A->BC Give your relations an arbitrary and UNIQUE one-character name. e.g. A->B; B-C on relation S(A,B,C) decomposes into: V(A,B);P(B,C) Relations:

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

Database Management A relation R is given which is R(A,B,C,D,E,F). It has the following functional dependencies: AB -> CDE, B -> F. Answer the following based on this information. Is it in 3NF? If not, decompose it until 3NF.
Suppose we have a relation schema R(A, B, C) with FD A → B. Suppose also that we decide to decompose this schema into S(A, B) and T(B, C). Give an example of an instance of relation R whose projection onto S and T and subsequent rejoining does not yield the same relation instance.
DATABASE SYSTEM A relation R is given which is R(A,B,C,D,E). It has the following functional dependencies: BC -> D, AC -> BE, B->E . Answer the following based on this information. What is the candidate key of this relation? Is it in 2NF? Explain why or why not.
J 1 Let R(A, B, C, D, E, F) be a relation schema, and let S = {A → B, BC → D, E → C, D →A, B → D} be a set of functional dependencies. Use the Nonadditive Join Test for Binary Decomposition to determine if the following decomposition is lossless.
Consider the universal relation R = {A, B, C, D, E, F, G, H, I, J} and the set of functional dependencies F = {{A, B} -> {C}, {B, D} -> {E, F}, {A, D} -> {G, H}, {A} -> {I}, {H} -> {J}}. What is the key for R? Decompose R into 2NF, then 3NF relations.
Consider the following relation T: T(A, C, F, G, K, L) Key of relation T is AF Suppose the following FDs exist ={ A-> F, G-> KL, K->L} į. Is the above relation (T) in 3NF? If not, decompose it into 3NF relations?
Consider the relation R with the following functional dependencies: R(P,Q,R,D,E,F) FD = {P →Q,QR → D,E → R, D → P} Which of the following are the candidate keys? (a) PF, QF. (b) PF, QF, RF (c) PEF, QEF, DEF (d) PEF, QFR
Consider the following relation with set of functional dependenciesR(ABCDEF)AB->CD, CD->EF, BC->DEF, D->B, CE->Fa) Identify the candidate keys in the above relation (with proper steps followed).b) Identify which normal form this relation is in and reason for the answer.
Consider the relation R (A, B. C, D) with the functional dependencies (A)->[B] and (C)->{D). Which is a candidate key: O IA, C) O IA DI O IAI
1. Consider a relation schema R1(A, B, C, D) that satisfies the set of functional dependencies F1 ={A→B, B→C, C→A}.a) Calculate A + and (AC)+b) Can AB→ C? Justify your answer.c) Find all the candidate keys of R1 using F1 and show your steps to find them. 2. Consider a relation schema R2(A, B, C, D) that satisfies the set of functional dependencies F2 = {A→B, C→D, D→AC}.a) Is (AD) is candidate key of R2? Justify your answer.b) Is R2 in BCNF? Explain the reason to your answer.c) If R2 is not in BCNF, give a lossless-join BCNF decomposition of R2. Is this decomposition dependency preserving? 3. Consider a relation schema R3(A, B, C, D, E) that satisfies the set of functional dependencies F3 = {A → BC, AC → BD}.a) Calculate (AC)+ and (AE)+b) Is AB → C in F3 +? Justify your answer.c) Find the canonical cover Fc of F3.d) Is R3 in 3NF? Explain the reason to your answer. If R3 is not in 3NF, give a lossless-join, dependency preserving 3NF decomposition of R3.