4. Decomposition- BCNF. Consider relation R=(ABCDEFG), F={AB>CD, CDE→AB, AG>BD, BDG>EF} (a) Is it in BCNF? Provide a good justification – must use textbook definition and reasons given must be specific. (b) Apply the BCNF decomposition algorithm to decompose R into a set of BCNF tables. If this cannot be done, explain why.

4. Decomposition- BCNF. Consider relation R=(ABCDEFG), F={AB>CD, CDE→AB, AG>BD, BDG>EF} (a) Is it in BCNF? Provide a good justification – must use textbook definition and reasons given must be specific. (b) Apply the BCNF decomposition algorithm to decompose R into a set of BCNF tables. If this cannot be done, explain why.

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

Compute a canonical cover Fc of F = { A → E, BC → D, C → A, AB → D, D → G, BC → E, D → E, BC → A }, given a relation-schema R(A, B, C, D, E, G). If you can, please include the steps you use to reach with what Armstrong axioms you use to simplify. Please give proper explanation and typed answer only.
Computer Science Given the relation R (A, B, C, D, E, F, G) and the set of functional dependencies: F= {BCD → A, BC → E, A → F, F→G, C→D, A→G}, a) Decompose R into 3NF. Show the different steps. b) Is this decomposition also in BCNF? Why or why not?
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 the schema R = (A, B, C, D, E, G) and the set F of functional dependencies:AB → CDADE → GDEB → GCG → DEUse the 3NF decomposition algorithm to generate a 3NF decomposition of R,and show your work. This means: A canonical cover for F, along with an explanation of the steps you tookto generate it.
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
Show that the following decomposition of the schema R of Exercise 7.1 is not alossless decomposition:(A, B, C)(C, D, E).Hint: Give an example of a relation r(R) such that ΠA, B, C (r) ⋈ ΠC, D, E (r) ≠ r
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.
A relation, R, on non-empty set A is defined as a subset of A × A: R ⊆ A × A For example, let A = {1, 2, 3} then Cartesian product A × A = {(1,1), (1,2), (1,3), (2,1), (2,2), (2,3), (3,1), (3,2), (3,3)}. A binary relation R ⊆ A × A Briefly explain the meaning of the relation, providing an example (and diagram): (i)) Discuss the real-life applications of binary relations
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.
1- Reduce the following to BCNF, showing all the steps involved. Normalise the following relation to 3NF showing all the steps involved. GP(gpno,cpname,gpadd,(patno,patname,patadd,patdob)) gpno -> gpname,gpadd gpno, patno -> patname,patadd, patdob patno -> patname,patadd, patdob
Consider the schema R = (A, B, C, D, E, G) and the set F of functional dependencies:A → BCBD → ECD → AB Use the BCNF decomposition algorithm to find a BCNF decomposition of R. Start with A → BC. Explain your steps.
Although the BCNF algorithm ensures that the resulting decomposition is lossless, it is possible to have a schema and a decomposition that was not generated by the algorithm, that is in BCNF, and is not lossless. Give an example of such a schema and its decomposition.