Unit 4 · Database Management Systems Paper 2 CS · September 2022

Let R(ABCDEFGH) be a relation schema and F = {A → B, ABCD → E, EF → G, EF → H, ACDF → EG} the set of dependencies. The minimal cover of F is

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: A. A → B, ACD → E, EF → G, EF → H

Explanation

B is extraneous in ABCD → E (A → B), giving ACD → E. ACDF → E follows from ACD → E, and ACDF → G follows via E and F (EF → G). Both are redundant.