The iterator maintains the                      of its execution in between calls so that successive next() requests receive successive result tuples.

Related MCQs

• 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                            operations do not wait for requests to produce tuples, but instead generate the tuples eagerly.
• 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?
• 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                    the system makes repeated requests for tuples from the operation at the top of the pipeline.
• The result which operation contains all pairs of tuples from the two relations, regardless of whether their attribute values match.
• The system has entered an undesirable state (for example, deadlock), as a result of which a transaction cannot continue with its normal execution. This is
• If there are n tuples in the partition and the rank of the tuple is r, then its                  is defined as (r −1)/(n−1).
• Which is the transformation of requests and results between different levels of abstraction:
• A            is a property of the entire relation, rather than of the individual tuples in which each tuple is unique.