2 2 votes 1. How many super key is possible if (a,bc,cd) is candidate key and R(ABCDEF) #DOUBT When we use veen digram why we are taking only intersections part only ??? Need help please explain .. Databases databases relational-algebra database-normalization transaction-and-concurrency + – air1ankit 1.1k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
2 2 votes Easy way to understand.. We are not actually taking the intersection part but we are omitting the intersection so that we have union of all super keys possible.. I hope you understand vamp_vaibhav answered Nov 17, 2017 vamp_vaibhav comment Share Follow See all 2 Comments 2 2 Comments reply air1ankit commented Nov 17, 2017 reply Follow flag got it !, and if you use Venn diagram and then apply same formula then we get more accuracy but grate work thanks 0 0 replyShare Jony Bhatt commented Nov 1, 2018 reply Follow flag How to calculate p(a intersection b) plz solve the question 0 0 replyShare Please log in or register to add a comment.
1 1 vote 44 is the answer a2^5+bc2^4+cd2^4-abc2^3-acd2^3-bcd2^3+abcd2^2 32+32-8-8-8+4 68-24 44 akshat sharma answered Oct 26, 2017 akshat sharma comment Share Follow See 1 comment 1 1 comment reply air1ankit commented Oct 26, 2017 reply Follow flag Can u explain using digram.. 0 0 replyShare Please log in or register to add a comment.