Let R(A,B,C,D,E,F,G) be a relation with FDs F = {C→ EF, EG→ D, DG→ A, A→ B} that hold on R. Which of the following is a 3NF decomposition of R that is lossless and dependency preserving? Select one: O R1(A, B, D, G), R2(D, E, G) and R3(C, E, F) None of the four decompositions. O R1(A, D, E, G), R2(A, B, C, E, F) O R1(D, E, G), R2(A, D, G), R3(A, B) and R4(C, E, F) All of the four decompositions. O R1(A, D, E, G), R2(A, B) and R3(C, E, F)

Let R(A,B,C,D,E,F,G) be a relation with FDs F = {C→ EF, EG→ D, DG→ A, A→ B} that hold on R. Which of the following is a 3NF decomposition of R that is lossless and dependency preserving? Select one: O R1(A, B, D, G), R2(D, E, G) and R3(C, E, F) None of the four decompositions. O R1(A, D, E, G), R2(A, B, C, E, F) O R1(D, E, G), R2(A, D, G), R3(A, B) and R4(C, E, F) All of the four decompositions. O R1(A, D, E, G), R2(A, B) and R3(C, E, F)

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'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 schema R(A, B, C, D, E, F) with the following set of functional dependencies FDs F = {ABC → E, DE → A, ACE → D, BC → A, BD → E}. Is the decomposition of R into R into R1(A, B, C, E), R2(B, C, D) and R3(B, D, F) a lossless decomposition? (Explain)
The relation R(A, B, C, D, E) has the following functional dependencies. А, В -> С В, С — D C, D→E D, E → A (a) What are all of the keys of R? (b) Find a lossless-join decomposition of R into BCNF relations. (c) Find a lossless-join decomposition of R into 3NF relations.
Given the relation R (A, B, C, D, E) and the following set of functional dependencies: F = {ABC, A➜E, B➜D, C⇒B} a. Specify the key of R. b. Is R in the 3NF? If not give a decomposition of R that is in the 3NF. c. Explain why this decomposition is not in BCNF. d. Give a decomposition of R that is in BCNF.
Consider the relation R = {F, T, D, N, S} and the set of functional dependencies K = {F¬D, {D, T} --F, (F, N)→S}. What is the key for R? Select one: O a. {T, N} O b. (F, D} Oc {F, T, N} Od (F, T}
Consider a relation schema R(A,B,C,D,E,H,G) F = {A->BC, B->C, C->BED, BD-> E, E->D, AG->E, G->H, AH->G} 3NF decomposition of r
Given: Relation R = {(a,c), (b,c), (c,c)} and Set S = {a, b, c} Complete Relation R to be Symmetric with Set S. For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac). BIUS Paragraph Arial 10pt 三=== EE x² X, T Te ABC 土田E 図 (0) O@
Consider the relation schema R=VWXYZ, with the set of functional dependencies F = {VW->XY, V->X, W->Z, YZ→Z, Z->V} А. Give three independent reasons why the following table cannot possibly be a legal instance of R. V W Z yl x2 X Y v1 w1 х1 z1 _y2 x1 v2 w1 z1 v2 w2 y2 z2
3. Given a relation R( A, B, C, D) where FDs ans CKs are such : FDs CKs AB -> C, BC -> D, CD -> A АB and BC А -> ВCD, C ->A A,C А->вс, С->BD, В->А No Clue Check the Highest Normal Form.
Consider the relation schema R=VWXYZ, with the set of functional dependencies F = {VW->XY, V>X, W->Z, YZ->Z, Z→V} A. Give three independent reasons why the following table cannot possibly be a legal instance of R. V W X Y v1 w1 х1 yl z1 v2 w1 x2 y2 z1 v2 w2 x1 y2 z2 B. Show the functional dependencies that hold on each of R1=VWX and R2=WYZ. You do not need to show trivial functional dependencies, or those implied by others in the same set, but you must show all others. C. Is the decomposition of R into R1=VWX and R2=WYZ lossless-join? Why or why not?
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
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?