The        algorithm scans each index for pointers to tuples that satisfy an individual condition.

Related MCQs

• 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
• Which one of the following provides the ability to query information from the database and to insert tuples into, delete tuples from, and modify tuples in the database?
• In a                          the system scans each file block and tests all records to see whether they satisfy the selection condition.
• Suppose now that R(A,B:) and S(A,B:) are two relations with r and s tuples, respectively (again, not necessarily distinct). If m is the number of (not necessarily distinct) tuples in the result of the SQL query: R intersect S; Then which of the following is the most restrictive, correct condition on the value of m?
• Which of the following is used at the end of the view to reject the tuples which do not satisfy the condition in where clause?
• A                  on an attribute of a relation is a data structure that allows the database system to find those tuples in the relation that have a specified value for that attribute efficiently, without scanning through all the tuples of the relation.
• In a                            operations do not wait for requests to produce tuples, but instead generate the tuples eagerly.
• 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.
• A            is a property of the entire relation, rather than of the individual tuples in which each tuple is unique.