An                          consists of a search-key value and pointers to one or more records with that value as their search-key value.

Related MCQs

• An ____________ consists of a search-key value and pointers to one or more records with that value as their search-key value.
• 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                          scheme uses a page table containing pointers to all pages; the page table itself and all updated pages are copied to a new location.
• The        algorithm scans each index for pointers to tuples that satisfy an individual condition.
• If access paths are available on all the conditions of a disjunctive selection, each index is scanned for pointers to tuples that satisfy the individual condition. This is satisfied by
• A unit of storage that can store one or more records in a hash file organization is denoted as
• The unit of storage that can store one are more records in a hash file organization are
• Consider the employee work-team example, and assume that certain employees participate in more than one work team. A given employee may therefore appear in more than one of the team entity sets that are lower level entity sets of employee. Thus, the generalization is                            
• Each tablespace in an Oracle database consists of one or more files called