The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+2 votes
68 views
given R(ABCDE)

AB -> C

C -> D

B ->E

FIND CANDIDATE KEY

 

Solution :  AB will be candidate key   because (AB)+   = R

my question is do i have to check for  (AC)+ ,(AD)+ , (AE)+ , (ACDE)+
asked in Databases by Loyal (3.2k points) | 68 views

1 Answer

0 votes
Best answer
From the RHS of the every FD given for the relation, it can be observed that we can find C,D and E attribute values using the FD. But Remaining attributes AB will not derived using any of the FD, hence these should be part of the CK. An attribute set which does not contain AB will not be candidate key, hence no need to check for (AC)+ and others you have mentioned.

For any attribute or attribute set , if we can able to get all the attributes by applying closure set of attributes, then that attribute or attribute set will become CK.
answered by Loyal (3.6k points)
selected by
thnks bro got it :)

Related questions

+1 vote
0 answers
1
asked in Databases by atul_21 Loyal (2.7k points) | 61 views
0 votes
3 answers
2
+2 votes
3 answers
3


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

29,153 questions
36,971 answers
92,116 comments
34,815 users