Which algorithm uses equality comparison on a key attribute with a primary index to retrieve a single record that satisfies the corresponding equality condition.

Related MCQs

• The strategy can retrieve a single record if the equality condition is on a key; multiple records may be retrieved if the indexing field is not a key is
• In a                clustering index, the index record contains the search-key value and a pointer to the first data record with that search-key value and the rest of the records will be in the sequential pointers.
• In a _______ clustering index, the index record contains the search-key value and a pointer to the first data record with that search-key value and the rest of the records will be in the sequential pointers.
• The relation with the attribute which is the primary key is referenced in another relation. The relation which has the attribute as a primary key is called                              
• The relation with the attribute which is the primary key is referenced in another relation. The relation which has the attribute as a primary key is called ______________
• The relation with the attribute which is the primary key is referenced in another relation. The relation which has the attribute as primary key is called
• The algorithm that uses a secondary ordered index to guide retrieval for comparison conditions involving <,≤,≥, or > is
• An attribute in a relation is a foreign key if the                key from one relation is used as an attribute in that relation.
• A relation is in                          if an attribute of a composite key is dependent on an attribute of other composite key.
• If an attribute of a composite key is dependent on an attribute of the other composite key, normalization called ................ is needed.