Question: 3. (2+1+1+1 points) Consider a relation with schema R(a,b,c,d) and functional dependencies F={abc,cd,da} on R. a) Compute the closure of every attribute set U, where

3. (2+1+1+1 points) Consider a relation with schema R(a,b,c,d) and functional dependencies F={abc,cd,da} on R. a) Compute the closure of every attribute set U, where U{a,b,c,d} b) What are the keys of R ? c) What are the superkeys of R that are not keys? d) What are all the nontrivial functional dependencies that are logically implied by F ? Restrict yourself to those with single attributes on the right side
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
