3. Consider the relation schema R = (A,B,C,D). For each of the following set of FDs, do the following: (a) identify the candidate keys for R. (b) state whether or not the proposed decomposition of R is lossless join and dependency preserving. Justify your answers. 1. B→C, A→D; decompose into (B,C) and (A,D). 2. AB→D, D→A, D→C; decompose into (A,C,D) and (B,D). 3. A→BC, C→AD; decompose into ABC and AD. 4. A→B, BC, C→D; decompose into AB and ACD. 5. A→B, BC, C→D; decompose into AB, AD and CD.

3. Consider the relation schema R = (A,B,C,D). For each of the following set of FDs, do the following: (a) identify the candidate keys for R. (b) state whether or not the proposed decomposition of R is lossless join and dependency preserving. Justify your answers. 1. B→C, A→D; decompose into (B,C) and (A,D). 2. AB→D, D→A, D→C; decompose into (A,C,D) and (B,D). 3. A→BC, C→AD; decompose into ABC and AD. 4. A→B, BC, C→D; decompose into AB and ACD. 5. A→B, BC, C→D; decompose into AB, AD and CD.

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: 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: Which of the followings can possibly be a canonical cover Fc of a set F of functional dependencies?…

A: The answer to this question is option b) {A → D, AB → C, D → B} and d) {A → C, D → B, 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: 1. There exists a relation S(A, B, C, D, E, F) with the below functional dependencies. {A}→{D}…

A: a. No, A,B is not a superkey. The functional dependency {A}>{E} implies that A is not a superkey.…

Q: Courses(C, T, H, R, S, G) Relation and F={C→T ,HR→C, HT→R, HS→R,CS→G} is given. What is the…

Q: Show that it is possible to ensure that a dependency-preserving decomposition into 3NF is a lossless…

A: Let F be a set of functional dependencies which hold on a schema R. Let sigma={R1,R2,...,Rn} be a…

Q: Find a minimal cover in a standard form for the relation schema R(A, B,C, D, E, F, G, H) with the…

A: A minimal cover or canonical cover means a minimum set of functional dependencies. A canonical cover…

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: Consider the schema R=ABCDEG and the set of functional dependencies F={BC→AG, BG→CD, C→AE, D→AG} 2a)…

A: To address each part of your question:2a) Determine the keys of the schema:To find the keys of the…

Q: 1. If we project the relation R(A,B,C,D,E) with dependencies A→→BC, B→D, and C→→E onto S(A,C,E),…

A: Answer is given below-

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: 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 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: Consider the relation schema R (A, B, C, D, E, F, G, H) with the set of functional dependencies K =…

A: Actually, given relation schema R (A, B, C, D, E, F, G, H)... functional dependencies K = {A→B,…

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

A: The original relation is r(A,B,C,D,E,F). This relation is not BCNF due to the first functional…

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

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

A: Now we must determine the above definition whether for each FD. Each value is super key or not on…

Q: Given the relation R (A, B, C, D, E) and the following set of functional dependencies: F = {ABC,…

Q: Consider the following set of functional dependency for the relation schema R = (А, В, С, D, E, F,…

A: Objective: A relation R (A,B,C,D,E,F,G,H) is given. We need to convert this functional dependency up…

Question

100%

3. Consider the relation schema R = (A,B,C,D). For each of the following set of FDs, do the
following: (a) identify the candidate keys for R. (b) state whether or not the proposed
decomposition of R is lossless join and dependency preserving. Justify your answers.
1. B→C, A→D; decompose into (B,C) and (A,D).
2. AB→D, D→A, D→C; decompose into (A,C,D) and (B,D).
3. A→BC, C→AD; decompose into ABC and AD.
4. A→B, B→C, C→D; decompose into AB and ACD.
5. A→B, BC, C→D; decompose into AB, AD and CD.

Expert Solution

This question has been solved!

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

SEE SOLUTION Check out a sample Q&A here

Step 1: Define Losseless Join

VIEW

Step 2: Identifying Candidate keys and checking if the relation is loseless

VIEW

Solution

VIEW

Step by step

Solved in 3 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

Let FD ={G → A, A → BC, C → FG, E → HG; be a set of functional dependencies. Calculate the projection of FD on {A, E, F}. Show your work.
Consider the following set F of functional dependencies on the relation schema(A, B, C, D, E, G):A → BCDBC → DEB → DD → A Prove (using Armstrong’s axioms) that AG is a superkey.
Consider a schema R and a set F of functional dependencies as follows: R= (A,B,C,D,E,G). F = {A → BCD, BC DE,B→D,D→A}. Prove that AG is a superkey for R.
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.
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.
Consider the relation R = {A, B, C, D, E, F, G, H, I,J} and the set of functional dependencies F = { {A, B} → {C}, {A} → {D, E}, {B} → {F}, {F} →{G, H}, {D} → {I, J} }. (b) Whether (A,B,F} is a super key? Whether {A,B,F} is a candidate key? Why? (c) Whether {A,D} is a super key? Whether {A,D} is a candidate key? Why?
Consider the universal relation R = {A. B. C, D, E, F, G, H, I, J} and the set of functional dependencies F = {{A, B}→(C), (A)→{D, E), (B) (F). (F)-(G, H), [D) (I, J}}. %3D !3! Which of the following functional dependency violates 2NF? (Choose all that apply) O (A, B)->(C) O IAID, E) (B)-(F) O (F)>(G, H) O (D)(I, J)
In the BCNF decomposition algorithm, suppose you use a functional dependency α → β to decompose a relation schema r(α, β, γ) into r1(α, β) and r2(α, γ). Give an example of an inconsistency that can arise due to an erroneousupdate, if the foreign-key constraint were not enforced on the decomposedrelations above.
Give an example of a relation schema R′ and set F′ of functional dependencies such that there are at least three distinct lossless decompositions of R′ into BCNF.
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.
Consider the following set F of functional dependencies on the relation schema(A, B, C, D, E, G):A → BCDBC → DEB → DD → A Give a 3NF decomposition of the given schema based on a canonical cover.
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