Relational Schema
|
Question 6
|
Let R (ABCDEFGH) be a relation schema and F be the set of dependencies F={A→ B, ABCD→ E, EF→ G, EF→ H and ACDF→ EG}. The minimum cover of a set of functional dependencies is
|
A→ B, ACD→ E, EF→ G, EF→ H
|
|
|
A→ B, ACD→ E, EF→ G, EF→ H and ACDF→ G
|
|
|
A→ B, ACD→ E, EF→ G, EF→ H AND ACDF→ E
|
|
|
A→ B, ABCD→E , EF→ H, EF→ G
|
Correct Answer: A