Home > Databases > Quizzes > RDBMS Basics Practice Test: Query Processing and Optimization
RDBMS Basics Practice Test: Query Processing and Optimization
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 58% Most missed: “Sorting of relations that do not fit in memory is called as _______”
Quiz questions on query processing, join operations, expressions evaluation, relational expressions, evaluation plans and materialized views. Query processing and optimization are essential steps to ensure the efficiency and reliability of a relational database management system (RDBMS). Query processing is the process of translating a user query into an executable form that can be used to retrieve results from a database. Query optimization is the process of constructing a query evaluation plan that minimizes the cost of query evaluation.  Query processing and optimization can improve... Show more
RDBMS Basics Practice Test: Query Processing and Optimization
Time left 00:00
25 Questions

1. Which of the following is a multi-query optimization technique
2. The union of all records satisfying the individual simple conditions Oi is called as ________
3. The ___________ merges the sorted relation with leaf entries of the secondary B+ tree index.
4. The process of replacing a nested query with a query with a join is known as _________
5. The splitting of input until each partition of the build input fits the memory is called as ______
6. A selection of the form giving all the records not satisfying simple individual conditions is ______
7. Which of the following is a type of materialized view management?
8. The result of each intermediate operation are created and then are used for valuation of the next level operations, this evaluation is called as ________
9. If a query is optimized without providing specific values for its parameters the technique is called __________
10. A selection of the form satisfying the intersection of all records satisfying individual simple conditions is
11. for each tuple tr in r do begin
FOR each tuple ts IN s do BEGIN
test pair
(tr , ts
) TO see IF they satisfy the JOIN condition _
END
What type of join is this?
12. Which of the following information does the database system catalog store?
13. Search algorithms that use an index are referred to as _________
14. Join is an inherently blocking operation
15. The problem of an update affecting the execution of a query associated with the update is known as the _________
16. What kind of a sample must be used for statistical analysis?
17. If no rule can be derived from any combination of others then the set of rules is said to be ________
18. What are differentials in view management?
19. Which of the following joins preserves the tuples of the relation on the left side of the operator?
20. Which of the following set operations does the selection operation distribute over?
21. Reducing the complexity of complex queries by similarly handling sub-queries is known as ______
22. A relational algebra operation annotated with instructions on how to evaluate it is called _______
23. The rule that allows transformation of a logical operation to a physical operation is called
24. Caching and reuse of query plans is called as ________
25. The size of a _____ is simply V(A,r) where r is the relation and A is a distinct value