Each operation in a demand-driven pipeline can be implemented as an          that provides the following functions: open(), next(), and close().

Related MCQs

• In a                    the system makes repeated requests for tuples from the operation at the top of the pipeline.
• The results of each intermediate operation are created and then are used for evaluation of the next-level operations. This is called
• Once the lower-level lock is released, the operation cannot be undone by using the old values of updated data items, and must instead be undone by executing a compensating operation; such an operation is called
• When two inputs that we desire to pipeline into the join are not already sorted it is the                            technique.
• Aggregate functions are functions that take a                        as input and return a single value.
• The operation which is not considered a basic operation of relational algebra is
• Whenever an update operation occurs on a page, the operation stores the LSN of its log record in the                field of the page.
• Which refers to a property of computer to run several operation simultaneously and possible as computers await response of each other
• Which refers to a property of computer to run several operation simultaneously and possible as computers await response of each other:
• The           operation allows the combining of two relations by merging pairs of tuples, one from each relation, into a single tuple.