Consider the following relation R with attributes A, B, C, D, and E: R(A, B, C, D, E) Given the following set of functional dependencies: A → B CD → E E-C If the relation is not in 3NF, decompose it to ensure that resulting relations are in 3NF. Provide the rationale for your decomposition.

Consider the following relation R with attributes A, B, C, D, and E: R(A, B, C, D, E) Given the following set of functional dependencies: A → B CD → E E-C If the relation is not in 3NF, decompose it to ensure that resulting relations are in 3NF. Provide the rationale for your decomposition.

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

Given R (A, B, C, D, E) and the following set of functional dependencies: F = {A>E, D→B, E C, AC D, CD→A} give the minimal cover of R • All candidate keys • The highest normal form
Consider the following functional dependencies that hold on R(ABCDEF): AB-> CD, E -> C, B -> EF Is R in 3NF? Explain your answer in detail and decompose the relation, as necessary, into a collection of relations that are in 3NF. Make sure you first find all the key(s) of R so that you will be able to tell whether an attribute is prime.
5 of 40 A decomposition is in 3NF if every decomposed relation is in 3NF. A decomposition is in BCNF if every decomposed relation is in BCNF. Let R(A,B,C,D,E,F,G) be a relation with the FDs: F = {CD → G, DG → C, AD→ G, G –→A, AB → F}. Consider the decomposition of R into R1(C, D, G), R2(A, D, G), R3(A, B, F) and R4(C, E). Which of the following statements is TRUE about this decomposition? Select one: O Ris in BCNF but Not in 3NF. Ris in 3NF but Not in BCNF. R is Not in 3NF and Not in BCNF. O R is in 3NF and in BCNF.
Consider a relation schema R = (X, Y, Z) on which the following functionaldependencies hold: { XY → Z, Z → X }. Show that the schema R is not in BCNF(Boyce-Codd Normal Form) but it is in 3NF (Third Normal Form). Answer in detail
All parts of this question use the relation R = (ABCDEG) with the set of functional dependencies F = {A→BC, AD→G, C→D, G→C, BC→BDEG}. Use 3NF synthesis to find a 3NF decomposition of R that is both lossless-join and dependency-preserving. You must show all FDs that hold on each resulting relation. As a final step, minimize the number of relations in your decomposition, while still ensuring that each relation is in 3NF. 2.Give an example of a query that would run more slowly in your decomposition from above than in the original relation R. You must explain your answer.
Give a BCNF decomposition to relation "r" according to the given functional dependencies. Show the steps of normalization clearly to get full credit. r(U, V, W, X, Y, Z) Z-> XY X -> VW V-> U XY -> Y
You are given a relation R with the following attributes R(A,B,C,D,E). Assume that you were given the following functional dependencies: • FD1= AB -> E • FD2: = D -> C (a) What is a valid key for this relation? justify your response. (b) Is this relation in 3NF (Third Normal Form)? Justify your response. If it is not in 3NF, normalize the relation and demonstrate all steps of normalization.
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.