Q. Search algorithms that use an index are referred to as _________

View solution

Q. Sorting of relations that do not fit in memory is called as _______

View solution

Q. A selection of the form satisfying the intersection of all records satisfying individual simple conditions is

View solution

Q. A selection of the form satisfying the union of all records satisfying individual simple conditions is

View solution

Q. A selection of the form giving all the records not satisfying simple individual conditions is ______

View solution

Q. Which of the following can be implemented?

View solution

Q. If the results of one operation are passed on to the other, it is called as ________

View solution

Q. The result of each intermediate operation are created and then are used for valuation of the next level operations, this evaluation is called as ________

View solution

Q. If the system makes repeated requests for tuples from the operation at the top of the table, it is called as _________

View solution

Q. If the operations do not wait to produce tuples, then it is called as _________

View solution

Q. State true or false: Sorting is an inherently blocking operation

View solution

Q. State true or false: Join is an inherently blocking operation

View solution

Q. Which of the following techniques does not exist?

View solution

Q. State true or false: Hybrid hash join is partially pipelined on the probe relation

View solution

Q. The usage of two buffers, with one continuing execution of the algorithm while the other is written is called as __________

View solution

Q. Which of the following functions does an iterator not provide

View solution

Q. If on every legal database instant, the two expressions generate the same set of tuples, the expressions are called as

View solution

Q. State true or false: Selection operations are commutative

View solution

Q. Which of the following operations are associative

View solution

Q. Which of the following set operations is not commutative?

View solution