I got this problem from a friend and was wondering if anyone could help
out.
The following is a set of functional dependency for a relation R
(A,B,C,D,E,F) with A->D, BE->CDF, C->E, D->B
where A->D implies A determines D or D is functionally dependent on A.
Questions:
1. Compute the closure(A,C) for the above set.
2. Is the set A,C a super key for the given relation R.
Thanks
__________________
William
--
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
