0 votes 0 votes Find the highest normal form of a relation R(A,B,C,D,E) with FD set {B->A, A->C, BC->D, AC->BE} Muskan Jain asked Jan 17, 2019 Muskan Jain 333 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Muskan Jain commented Jan 17, 2019 reply Follow Share https://www.geeksforgeeks.org/how-to-find-the-highest-normal-form-of-a-relation/ Refer here. example 3 0 votes 0 votes Mk Utkarsh commented Jan 17, 2019 reply Follow Share BCNF B and A are CKs BC and AC are super keys no transitive dependency and no partial dependency found 1 votes 1 votes Please log in or register to add a comment.
1 votes 1 votes Candidate Keys = A, B B -> A ( LHS Super Key. Hence BCNF) A -> C ( LHS Super Key. Hence BCNF) BC -> D (LHS Super Key. Hence BCNF) AC -> BE (LHS Super Key. Hence BCNF) Hence, Highest normal form of relation is BCNF Fyse answered Jan 17, 2019 Fyse comment Share Follow See all 0 reply Please log in or register to add a comment.