If a relation can have more than one record containing the same search – McqOptions

MCQOPTIONS

1.	If a relation can have more than one record containing the same search key value, the search key is said to be a __________
A.	Unique search key
B.	Non unique search key
C.	Multiple search key
D.	Identical search key
Answer» C. Multiple search key

Discussion

No Comment Found

Related MCQs

___________ are the indices that store the values of some attributes along with the pointers to the recor.
Insertion of a large number of entries at a time into an index is referred to as _______ of the index.
Statement 1: Insertion of record might require the change in position of the initial nodes.Statement 2: Deletion of records might require the change in position of the initial nodes.
____________ARE_THE_INDICES_THAT_STORE_THE_VALUES_OF_SOME_ATTRIBUTES_ALONG_WITH_THE_POINTERS_TO_THE_RECOR.?$
Insertion of a large number of entries at a time into an index is referred to as _______ of the index?
State true or false: The fanout of nodes can be increased by using a technique called _________
If a relation can have more than one record containing the same search key value, the search key is said to be a __________
Statement 1: Insertion of record might require the change in position of the initial nodes.
The queries used to find all records with search key values in a particular range are known as ________
Non-leaf nodes are also called as __________