Given

R(A B C D E F G H) And A->BCDF H->ABCDEFG B->D BG->E C->F ACH->BDG DG->E Minimal cover Step 1: Make RHS atomic R = A->B A->C A->D A->F H->A H->B H->C H->D H->E H->F H->G B->D BG->E C->F ACH->B ACH->D ACH->G DG->E Step 2: Remove redundant FDs in R For A->D; A+ = {B C F D} Since the closure of A contains D, A->D is redundant, and we remove it. Similarly A->B, A->C and A->F are not redundant.

 Similarly H-A, H->B, H->C, H->D, H->E, H->F, H->G are not redundant. BG->E is also not redundant. C->F is also not redundant. For ACH->B; ACH+ = {A C H B F G E D} Since B is present in the closure of ACH, it is redundant and we remove it. For ACH->D; ACH+={A C H F D E G} Since D is present in the closure of ACH, it is redundant and we remove it. For ACH->G; ACH+={A C H F E G} Since G is present in the closure of ACH, it is redundant and we remove it. Similarly DG->E is not redundant. So we have: R = A->B A->C A->F H->A H->B H->C H->D H->E H->F H->G B->D BG->E C->F DG->E Step 3: Remove redundant LHS attributes. For BG->E; Remove G We find B+ wrt (R (BG->E) U (G->E))

B+={B D E} This is not redundant since G is not present in the closure of B. Remove B We find G+ wrt (R (BG->E) U (B->E)) G+ = {G E} This is not redundant since B is not present in the closure of G. For DG->E; Remove G We find D+ wrt (R (DG->E) U (G->E)) D+ = {D} This is not redundant since G is not present in the closure of D. Remove D We find G+ wrt (R (DG->E) U (D->E)) G+ = {G} This is not redundant since D is not present in the closure of G. Thus we get the minimal cover of {A-B, A->C, A->F, H->A, H->B, H->C, H->D, H->E, H->F, H->G, B->D, BG->E, C->F, DG->E} Converting to 3NF Relation for determinant A R1 = {A B C F} Relation for determinant H R2 = {H A B C D E F G} And R3 = {B D G E C F}