retagged by
949 views

2 Answers

0 votes
0 votes

Option C. Candidate Keys.

Candidate key is a set of attributes that uniquely identify tuples in a table. 

We can have more than one candidate keys for a relational schema.

Any one of the key is chosen from candidate key as Primary Key.

0 votes
0 votes

CANDIDATE KEY is a set of attributes that uniquely identify tuples in a table. Candidate Key is a super key with no repeated attributes. The Primary key should be selected from the candidate keys. Every table must have at least a single candidate key. A table can have multiple candidate keys but only a single primary key.

Option C is Correct

 

Answer:

Related questions

0 votes
0 votes
2 answers
1
admin asked Mar 31, 2020
907 views
Normalization from which is based on transitive dependency is classified as:First normal form.Second normal form.Fourth normal form.Third normal form.
2 votes
2 votes
1 answer
2
admin asked Mar 31, 2020
1,244 views
Which of the following is a fundamental operation in relational algebra?Set intersectionAssignmentNatural JoinNone of the above
0 votes
0 votes
2 answers
3
admin asked Mar 31, 2020
3,417 views
In functional dependency between two sets of attribute $A$ and $B$ then set of attributes $A$ of database is classified as:top right sidedown left sideleft hand sideright...
1 votes
1 votes
2 answers
4
admin asked Mar 31, 2020
3,236 views
Which type of Statement can execute parameterized queries?PreparedStatementParameterizedStatementParameterizedStatement and CallableStatementAll kinds of Statements