Question: Let R ( A B C D E ) be a relation schema and let F = { A B E , E C ,

Let R(ABCDE) be a relation schema and let F={ABE,EC,CED,DE,BCD} be
the set of functional dependencies that are holding true on R.
(3.1) Using the computation of attribute closure +, determine if each functional dependency
below is in F+or not. Note that is in F+if and only if in+.
a)ED
b)AB
c)ABD
d)BCE
a)ED
E+=
b)AB
A+=
c)ABD
AB+=
d)BCE
BC+=
(3.2) Compute a canonical cover of F. Show the steps in your computation.
Let R ( A B C D E ) be a relation schema and let

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 Accounting Questions!