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

Q. State true or false: The projection operation does not distribute over the union operation

View solution

Q. If no rule can be derived from any combination of others then the set of rules is said to be ________

View solution

Q. Theta join operations are

View solution

Q. Which of the following operations is associative

View solution

Q. Which of the following set operations does the selection operation distribute over?

View solution

Q. State true or false: Multiple equivalence rules can be used one after the other on a query

View solution

Q. Which of the following information does the database system catalog store?

View solution