In a relation schema, each key of schema having more than one key is c – McqOptions

MCQOPTIONS

1.	In a relation schema, each key of schema having more than one key is classified as
A.	candidate key
B.	super key
C.	simple key
D.	parallel key
Answer» B. super key

Discussion

No Comment Found

Related MCQs

Which transaction contains statements that access more than one node?
What is the mechanism which guarantees that all database servers participating in a distributed transaction either all commit or all roll back the statements in the transaction?
A distributed transaction can be ............. if queries are issued at one or more nodes.
Depending on the situation each node in the Distributed Database system can act as, _________ .
In relational database schemas, the state constraints are also known as
The basic operations that can be performed on relations are
The definition of relation in which values and attributes are ordered in tuple is classified as
A homogeneous distributed database is which of the following?
The ______ is the one in which the primary key of one relation is used as a normal attribute in another relation .
Domain constraints, functional dependency and referential integrity are special forms of _________.