Milestone : Algorithm of Problem 1

• To find a key K for a relation schema R based on a set F of functional dependencies

• 1. Set K := R

• 2. For each atttribute A in K {

• Compute (K - A)+ with respect to F;

• If (K - A )+ contains all the attributes in R, then set K := K - {A};

• }