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: 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: Find a minimal cover for the relation R(A, B, C, D. E, F) with the set K = {A→D, AC DE, B-F, D→CE}…

A: A minimal cover of a set of FDs is a minimal set of functional dependencies that is equivalent to F.…

Q: ;; "relate" accepts a positive integer x and relation R and returns { y | (x y) €R }. ;; Type…

A: Helper Function : An helper function is a capacity that performs part of the calculation of another…

Q: n with attributes A1, A2, ..., An. As a function of n, tell how many superkeys R has, if The only…

A: Introduction A super key is an attribute (or combination of attributes) that is used to identify…

Q: Consider the issue of interesting orders in optimization. Suppose you are given a query that…

A: The interesting order is every order on the subsets of the attributes which can potentially take…

Q: List all the ordered pairs in the relation R = {(a, b) | a divides b} on the set {1, 2, 3, 4, 5, 6,…

A: Suppose you have a pair of two numbers. You have to find the pairs were a%b = 0 For the given sets,…

Q: The relation R(A, B, C, D, E) has the following functional dependencies. А, В - С В, С -> D C, D→E…

A: Attached Solution for (a) and (b) part:

Q: Consider the relations r1(A, B, C), r2(C, D, E), and r3(E, F), with primary keysA, C, and E,…

A: Consider the relations r1(A, B, C), r2(C, D, E), and r3(E, F), with primary keysA, C, and E,…

Q: Given the relation R on the set of all integers defined by the rule (x, y) and only if x 2 y². a) i.…

A: In questions with many parts, we must answer the first one.

Q: Suppose we have the following relation schema R and set of functional dependencies F: R = (A, B, C,…

A: Here in this question we have a relation R (A B C D E F G) and some FDs also given there.and we have…

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: For example, let A = {1, 2, 3} then Cartesian product A × A = {(1,1), (1,2), (1,3), (2,1), (2,2),…

A: Brief explanation about Reflexive, Symmetric and Transitive is presented here:-

Q: Consider the relation R(A, B, C, D, E), and the decomposition of R into R1(ABC) and R2(ADE). (a)…

Q: A relation, R, on non-empty set A is defined as a subset of A × A: R ⊆ A × A For example, let A…

A: Binary Relation definition A binary relation R from set A to set B is a subset of the Cartesian…

Q: Question 3. Suppose we have a relation R = (A, B,C, D, E , F) with a set of function ependencies F =…

A: A -> DE AC -> B B -> D Closure (AC) =(A, C, B, D, E) Since AC determines all the attribute…

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: Given the relation R (A, B, C, D, E) and the following set of functional dependencies: F = {ABC,…

Q: List the ordered pairs in the relation R from A = 0,1, 2, 3, 4, B = 1, 2, 3, 4, 5, where Ris defined…

A: answer to the question is in step2 where a=2b.

Q: Consider the relation schema R(A, B, C, D, E, F) with the following set of tional dependencies FDs F…

A: We are given a relation schema and it is decomposed into several schemas. We are going to find out…

Q: Consider the relation schema R(A, B, C, D, E, F) and the set S = {AB->C, BC->AD, D->E, C->B) of…

A: ANSWER:-

Q: Consider a schema R and a set F of functional dependencies as follows: R= (A,B,C,D,E,G). F = {A →…

A: First of all , let’s understand what is super key. Super key : Super key can be defined as an…

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: let F, be a canonical cover for F, i:= 0; for each functional dependency a → ß in F. i:=i+ 1; R, :=…

A: Answer :

Q: Consider a relation (p, q, r, s, t, u, v) with functional dependencies as given below: p➜q r➜s,t…

A: Given : A relation (p, q, r, s, t, u, v) with functional dependencies as given below:p ⇒ qr ⇒ s, ts…

Q: Let's suppose, a relation R=(A, B, C, D, E. H) with a set of functional dependencies F: (AE->BC, B…

A: Functional dependency is a DBMS concept . In this attributes of relations are dependent on each…

Q: What is the degree of the recurrence relation an-2 + 2an-7 – 2an-4 = 0-? (1) 2 (2) 9 (3) 7 (4) 5 (A)…

A: We are given the following recurrence relation : an-2 + 2an-7 + 2an-4 = 0 We have to find the…

Q: Consider thne universal relation R (AB. E F, G, H, I. JJ and the set of functional dependencies F =…

A: A functional dependency x->y is said to be partial functional dependency if X is part of key or…

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

A: Relation R which is defined functional dependencies

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

Q: Consider the following B+-tree index built for a relation instance using the id as the set of ey…

A: this Question is a Non Leaf Node. before 3 4 5 6 10 17 18 29 after insert 1 3 4 5 6 10 17 18 22…

Q: Given relation: R = ABCDEFG F = { AB -> C, C->A, BC->D, ACD->B, D->EG, BE->C, CG->BD, CE->A,…

Q: You are given a binary relation R (defined below) on A. Each tuple (a, b) indicates that a is…

A: Hey there, I am writing the required solution based on the above given question. Please do find the…

Q: find the no. of F-D'S 2-attributes? in F-closure (F+) for a relation with

A: No of f.d's in fcloser(f+) for a relation: given we have find it for 2 attributes so take…

Q: 3. Suppose you are given a relation R(PQRSM)and the F, the set of functional dependencies that hold…

A: R(P, Q, R, S, M) PQ -> R PQ -> S R -> P S->Q (PQ) + ={PQRS} (RS) + ={RSPQ} Therefore…

Q: Let R1, R2,…, Rn be a decomposition of schema U. Let u(U) be a relation, andlet ri = ΠRI(u). Show…

A: Given, R1, R2,…, Rn be a decomposition of schema U u(U) is a relation ri = ΠRI

Q: Give a set of FDs for the relation R (ABCD) with AB as primary key under which condition R is in 2NF…

A: Solution : Given schema R (ABCD) with AB as primary key If R has to be in 2NF, but not in 3NF then…

Q: Given set A={1,2,3,4,5} and let R and S be a binary relation on set A. R = {(a, b) e AxA | b|a} and…

Q: A decomposition is in 3NF if every decomposed relation is in 3NF. A decomposition is in BCNF if…

A: ANSWER IS C R is not IN 3NF and not in BCNF

Q: Consider the functional dependency of relation R (A, B, C,D) F = {A→BC, B→C, A→B, AB→D} Compute…

A: Closure Set of F+ is: A→A, A→B,A→C, B→B, B→C,C→C, D→D, AB→A, AB→B, AB→C, AC→A, AC→B, AC→C,…

Q: Q8. Consider a relation schema R (A, B, C, D, E, H), with FDs F = {A→BC, B→CE, A→E, AC→H, D→B}. a.…

A: Given relation schema is R (A, B, C, D, E, H} The functional dependencies present in the table are:…

Q: Consider a relation R(A,B,C,D,E) with functional dependencies AB→C, A→D, and D→E. (a) What are…

A: In given question, we have asked the key for given Relation R and closue of A and closure of AC. Key…

Q: Suppose you are given a relation r(a, b, c).a. Give an example of a situation under which the…

A: Given: Suppose you are given a relation r(a, b, c).a. Give an example of a situation under which the…

Q: All parts of this question use the relation R = (ABCDEG) with the set of functional dependencies F…

A: 1) The given relation is : R = (ABCDEG) The given set of functional dependencies F is : A→BC AD→G…

Q: Consider the relation R(O,P,X,Y,E, S); FDs={ O->P, XY->O, OE->S, EY->X, PY->X} What is the lossless…

A: We have given relation as: R(O,P,X,Y,E,S) This shows that there are 6 attribute of relation R as: O,…

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

A: Introduction Consider the following set F of functional dependencies on the relation schema (A, B,…

Q: Q1Greetings, thatnk you in advance for your response. - Give a decomposition into 3NF of the…

A: The Relation R( A,B,C,D,E ) can be decomposed as follows to 3nf: Functional dependencies, F : [ AB…

Q: For each relation F, indicate if it is: reflexive, anti-reflexive, or neither; symmetric, anti-…

A: b. For x,y ∈R,xFy if x≥y Reflexive if (x,x)∈R for every x∈F It is reflexive, Since x belongs to R…

Q: 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,…

A: The given part from the question that is the relation R(U, F) which is defined as follows:- U = {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

Consider a relation R(A, B, C, D, E, F), with FDs AB → C , BC → D, D → E, BE → F and DF → C.1. Is R in BCNF? Explain why or why not.2. Find the closure of the following:1. (A, B)2. (B, D)3. (D, F)3. List one superkey of R that is not a (minimal) 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 with schema R(A,B,C,D,E,G) and functional dependencies (FDs) C→D; B→A; D→E; E→G ) What is the closure of {B,C}? Show steps of your solution. Find 2 nontrivial FDs that can be inferred from the given FDs set. Explain how you found them. Propose one key for a given schema and FDs. Explain how you found it.
Suppose R is a relation with attributes A1, A2, ..., An. As a function of n, tell how many superkeys R has, if The only keys are A1 and A2?
Given set A={1,2,3,4,5} and let R and S be a binary relation on set A. ? = {(?, ?) ? ??? | ?|? } ??? ? = {(2,1), (2,3), (3,4), (3,5), (4,5)} a.) Evaluate the Domain and Range of SoR. b.) Evaluate (???) −1 ??? ??? ̅̅̅̅̅.
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
Given a set A = {1, 2, 3, 4}, which of the following relations is a partial order relation andwhich is not? Justify your answer(a) { (1, 2), (2, 3), (1, 3), (4, 3) }(b) { (1, 2), (2, 3), (1, 3), (3, 4), (1, 1), (2, 2), (3, 3), (4, 4) }(c) { (1, 2), (2, 3), (1, 3), (4, 3), (1, 1), (2, 2), (3, 3), (4, 4) }
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 a relation R(A,B,C,D,E) with functional dependencies AB→C, A→D, and D→E. (a) What are the keys for R?(b)What is the closure A, that is A+ ? What is the closure AB, that is (AC)+ ?
Consider the relation R(A, B, C, D, E) and the set F = {AB → CE, E → AB, C → D}. What is the highest normal form of this relation? Explain your answer.
Consider a relation schema R(A, B, C, D, E, G) and a set of functional dependencies F = {A → C, AD → CE, B → ACD, C → B}. (a) Show the steps of computing a canonical cover for F. (b) Compute the closure of AG and then determine whether or not AG is a candidate key. (c) Determine whether or not (A, E, G) is in BCNF and justify your answer using the transitive closure of a set of attributes. If (A, E, G) is not in BCNF, find a BCNF decomposition of it. (d) Assume that (A, E, G) is decomposed into (A, G) and (E, G). Given the above functional dependencies, is this decomposition always lossless? If so, prove this. Otherwise, explain it using an example (i.e., a case of decomposing a table containg rows and columns into two tables). (e) Assume that R is decomposed into R1(A, B, C, D) and R2(A, E, G). Is this decomposition dependency preserving? Justify your answer.
Consider the issue of interesting orders in optimization. Suppose you are given a query that computes the natural join of a set of relations S. Given a subset S1 of S, what are the interesting orders of S1?