0 votes 0 votes How can we write dependency AB -> A ? can we write it as B->A ?? akshayaK asked Sep 27, 2018 akshayaK 277 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Shaik Masthan commented Sep 27, 2018 reply Follow Share if B --> A, then you can write it as AB --> A ( By augimenting A both side ) But if you have, AB --> A, then we can't say that it can be written as B ---> A or not? ( i mean it's depend upon your Functional dependency set) For example, if your FD set { AB --> A, B --> D and D --> A } then AB --> A can be written as B --->A ( i just removed redundant term. ) if your FD set { AB --> A, B --> D } then AB --> A can't be written as B --->A 2 votes 2 votes akshayaK commented Sep 28, 2018 reply Follow Share I have this FD set {AB->CDE, C->A, D->E}. i have reduced this set to {AB->C, AB->D, C->A, D->E} by removing AB->E Can this be reduced further ??? 0 votes 0 votes Shaik Masthan commented Sep 28, 2018 reply Follow Share No, it can't reduce further. 0 votes 0 votes Please log in or register to add a comment.