1 votes 1 votes Consider R(A,B,C,D,E,F,G) be a relational schema with the following functional dependencies: AC->G, D->EG, BC->D, CG->BD, ACD->B, CE->AG The number of different minimal cover possible are___________? Somoshree Datta 5 asked Sep 13, 2018 Somoshree Datta 5 5.3k views answer comment Share Follow See all 49 Comments See all 49 49 Comments reply Show 46 previous comments Shivam Kasat commented Dec 22, 2018 reply Follow Share https://gateoverflow.in/273396/madeeasydbms Check this out! Only 2 minimal covers possible. 0 votes 0 votes Shamim Ahmed commented Dec 22, 2018 reply Follow Share Yes there are 2 diffrent minimal covers possible. I counted number of dependencies of a minimal cover. 0 votes 0 votes SAUMYA2019 commented Jan 23, 2019 reply Follow Share plz explain this soln? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes The posssible keys are ACF,BCF,DCF,ECF,GCF. Shivateja MST answered Oct 20, 2019 Shivateja MST comment Share Follow See all 0 reply Please log in or register to add a comment.