Define the term of candidate keys.

1.	Define the term of candidate keys.
Answer» A\xa0candidate key\xa0is a set of attributes (or attribute) which uniquely identify the tuples in relation or table. As we know that\xa0Primary key\xa0is a minimal super\xa0key, so there is one and only one\xa0primary key\xa0in any relationship but there is more than one\xa0candidate key\xa0can take place. The minimal set of attribute which\xa0can\xa0uniquely identify a tuple is known as\xa0candidate key. The value of\xa0Candidate Key\xa0is unique and non-null for every tuple. There\xa0can\xa0be more than one\xa0candidate key\xa0in a relation.

Discussion