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. O R is in 3NF but Not in BCNF.

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. O R is in 3NF but Not in BCNF.

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

Consider the relation R(O,P,X,Y,E, S); FDs={ O=P, XY=O, OE=S, EY=X, PY=X} What is the dependency preservation property for a decomposition? Why is it important? Decompose the relation into BCNF relation. What is the lossless (or nonadditive) join property of a decomposition? Why is it important? Determine whether each of the decompositions has the lossless join property with respect to F and conclude for the whole decomposition Determine whether each of the decompositions has the dependency preserving property with respect to FD and conclude for the whole decomposition
Define a relation on Z by aRb if and only if a divides b. Is R an equivalnce relation? Why or why not?
Let R(ABCDEFG) be a relation and F={A -> C, A-> D, B->F, E->F, F->G}a. Show example of lossless join decomposition of R into three tables R1, R2 and R3 and demonstrate that this decomposition is lossless using chase algorithmb. Find one key for this scheme and prove that it is a key using closure algorithm and definition of a key.
Consider the relation schema R(A, B, C, D, E, F) and the set S = {AB->C, BC->AD, D->E, C->B) of functional dependencies. Assuming that R is decomposed into the relation schemas R1(A,B), R2(B,C), R3(A,B,D,E) and R4(E,F). Use the Chase test to show if this is a lossless decomposition.
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
Consider the relation R(A, B, C, D, E), and the decomposition of R into R1(ABC) and R2(ADE).(a) Give a set of functional dependencies (FDs) such that the decomposition into R1 andR2 is lossless join and dependency preserving. Justify why your FDs satisfy the criteria.(b) Give a set of functional dependencies such that the decomposition into R1 and R2 islossless join, but not dependency preserving. Justify why your FDs satisfy the criteria.(c) Give a set of functional dependencies such that the decomposition into R1 and R2 isnot lossless join, but dependency preserving. Justify why your FDs satisfy the criteria.
1. A known relationship mode of R (U, F), U= (c, t, h, r, s, g, q); F={c->tq, cs->g, ht->r,hr->c, hs->r}; find the minimum cover of F, then use the Normal Form decompositionalgorithm to standardize this mode to 3NF, and check if the decomposition has thenonadditive join property.
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 following set F of functional dependencies on the relation schema(A, B, C, D, E, G):A → BCDBC → DEB → DD → A Give a 3NF decomposition of the given schema based on a canonical cover.
Consider the relation schema R (A, B, C, D, E, F, G, H) with the set of functional dependencies K = {A→B, B→DE, F→H, G→CE}. Determine all candidate keys of R in a systematic manner (do not use the Armstrong's Axioms) and explain how you determine them. Show each step.
Let T be the partial order relation on P({1,2,...,20}) defined by ATB if and only if |A| <|B| or A=B. Is T a total order relation? Note: You don't need to prove that S is an equivalence relation or that T is a partial order relation.
1.A known relationship mode of R (U, F), U= (A, B, C, D, E, G); F={AB->C, D->EG,C->A, BE->C, BC->D, CG->BD, ACD->B, CE->AG}; find the minimum cover of F,then use the Normal Form decomposition algorithm to decompose this mode to 3NF, andcheck if the decomposition has the nonadditive join property.