Learning Objectives:
- Get familiar with reasoning of functional dependencies
Your task:
- Here are two sets of FDs for a relation schema R(ABCDE).
Are the two sets equivalent?
- A -> B, AB -> C, D -> AC, D -> E
- A -> BC, D -> AE
- Let F be a set of functional dependencies and X -> A is in F.
Show that F is equivalent to
F - {X -> A} if and only if the closure of X with respect to
F - {X -> A} contains A.