Lossless Dependency Preserving 3NF decomposition Algorithm 2

The minimal cover of F is given 1. Search for dependencies in F-having the same attribute set on the left hand side A: A->B1, A->B2, A->B3, …, A->Bk And construct relation as (A, B1, B2, B3,…, Bk) 2. Construct a relation with remainder attributes. 3. In case none of the relations has a candidate key, ...