Database-Management-System
August 29, 2024Database-Management-System
August 29, 2024Database-Management-System
| Question 764 |
If there is more than one key for relation schema in DBMS then each key in relation schema is classified as:
| Primary key | |
| Super key | |
| candidate key | |
| Primary key |
Question 764 Explanation:
If there is more than one key for relation schema in DBMS then each key in relation schema is classified as candidate key.
→ In the relational model of databases, a candidate key of a relation is a minimal superkey for that relation; that is, a set of attributes such that:
1.The relation does not have two distinct tuples (i.e. rows or records in common database language) with the same values for these attributes (which means that the set of attributes is a superkey)
2.There is no proper subset of these attributes for which (1) holds (which means that the set is minimal).
→ Candidate keys are also variously referred to as primary keys, secondary keys or alternate keys. The constituent attributes are called prime attributes. Conversely, an attribute that does not occur in ANY candidate key is called a non-prime attribute.
→ Since a relation contains no duplicate tuples, the set of all its attributes is a superkey if NULL values are not used. It follows that every relation will have at least one candidate key. The candidate keys of a relation tell us all the possible ways we can identify its tuples. As such they are an important concept for the design of database schema.
→ In the relational model of databases, a candidate key of a relation is a minimal superkey for that relation; that is, a set of attributes such that:
1.The relation does not have two distinct tuples (i.e. rows or records in common database language) with the same values for these attributes (which means that the set of attributes is a superkey)
2.There is no proper subset of these attributes for which (1) holds (which means that the set is minimal).
→ Candidate keys are also variously referred to as primary keys, secondary keys or alternate keys. The constituent attributes are called prime attributes. Conversely, an attribute that does not occur in ANY candidate key is called a non-prime attribute.
→ Since a relation contains no duplicate tuples, the set of all its attributes is a superkey if NULL values are not used. It follows that every relation will have at least one candidate key. The candidate keys of a relation tell us all the possible ways we can identify its tuples. As such they are an important concept for the design of database schema.
Correct Answer: C
Question 764 Explanation:
If there is more than one key for relation schema in DBMS then each key in relation schema is classified as candidate key.
→ In the relational model of databases, a candidate key of a relation is a minimal superkey for that relation; that is, a set of attributes such that:
1.The relation does not have two distinct tuples (i.e. rows or records in common database language) with the same values for these attributes (which means that the set of attributes is a superkey)
2.There is no proper subset of these attributes for which (1) holds (which means that the set is minimal).
→ Candidate keys are also variously referred to as primary keys, secondary keys or alternate keys. The constituent attributes are called prime attributes. Conversely, an attribute that does not occur in ANY candidate key is called a non-prime attribute.
→ Since a relation contains no duplicate tuples, the set of all its attributes is a superkey if NULL values are not used. It follows that every relation will have at least one candidate key. The candidate keys of a relation tell us all the possible ways we can identify its tuples. As such they are an important concept for the design of database schema.
→ In the relational model of databases, a candidate key of a relation is a minimal superkey for that relation; that is, a set of attributes such that:
1.The relation does not have two distinct tuples (i.e. rows or records in common database language) with the same values for these attributes (which means that the set of attributes is a superkey)
2.There is no proper subset of these attributes for which (1) holds (which means that the set is minimal).
→ Candidate keys are also variously referred to as primary keys, secondary keys or alternate keys. The constituent attributes are called prime attributes. Conversely, an attribute that does not occur in ANY candidate key is called a non-prime attribute.
→ Since a relation contains no duplicate tuples, the set of all its attributes is a superkey if NULL values are not used. It follows that every relation will have at least one candidate key. The candidate keys of a relation tell us all the possible ways we can identify its tuples. As such they are an important concept for the design of database schema.