Question: Suppose you are given a relation R(A, B, C, D). For each of the following sets of FDs, assume they are the only dependencies that

 Suppose you are given a relation R(A, B, C, D). For

Suppose you are given a relation R(A, B, C, D). For each of the following sets of FDs, assume they are the only dependencies that hold for R. Do the following: a) identify the candidate key(s) for R. b) State whether or not the proposed decomposition of R into smaller relations is a good decomposition and briefly explain why or why not 1 . A > B. B-> C, B.> D decompose into ABC and BcD. 1. Candidate keys: 2. Analysis: 2.C-AD, B-D decompose into ACD and BD. 1. Candidate keys 2.Analysis 3. A D, C-B; decompose into AD and BC. 1. Candidate keys: 2. Analysis: 4.C-B, D ->A; decompose into BCD and AD 1. Candidate keys 2. Analysis

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!