Milestone : Algorithm of Problem 1

• Algorithm for Relation Synthesis Algorithm with dependency preservation and lossless join property:

• Input: A universal relation R and a set of functional dependencies F ont he attributes of R.

• 1. Find a minimal cover G for F

• 2. For each LHS X of a functional dependency that appears in G create a relation schema in D with attributes {X U {A1} U {A2} ... {Ak}}, where X --> A1, X --> A2, ..., X -->Ak are the only dependencies in G with X as the LHS (X is the key of this relation)

• 3. If none of the relation schemas in D contains a key of R, then create one more relation schema in D that contains attributes that form a key of R.