1 1 vote Let F = {PQ → R, PR→ Q, Q → S, QR → P, PQ → T} where F is set of FD’s of a relation R(PQRST). The number of functional dependencies are in minimal cover determine single attribute of F is ________. Databases + – User007 5.3k views answer comment Share Follow Print See all 9 Comments 9 9 Comments reply Prashant. commented Nov 25, 2016 reply Follow flag whats is your doubt? 0 0 replyShare User007 commented Nov 25, 2016 reply Follow flag Language of this question is not clear to me. What are they asking us to find? If number of functional dependencies in minimal cover of F has been asked then according to me correct answer should be 4 and NOT 5 (as provided by MADE EASY). Please correct me if I am wrong. 0 0 replyShare Prashant. commented Nov 25, 2016 reply Follow flag question asked find minimal cover then give number of Functional dependenct left . initialy 5. How you get 4 [ which one you removed ] 0 0 replyShare Prajwal Bhat commented Nov 25, 2016 reply Follow flag @Anirudh I think PQ-> R and PQ->T can be merged to form PQ-> RT... 0 0 replyShare Prashant. commented Nov 25, 2016 reply Follow flag Prajwal PQ-> RT are two depndency ryt PQ-> R and PQ->T ? A->BCDE not one dependency ryt ? 1 1 replyShare Prajwal Bhat commented Nov 25, 2016 reply Follow flag @Anirudh I am not sure we need to count it as one FD or 2 .! 0 0 replyShare Prashant. commented Nov 25, 2016 reply Follow flag now we can see PQ -> R is and PQ-> T . PQ indivisualy identify R and T not RT as both. 1 1 replyShare User007 commented Nov 25, 2016 reply Follow flag PQ --> R and PQ --> T can be merged together as PQ --> RT. Please correct me if I am wrong. 0 0 replyShare Prajwal Bhat commented Nov 25, 2016 reply Follow flag @Anirudh Check the page no.5 here http://www.inf.usi.ch/faculty/soule/teaching/2014-spring/cover.pdf which says Simplifying an FD by the Union Rule Let X, Y , and Z be sets of attributes. If X → Y and X → Z, then X → Y Z 0 0 replyShare Please log in or register to add a comment.
Best answer 1 1 vote If the question is to find minimal cover of F = {PQ → R, PR→ Q, Q → S, QR → P, PQ → T} then it would be No Trivial dependency Simplifying an FD by the Union Rule PQ-> R and PQ->T can be merged to form PQ-> RT RHS Simplification and LHS Simplification is not possible here Finally we are left with F = {PQ → RT, PR→ Q, Q → S, QR → P} But question says The number of functional dependencies are in minimal cover determine single attribute of F is In that case the given FD itself is in minimal form F = {PQ → R, PR→ Q, Q → S, QR → P, PQ → T} Thus there will be 5 FD's in Minimal cover Ref: http://www.inf.usi.ch/faculty/soule/teaching/2014-spring/cover.pdf Prajwal Bhat answered Nov 25, 2016 • selected Nov 26, 2016 by Prashant. Prajwal Bhat comment Share Follow See 1 comment 1 1 comment reply Prashant. commented Nov 25, 2016 reply Follow flag where written AB -->CD is one FD. they apply union rule . 0 0 replyShare Please log in or register to add a comment.
3 3 votes Huluhulu test series Huluhulu question. Muquim Akhter answered Dec 23, 2024 Muquim Akhter comment Share Follow 0 reply Please log in or register to add a comment.
2 2 votes A minimal cover, also known as an irreducible set of functional dependencies (FDs), does not have a unique solution. The number of FDs in a minimal cover can vary, so different valid solutions may contain 3, 4, or 5 FDs, depending on how the cover is derived. If a set of FDs cannot be further reduced and remains irreducible, it is considered a minimal cover.Therefore, the number of FDs in a minimal cover cannot be determined. hrupam answered Sep 11, 2024 hrupam comment Share Follow 0 reply Please log in or register to add a comment.