Exercise 3.3.1: For each of the following relation schemas and sets of FD's:a) R(A, B, C, D) with FD's AB → C, CD, and D → A.b) R(A, B, C, D) with FD's B → C and B → D.c) R(A, B, C, D) with FD's AB → C, BC → D, CD →→ A, and AD → Bd) R(A, B, C, D) with FD's A → B, B →→ C', C → D, and D -; A.3.4. DECOMPOSITION: THE GOOD, BAD, AND UGLY93e) R(A, B, C, D, E) with FD's AB → C, DE → C, and B → D.f) R(A, B, C, D, E) with FD's AB → C, C → D, D → B, and D→ E.do the following:i) Indicate all the BCNF violations. Do not forget to consider FD's that arenot in the given set, but follow from them. However, it is not necessaryto give violations that have more than one attribute on the right side.ii) Decompose the relations, as necessary, into collections of relations thatare in BCNF.i

3.4. DECOMPOSITION: THE GOOD, BAD, AND UGLY e) R(A, B, C, D, E) with FD's AB → C, DE → C, and B → D. f) R(A, B, C, D, E) with FD's AB → C, C → D, D → B, and D → E. do the following: 93 i) Indicate all the BCNF violations. Do not forget to consider FD's that are not in the given set, but follow from them. However, it is not necessary to give violations that have more than one attribute on the right side. ii) Decompose the relations, as necessary, into collections of relations that are in BCNF.

3.4. DECOMPOSITION: THE GOOD, BAD, AND UGLY e) R(A, B, C, D, E) with FD's AB → C, DE → C, and B → D. f) R(A, B, C, D, E) with FD's AB → C, C → D, D → B, and D → E. do the following: 93 i) Indicate all the BCNF violations. Do not forget to consider FD's that are not in the given set, but follow from them. However, it is not necessary to give violations that have more than one attribute on the right side. ii) Decompose the relations, as necessary, into collections of relations that are 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(A,B ) with the following instance of r. Which of the functional dependencies do NOThold on this instance?(a) C → A(b) B → A(c) AB → C(d) A → C(e) B → C Instance of r is attached
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, G} and its functional dependency set F = {A → BCD,BC →DE,B → D,D → A}. Compute B+and choose the answer.(a) B+= AB(b) B+= ABC(c) B+= ABCD(d) B+= ABCDE(e) none of the above
1. What technique is used to model the situation that Student may have multiple addresses? A) Associative Entity (gerund)B) Weak entitiesC) Super/sub typesD) Recursive relationships 2.There is m:m relationship between students and classes. Which technique is used forrepresenting the student grade? A) Associative Entity (gerund)B) Weak entitiesC) Super/sub typesD) Recursive relationships 3. An associative Entity (gerund) may be used whenever there are data that depends on twoentities even when their relationship is 1:m. True or FalseA) TrueB) False 4. (check all that apply) When do you use recursive relationships?A) the relationship between employees and their supervisorsB) the relationship between employees and their dependentsC) the relationship between employees and their departmentsD) the relationship between employees and their team membersE) the relationship between employees and their job assignments 5. How is a gerund converted into a relational model?A) ignore the gerund in the…
Consider a relation schema R = {A, B, C, D, E} and its functional dependency set F = {A → B,CD → E,B →D,E → A}. Compute A+ and choose the answer.(a) A+ = AB(b) A+ = ABC(c) A+ = ABCD(d) A+= ABCDE(e) none of the above
The relation R defined on ℝ where aRb if and only if a< b is an equivalence relation. True or False
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 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 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.
Consider a relation schema R = {A, B, C, D, E} and its functional dependency set F = {A → B,CD → E,B →D,E → A}. Which ones of the following are not candidate keys for R? (a) A(b) BC(c) CD(d) D(e) E
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 (AB)+ ?
Consider a schema R, a set F of functional dependencies on R, and two candidate keys (k1, k2) as follows:R = (X,Y,Z).F = {Y → Z,XZ → Y}.k1 = XZ.k2 =XY Is R in BCNF? Is R in 3NF?(a) R is in both BCNF and 3NF(b) R is in BCNF but not in 3NF(c) R is not in BCNF but in 3NF(d) R is in neither BCNF not 3NF