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.

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.

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

Related questions

Q: Let R(ABCDEFG) be a relation and F={A -> C, A-> D, B->F, E->F, F->G} a. Show example of lossless…

A: According to the information given:- We have R(ABCDEFG) F={A -> C, A-> D, B->F, E->F,…

Q: Suppose ρ is the relation defined on P({1, 2, 3}) in which, for A, B ∈ P({1, 2, 3}), AρB means "A…

A: Given: P({1, 2, 3}) A, B ∈ P({1, 2, 3}) AρB means "A and B both have exactly 2 elements." ρ is…

Q: Consider a relation R (A, B, C, D, E, G, H, I, J) and its FD set F = {EC -> B, C->D, ->BH, H->ACD,…

A: 1) Closure (IJ) ={I,J, E, G, H, A, B, C, D} Closure (EJ)={E, G, H, I, B, A, C, D, J} Thus here key…

Q: 3. Given a relation R( A, B, C, D) where FDs ans CKs are such : FDs AB -> C, BC -> D, CD -> A CKs АB…

A: Here in this question we have given a relation R and we have asked to check highest normal form in…

Q: Let R(A,B,C,D) be a relation with the set of functional dependencies F={AB->C,C->D). Decompose the…

A: Answer is

Q: Consider the relation R defined on the set Z x Z: R = {((a,b),(c,d)) | a = c (mod 4) a b = d (mod…

A: given that

Q: Given a set A = {1, 2, 3, 4}, which of the following relations is a partial order relation and which…

A: In this question we have been given some relations and we need to determine which relations are…

Q: Consider the set of F of the following functional dependencies on relation R(A, B, C, D, E): AB C…

Q: Consider the relation R = {A, B, C, D, E, F, G, H, I,J} and the set of functional dependencies F = {…

A: f ={ AB → C, A → D, B → F, F → GH, D → IJ } To find the key check the RHS of the…

Q: Let R be a relation on A = {0, 2, 7, 8} and R = {(7, 2), (8, 8), (8,0), (2, 7), (2, 2), (7,0)}. Are…

A: The given relation R is defined on the set A = {0, 2, 7, 8}, and R = {(7, 2), (8, 8), (8, 0), (2,…

Q: Consider the relation R(S, N, R, C, J, H, L) and its set of dependencies F = {S, N -> C ; J, H, C ->…

A: using Armstrong's axioms=> proved in figure figure 1:

Q: Given: Relation R = {(a,c), (b,c), (c,c)} and Set S = {a, b, c} %3D Complete Relation R to be…

A: Given: To make the relation R symmetric.

Q: (4) Let T be the partial order relation on P({1,2,...,20}) defined by ATB if and only if |A| < |B|…

A: It is defined as sometimes also called simple, connex, or full orders. A set equipped with a total…

Q: Let R(A, B, C, D, E, F) be a relation with FD's: {D→ CE, C-→ BDE, E→ AD, AF→ E, B→ D}. Which of the…

A: The given functional dependency is, { D -> CE , C -> BDE , E -> AD , AF -> E , B -> D…

Q: SIf a decomposition of a relation R into R¡ and R2 is lossless, then which of the followings are…

A: If a decomposition of a relation “R” into “R1”, and “R2” is lossless then it produces “R” by…

Q: Define a relation as follows: ARA = {(a, b) , (a, c), (b, c)} Select the properties that the…

A: Answer to the above question is in step2.

Q: Decompose R into a set of 3NF relations, that is lossless join and dependency preserving.

A: Here we decompose it in 3nf and check dependency preserving.…

Q: Now start with these functional dependencies: АВ > Е C → D F → GH FG → GH В > FG Find a minimal…

A: A) AB ->E, C->D, F->GH, FG->GH, B->FG Here in FD FG->H, we can delete G from RHs…

Q: Consider a relation T on Z where T = (1,1)}. Is T reflexive? Is T symmetric? Is T transitive?…

A: Given a relation T on Z T={(1,1)} T is not reflexive because Z is integer and has many element so…

Q: Indicate the properties of each of the following relations. For each relation, indicate whether it…

A: here are the properties of each relation:R is reflexive, symmetric, and transitive.R is…

Q: ind a minimal covering of these functional dependencies. Then use it to synthesize a set of…

Q: Consider F = {BC -> D, B -> E, CE -> D, E -> CA, BF -> G} and R(A,B,C,D,E,F,G) 5. Find a 3NF…

A: The given Functional depenency are : F = {BC -> D, B -> E, CE -> D, E -> CA, BF ->…

Q: Let R be a relation on A = (0, 1,7,9). If (7,9) ER, what must NOT be an element of R for R to be…

A: Let R be a relation on A = {0, 1,7,9). If (7,9) ER, what must NOT be an element of R for R to be…

Q: Suppose that R is the following relation on the set A = {1,2,3,4}: R = A × A – {(1, 1), (2, 2), (3,…

A: The Cartesian product is a mathematical operation that takes two sets and creates a new set…

Q: Write the relation matrix for the relation R on the set (a,b.c.d,e.f) which is defined as follows:…

A: Relation Matrix: Any relation can be represent using the matrix representation. The matrix contain…

Q: Consider the following set F of functional dependencies on the relation schema R = (A, B, C, D, E,…

A: a) Candidate Key : Minimal set of attributes used to differentiate every record of the table is…

Q: Suppose a relation schema R = (A, B, C, D) is decomposed into following relations R1(A,B,C) and…

A: A relation schema R is decomposed into R1 and R2

Q: Could you tell a step by step procedure of finding a super key for A relation R(A,B,C,D, E) having…

A: Solution - In the given question, we have to find the super key of the given relation R(A,B,C,D,E).…

Q: Oa.2

A: Here as we can see all vertices have self loop. Thus the relation is = . Also as we can see there…

Q: The reflexive and transitive closure of the relation A = {(0,1),(1,2)} on B = {0,1,2} is…

A: Here in this question we have given a relation on some set B. and we have asked to find the…

Q: Consider the relation R(S, N, R, C, J, H, L) and its set of dependencies. F = {S, N -> C ; J, H, C…

Q: Suppose you are given a relation R = (A,B,C,D,E) with the following functional dependencies: {CE ->…

A: Solution: Given, Relational Schema- R{A, B, C, D, E} List of functional Dependencies are- CE…

Q: Consider the relation R = {A, B, C, D, E, F, G, H, I,J} and the set of functional dependencies F = {…

Q: Let S = {1,2,3}. Let be the relation on S x S defined by (a, b) ≤ (c,d) a ≤ c and b>d (a) Show that…

Q: Define a relation R on Z×Z by (m,n)R(s,t) if and only if m-n = s-t. Is R reflexive? symmetric?…

A: In the given case, we prove all three one by one.

Q: Let A = {a, b, c} Define a relation as follows: ARA = {(a, b), (a, c), (b, c)} To obtain the…

A: Symmetric closure of the set A={a,b,c}

Question

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.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

pen paper answer
a
CAN U HELP ME IN THIS ONE?
-------If R is reflexive, symmetric and transitive then the relation is said to be Floor(2.4) + Ceil(2.9) is equal to Let f and g be the function from the set of integers to itself, defined by f(x) = 2x + ---- 1 and g(x) = x ^2. The composition of fog (-2) is The power set of (a} is -----
Please answer asap and type your answer
3. Suppose you are given a relation R(PQRSM)and the F, the set of functional dependencies that hold for R: F = (PQ>R, PQ →S,R>P, S>Q}. i. Identify all the candidate keys of R ii. Apply dependency- preserving, lossless 3NF decomposition algorithm on Riii. Are resultant relations in BCNF? Justify.
2.Consider relation R=(A,B,C,D) with the following FDs: B → C, C > D, and D A a. List all candidate keys of R. b. Is R in 3NF? BCNF? Justify your answer
21. 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 functional dependencies: C→ E, EG→ D, DG-→A, and A→ BF. If we decompose R into relations R1(C, D, G), R2(A, D, G), R3(A, B, F), and R4(C, E), which of the following statements is TRUE? Select one: O The decomposition is in BCNF but Not in 3NF. The decomposition is in 3NF and in BCNF. The decomposition is in 3NF but Not in BCNF. O The decomposition is Not in 3NF and Not in BCNF.
Implement in Python / Java Algorithm: Testing for lossless (nonadditive) join property. Input: A universal relation R, a decomposition D = { R1, R2, R3, ….. Rm } of R, and a set F of functional dependencies. 1. Create an initial matrix S with one row i for each relation in Ri in D, and one column j for each attribute Aj in R. 2. Set S(i, j) := bij for all matrix entries. (* each bij is a distinct symbol associated with indices (i, j) * ) {for each column j representing attribute Aj {if (relation Ri includes attribute Aj ) then set S(I, j):=aj;};}; (* each aj is a distinct symbol associated with index (j) *) 3. For each row i representing relation schema Ri {for each functional dependency X → Y in F {for all rows in S which have the same symbols in the columns corresponding to attributes in X {make the symbols in each column that correspond to an attribute in Y be…
Consider the relation R on Z? given by: R = {((a, b), (c, d)) : a +d = c+b} Prove that R is an equivalence relation, and determine 3 elements of [(1,3)], the equivalence class of (1, 3).
Let R be the relation on the set {a,b,c,d} containing the ordered pairs (a,a), (a,c), (b,b), (b,c), (b,d), (c,b), (c,c), (d,a) and (d,d). Find R².
solve: