Milestone : Algorithm of Problem 1

• To calculate minimal cover G for F

• 1. Set G := F

• 2. Replace each functional dependency X --> {A1,A2, ..., Ak} in G by the k functional dependencies X --> A1, X --> A2, ... X-> Ak

• 3. For each functional dependency X --> A in G

• for each attribute B that is an element of X

• if ((G - {X --> A}) U {(X - {B} -> A)}) is equivalent to G

• then replace X --> A with (X - {B}) -> A in G

• 4. For each remaining functional dependency X --> A in G

• if (G - {X --> A}) is equivalent to G

• then remove X --> A from G.