For the following relation schema and set of FD's
R(A,B,C,D) with FD's AB->C, B->D, CD->A, AD->B
Indicate the BCNF violations, and decompose the relations into relations that are in BCNF.
For the following relation schema and set of FD's R(A,B,C,D) with FD's AB->C, B->D, CD->...
Given the following relation schemas and the sets of FD's: a- R(A,B,C,D) F={ABẠC,C7D, D´A, BC+C} b- R(A,B,C,D) F={BẠC, BD, AD>B} C- R(A,B,C,D) F={AB-C, DC+D, CD+A, AD+B} d- R(A,B,C,D) F={AB=C, C+D, D™B, DE} e- R(A, B, C, D, E) F= {AB+C, DB+E, AE>B, CD+A, ECD} In each case, (i) Give all candidate keys (ii) Indicate the BCNF violation Give the minimal cover and decompose R into a collection of relations that are BCNF. Is it lossless? Does it preserve the dependencies?...
Consider a relation R with five attributes A, B, C, D, and E. You are given the following functional dependencies: A → B, BC→E, and ED→A. (a) Is R in BCNF? If it is not, decompose it into a collection of BCNF relations. 2: BCNF and 3NF (3 points) Consider the relation schema R with attributes A, B, C, and D and the following functional dependencies: AB→C, AC→B, B→D, BC→A. (a) Is R in BCNF? If it is not, decompose...
4. (40 points) Identify the following relations that are in Third normal form (3NF)? If it is in 3NF, is it in BCNF? You must explain your answer to receive points. Also, for each question, pick one FD not in BCNF and decompose R into tables if it is not in BCNF. (2) R(ABCD) FD's: AB-»C; ABD->C; ABC-> D; AC-ID (4) R(ABCD) FD's: C- B;A->B; CD -»A; BCD (5) R(ABCD) FD's: AD C;D-A;A-C;ABC A D,
4. (40 points) Identify the...
4. (40 points) Identify the following relations that are in Third normal form (3NF)? If it is in 3NF, is it in BCNF? You must explain your answer to receive points. Also, for each question, pick one FD not in BCNF and decompose R into tables if it is not in BCNF (1) R(ABCD) FD's: ACD B;AC D D C;ACB (2) R(ABCD) FD's: AB C; ABD C;ABC D;ACD (3) R(ABCD) FD's: AB; B A;A D D B (4) R(ABCD) FD's:...
Consider a relation schema R with attributes ABCDEFGH with functional dependencies S: S={B→CD, BF→H, C→AG, CEH→F, CH→B} Employ the BCNF decomposition algorithm to obtain a lossless decomposition of R into a collection of relations that are in BCNF. Make sure it is clear which relations are in the final decomposition and project the dependencies onto each relation in that final decomposition.
Principles of Information and Data Management problem:
3. Given the following schema of a relation R(A,B,C,D,E) with the following functional depen- dencies: AB → C, C → D, D → B. D → E. and the following data: l B | C | D | E 112 3 2 1 23 1 2 13 5 25 22 3 1 | 2 237 25 3 11 3 2 3 2 4| 2 3 |352 5 (a) Decompose R into tables in...
For the relation R(A,B,C,D,E) with the following FDs: A → B, C → D, AB → C, BC → A 1. List all non-trivial FDs following from the above. (2 marks) 2. Generate all possible keys for R. (2 marks) 3. Check whether R is in BCNF. If it is in BCNF, explain the criteria you used. If it is not in BCNF, convert it into BCNF, showing the new relations and their FDs. (5 marks)
For the following relations and set of FDs: 1. give a key for the relation; 2. state whether the relation is in BCNF, and if it is not state why: 3. give a set of relations in 3NF equivalent to the original relation 1. (33 points) What is the closure of (A,B) with respect to R(A,B,C,D,E,F,G)if R has the following functional dependencies? (a) GCDE AF BF - ABC FC G (b) D-AC-D A+B ABC 2 33 points for each of...
Consider relation R(A,B,C,D) with functional dependencies: B → C D→ A BA → D CD → B Decompose R into Boyce-Codd Normal Form (BCNF). Clearly show all intermediary steps.
Let R(A,B,C,D,E) be a relation with FDs F = {AB-C, CD-E, E–B} (2 Points) Select one: O Ris in 3NF but not in BCNF. O Ris not in 3NF but in BCNF. O Ris in 3NF and in BCNF. R is not in 3NF and not in BCNF.