(b) functional dependencies F = H → D, B → AI, I → BC, DH → I, ABG → HI. Note that A, B, C, D, E,G, H, and I are attributes. Consider the relational schema R(A, B,C, D, E,G, H, I) and a set of i. Regarding F, is the decomposition R1 = ABCG, R2 = DEGHI of R lossless join? Please justify your answer.

(b) functional dependencies F = H → D, B → AI, I → BC, DH → I, ABG → HI. Note that A, B, C, D, E,G, H, and I are attributes. Consider the relational schema R(A, B,C, D, E,G, H, I) and a set of i. Regarding F, is the decomposition R1 = ABCG, R2 = DEGHI of R lossless join? Please justify your answer.

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 a relation schema R = {A, B, C, D, E} and its functional dependency set F = {A → BC,CD → E,B →D,E → A}. Let R be decomposed into R1 and R2, where R1 = (A,B,C) and R2 = (A,D,E). Is the decompositionlossless? Is the decomposition dependency preserving? (a) The decomposition is lossless and dependency preserving.(b) The decomposition is neither lossless nor dependency preserving.(c) The decomposition is not lossless but dependency preserving.(d) The decomposition is lossless but not dependency preserving.
Consider the schema R = (A, B, C, D, E, G) and the set F of functional dependencies:AB → CDB → DDE → BDEG → ABAC → DER is not in BCNF for many reasons, one of which arises from the functionaldependency AB → CD. Explain why AB → CD shows that R is not in BCNFand then use the BCNF decomposition algorithm starting with AB → CD togenerate a BCNF decomposition of R. Once that is done, determine whetheryour result is or is not dependency preserving, and explain your reasoning.
Consider schema(R, F), where R=ABCDE, F={D→EB, E→A, AC→D, BD→E} Decompose the schema into a set of BCNF schemas. Is this decomposition lossless? Is it dependency-preserving? Explain
Consider a relational schema R = {A, B, C, D, E, G, H}, satisfying the functional dependencies F = {E → G, E → H, G → H, A → BC, BC → D, C → H, EG → A}. a) Derive all candidate keys for this schema. b) Derive a canonical cover of the functional dependencies in F. c) Is the above schema in BCNF? Prove or disprove. If it is not in BCNF, convert it into BCNF. d) Is the BCNF schema from (c) dependency-preserving? Prove or disprove. If not, convert into 3NF.
Given a set of FDs for the relation schema R(C, A, N, D, Y) with the candidate keys (CN), (DN)). • Y. A - DN Y · DY+C - NC D Tasks: QI. List non-prime attributes_ Q2. Which of the following is a bad functional dependence? of the relation R. (Enter A, B, C, or D) AY A B. DN + Y C. DY + C D. NC + D Q3. The relation R is in (Enter INF, 2NE, 3NE, or BCNF)
Consider the schema R = (A, B, C, D, E, G) and the set F of functional dependencies:A → BCBD → ECD → AB For your decomposition, state whether it is dependency preserving and explain why ?
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.
Suppose that we decompose the schema R = (A, B, C, D, E) into (A, B, C) (A, D, E). Show that this decomposition is a lossless decomposition if the following set F of functional dependencies holds: A → BC CD → E B → D E → A
c. For a schema R (A, B, C, D) bearing FDs F={A → B, B + c, C + D,D + A}, find if the decomposition of R into R1 (A, B, C) and R2 (B, c, D) is dependency preserving?
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: The remaining steps of the algorithm, with explanation.
Consider the relation schema R(A, B, C, D, E, F) with the following set of functional dependencies FDs F = {ABC → E, DE → A, ACE → D, BC → A, BD → E}. Is the decomposition of R into R into R1(A, B, C, E), R2(B, C, D) and R3(B, D, F) a lossless decomposition? (Explain)
Consider the schema R = (A, B, C, D, E, G, H) and the set F of functional dependencies:AB → CDD → CDE → BDEH → ABAC → DCUse the 3NF decomposition algorithm to generate a 3NF decomposition of R,and show your work. This means: The steps of the algorithm, with explanation.