Question: Consider the schema R (A, B, C, D, E) and let the following set F of functional dependencies hold for R: F-A BC, CD E,C

Consider the schema R (A, B, C, D, E) and let the following set F of functional dependencies hold for R: F-A BC, CD E,C A, B D Problem 1 Prove or disprove AD E is in the closure of F. A proof can be made by using inference rules IR1 through IR3. A disproof should be done by showing a relational instance (counter example) that refutes the rule
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
