Similar Collections

.

questions

Title
A sequence of primitive operations that can be used to evaluate a query are called as __________
The lowest level operator to access data in query processing is _______
Search algorithms that use an index are referred to as _________
Sorting of relations that do not fit in memory is called as _______
A selection of the form satisfying the intersection of all records satisfying individual simple conditions is
A selection of the form satisfying the union of all records satisfying individual simple conditions is
A selection of the form giving all the records not satisfying simple individual conditions is ______
Which of the following can be implemented?
If the results of one operation are passed on to the other, it is called as ________
The result of each intermediate operation are created and then are used for valuation of the next level operations, this evaluation is called as ________
If the system makes repeated requests for tuples from the operation at the top of the table, it is called as _________
If the operations do not wait to produce tuples, then it is called as _________
State true or false: Sorting is an inherently blocking operation
State true or false: Join is an inherently blocking operation
Which of the following techniques does not exist?
State true or false: Hybrid hash join is partially pipelined on the probe relation
The usage of two buffers, with one continuing execution of the algorithm while the other is written is called as __________
Which of the following functions does an iterator not provide
If on every legal database instant, the two expressions generate the same set of tuples, the expressions are called as
State true or false: Selection operations are commutative
total questions: 204

Questions

204

Views

1496

Best Answers

299

Points

5