3. Consider the relation schema R = (A,B,C,D). For each of the following set of FDs, do the following: (a) identify the candidate keys for R. (b) state whether or not the proposed decomposition of R is lossless join and dependency preserving. Justify your answers. 1. B→C, A→D; decompose into (B,C) and (A,D). 2. AB→D, D→A, D→C; decompose into (A,C,D) and (B,D). 3. A→BC, C→AD; decompose into ABC and AD. 4. A→B, BC, C→D; decompose into AB and ACD. 5. A→B, BC, C→D; decompose into AB, AD and CD.

3. Consider the relation schema R = (A,B,C,D). For each of the following set of FDs, do the following: (a) identify the candidate keys for R. (b) state whether or not the proposed decomposition of R is lossless join and dependency preserving. Justify your answers. 1. B→C, A→D; decompose into (B,C) and (A,D). 2. AB→D, D→A, D→C; decompose into (A,C,D) and (B,D). 3. A→BC, C→AD; decompose into ABC and AD. 4. A→B, BC, C→D; decompose into AB and ACD. 5. A→B, BC, C→D; decompose into AB, AD and CD.

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

Let FD ={G → A, A → BC, C → FG, E → HG; be a set of functional dependencies. Calculate the projection of FD on {A, E, F}. Show your work.
Consider the following set F of functional dependencies on the relation schema(A, B, C, D, E, G):A → BCDBC → DEB → DD → A Prove (using Armstrong’s axioms) that AG is a superkey.
Suppose a relation schema R = (A, B, C, D) is decomposed into following relations R1(A,B,C) and R2(B,D). Consider relation R with FD's: {A →B, B →C, C→D}. Prove that this decomposition is lossless join decomposition.
Consider a schema R and a set F of functional dependencies as follows: R= (A,B,C,D,E,G). F = {A → BCD, BC DE,B→D,D→A}. Prove that AG is a superkey for R.
Consider a relation schema R = {A, B, C, D, E} and its functional dependency set F = {A → BC,CD → E,B →D,E → A}. Let R be decomposed into R1 and R2, where R1 = (A,B,C) and R2 = (A,D,E). Is the decompositionlossless? Is the decomposition dependency preserving? (a) The decomposition is lossless and dependency preserving.(b) The decomposition is neither lossless nor dependency preserving.(c) The decomposition is not lossless but dependency preserving.(d) The decomposition is lossless but not dependency preserving.
Normalization Here is a set of FDs for a relation R {A, B, C, D, E, F, G}; AB BC>DE AEF>G AC>DE a. Compute the closure of {A, C}, i.e. (A, C}* b. What are the candidate keys for R? Justify your answer. c. Is R in BCNF? Justify your answer. d. Give a 3NF decomposition of this relation.
Please give me correct solution.
Given 5 dimensional parameters A, B, C, D, E, F and the following set S of functional dependencies S= {B – A; C-→ B; F- E; B → F; F → D}. How many hierarchies you can build on S?
Let's suppose, a relation R=(A, B, C, D, E. H) with a set of functional dependencies F: (AE->BC, B ->AD, CD->E, E→CD, A->E) is given. Relation R (A, B, C, D, E, H) is decomposed into R1 (A, B, C, D) and R2 (A, B, E, H). Find out whether the decomposition is lossless or not, and whether it is dependency preserving or not.
Consider the relation R = {A, B, C, D, E, F, G, H, I,J} and the set of functional dependencies F = { {A, B} → {C}, {A} → {D, E}, {B} → {F}, {F} →{G, H}, {D} → {I, J} }. (b) Whether (A,B,F} is a super key? Whether {A,B,F} is a candidate key? Why? (c) Whether {A,D} is a super key? Whether {A,D} is a candidate key? Why?
not handwritten
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), (A)→{D, E), (B) (F). (F)-(G, H), [D) (I, J}}. %3D !3! Which of the following functional dependency violates 2NF? (Choose all that apply) O (A, B)->(C) O IAID, E) (B)-(F) O (F)>(G, H) O (D)(I, J)