Home > Databases > Quizzes > DBMS Basics Practice Test: Query Processing Techniques
DBMS Basics Practice Test: Query Processing Techniques
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 74% Most missed: “Tuples are generated ___________ in producer-driven pipelining, they are generat…”
Quiz questions on query processing and optimization techniques, selection, sort and join operations, relational expressions and materialized views. A DBMS processes queries in three phases: Parsing: Checks syntax Optimization: Finds efficient plan Execution: Retrieves and manipulates data  Here are some query processing techniques in a DBMS: Optimization: The DBMS chooses the most efficient plan to retrieve data from the database. This reduces system overhead and improves performance. Query evaluation: The query processer and optimizer translates a user query into an efficient program... Show more
DBMS Basics Practice Test: Query Processing Techniques
Time left 00:00
25 Questions

1. Consider a schema R(A, B, C, D) and functional dependencies A -> B and C -> D. Then the decomposition of R into R1 (A, B) and R2(C, D) is
2. If the state of the database no longer reflects a real state of the world that the database is supposed to capture, then such a state is called
3. Which of the following schemas does define a view or views of the database for particular users?
4. Which are the join types in join condition:
5. A collection of data designed to be used by different people is called a/an
6. The ___ algorithm scans each index for pointers to tuples that satisfy an individual condition.
7. Which global variables can be used to determine if a transaction is still open?
8. Which statement is used to define a cursor?
9. The complexity of Binary search algorithm is
10. The relationship between DEPARTMENT and EMPLOYEE is a
11. Which view that contains more than one table in the top-level FROM clause of the SELECT statement:
12. ______________ allows the algorithm to execute more quickly by performing CPU activity in parallel with I/O activity.
13. ___________ refers to the ability of the system to recover committed transaction updates if either the system or the storage media fails.
14. You have a column that will only contain values from 0 to 256. What is the most economical data type to use for the column?
15. Which of the following statements is/are not true for SQL profiler?
16. Which of the following is an attribute that can uniquely identify a row in a table?
17. The space factor when determining the efficiency of an algorithm is measured by
18. Relation R with an associated set of functional dependencies, F, is decomposed into BCNF. The redundancy (arising out of functional dependencies) in the resulting set of relations is
19. Capabilities of RAISERROR
20. Which of the following case does not exist in complexity theory
21. Which one of the following statements about normal forms is FALSE?
22. The Worst case occur in linear search algorithm when
23. We use ______________ name PL/SQL program objects and units.
24. Search algorithms that use an index are referred to as
25. The algorithm that uses a secondary ordered index to guide retrieval for comparison conditions involving <,≤,≥, or > is