Home > Databases > Quizzes > Advance Data Management Technology: Query Processing and Optimization
Advance Data Management Technology: Query Processing and Optimization
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 41% Most missed: “Which of the following operations is associative”
Advance Data Management Technology: Query Processing and Optimization
Time left 00:00
25 Questions

1. Which of the following information does the database system catalog store?
2. The result of each intermediate operation are created and then are used for valuation of the next level operations, this evaluation is called as ________
3. The join orders where the right operand of each join is in one of the initial relations are called as ________
4. The usage of two buffers, with one continuing execution of the algorithm while the other is written is called as __________
5. If the operations do not wait to produce tuples, then it is called as _________
6. The splitting of input until each partition of the build input fits the memory is called as ______
7. The lowest level operator to access data in query processing is _______
8. Theta join operations are
9. A sequence of primitive operations that can be used to evaluate a query are called as __________
10. Which of the following can be implemented?
11. A relational algebra operation annotated with instructions on how to evaluate it is called _______
12. Sorting of relations that do not fit in memory is called as _______
13. State true or false: Selection operations are commutative
14. Search algorithms that use an index are referred to as _________
15. Which of the following is not a set operation
16. Optimizers use __________ to reduce the cost of optimization.
17. Which of the following is an attribute that can uniquely identify a row in a table?
18. The union of all records satisfying the individual simple conditions Oi is called as ________
19. Which of the following set operations does the selection operation distribute over?
20. The size of a _____ is simply V(A,r) where r is the relation and A is a distinct value
21. Which of the following operations is associative
22. The process of replacing a nested query with a query with a join is known as _________
23. If on every legal database instant, the two expressions generate the same set of tuples, the expressions are called as
24. A selection of the form giving all the records not satisfying simple individual conditions is ______
25. State true or false: Estimation of the size of the result of a join is not possible