Query Processing

1. What is the main goal of query processing?

a) Translate a high-level query into an efficient execution strategy
b) Store queries for later execution
c) Encrypt query results
d) Convert SQL into machine code
Answer: a) Translate a high-level query into an efficient execution strategy
Explanation: Query processing involves steps to convert a high-level SQL query into a
low-level executable form for efficient execution.
2. Which step is responsible for checking SQL syntax?
a) Query Optimization
b) Query Execution
c) Parsing and Translation
d) Query Retrieval
Answer: c) Parsing and Translation
Explanation: The SQL query is checked for syntax and semantics in this step before
being converted into an internal representation.
3. Which component identifies SQL keywords in a query?
a) Query Optimizer
b) Scanner
c) Code Generator
d) Execution Engine
Answer: b) Scanner
Explanation: The scanner identifies SQL keywords, attribute names, and relation names.
4. What happens after a query is validated?
a) The database schema is updated
b) The query is optimized for execution
c) The query is executed immediately
d) The query is translated into a natural language
Answer: b) The query is optimized for execution
Explanation: After validation, the database system optimizes the query to improve
performance.

Query Optimization

5. Which of the following is a primary goal of query optimization?

a) Increase query complexity
b) Minimize resource usage
c) Eliminate SQL commands
d) Improve database indexing
Answer: b) Minimize resource usage
Explanation: Query optimization aims to choose an execution strategy that reduces
response time and resource consumption.
 6. What is heuristic query optimization?
a) A rule-based optimization technique
b) A cost-based optimization technique
c) A machine learning technique
d) A method to encrypt query execution
Answer: a) A rule-based optimization technique
Explanation: Heuristic optimization applies predefined transformation rules to improve
query execution.
7. In cost-based optimization, the DBMS evaluates execution plans based on:
a) Predefined transformation rules
b) Estimated execution cost
c) Query encryption level
d) User preferences
Answer: b) Estimated execution cost
Explanation: Cost-based optimization analyzes different query execution plans and
selects the most cost-effective one.
8. Which of the following is NOT a cost component in query execution?
a) Storage cost
b) Computation cost
c) Query encryption cost
d) Communication cost
Answer: c) Query encryption cost
Explanation: Query execution costs include access, storage, computation, memory, and
communication costs.

SQL Query Execution

9. What is a query execution plan?

a) A compiled SQL query
b) A sequence of operations to execute a query
c) A method to store queries in memory
d) A way to prevent SQL injection
Answer: b) A sequence of operations to execute a query
Explanation: An execution plan is a step-by-step strategy chosen by the optimizer for
query execution.
10. Which database component is responsible for executing the query plan?
a) Query Optimizer
b) Runtime Database Processor
c) Code Generator
d) Query Scanner
Answer: b) Runtime Database Processor
Explanation: The runtime database processor executes the query plan and handles
runtime errors.
Relational Algebra and Query Processing

11. What is a query block?

a) The basic unit of query optimization
b) A database storage unit
c) A table join condition
d) A constraint in a database
Answer: a) The basic unit of query optimization
Explanation: A query block contains a single SELECT-FROM-WHERE expression that
can be translated into relational algebra.
12. What does the relational algebra operator π (pi) represent?
a) Selection
b) Projection
c) Join
d) Union
Answer: b) Projection
Explanation: The π operator is used to select specific columns (attributes) from a
relation.
13. What does the relational algebra operator σ (sigma) represent?
a) Selection
b) Projection
c) Join
d) Cartesian product
Answer: a) Selection
Explanation: The σ operator is used to filter rows based on a condition.

Join Optimization

14. Which of the following is NOT a join optimization technique?

a) Nested loop join
b) Merge join
c) Hash join
d) Encryption join
Answer: d) Encryption join
Explanation: Encryption is not a join optimization method; the common join types are
nested loop, merge, and hash join.
15. Which join method is efficient when both tables are sorted?
a) Nested loop join
b) Merge join
c) Hash join
d) Cartesian join
 Answer: b) Merge join
Explanation: Merge join is effective when both tables are sorted on the join attribute.

Query Optimization Techniques

16. What is the purpose of selection pushdown?

a) Apply filtering conditions as early as possible
b) Delay filtering conditions until the last step
c) Increase the query execution time
d) Store intermediate query results
Answer: a) Apply filtering conditions as early as possible
Explanation: Selection pushdown reduces the number of rows processed by applying
selection conditions earlier.
17. What does projection pushdown aim to reduce?
a) The number of columns processed
b) The number of rows processed
c) The number of joins in a query
d) The execution plan complexity
Answer: a) The number of columns processed
Explanation: Projection pushdown eliminates unnecessary columns early in the
execution process.

Query Processing (Continued)

18. Which step checks if all attribute names are valid in a query?
a) Parsing
b) Optimization
c) Execution
d) Storage
Answer: a) Parsing
Explanation: Parsing ensures attribute names are valid and exist in the database schema.
19. What is the main role of the query optimizer?
a) Execute the query
b) Choose an efficient execution strategy
c) Store queries for future use
d) Convert SQL to machine code
Answer: b) Choose an efficient execution strategy
Explanation: The optimizer selects the best execution plan to reduce execution cost.
20. What is the benefit of indexing in query optimization?
a) Increases query response time
b) Reduces data redundancy
 c) Speeds up data retrieval
d) Eliminates foreign keys
Answer: c) Speeds up data retrieval
Explanation: Indexing helps locate data faster, reducing query execution time.

Query Execution and Optimization

21. What is the function of the code generator in query execution?

a) Translates optimized query into an executable format
b) Stores queries for future execution
c) Converts queries into machine language
d) Removes SQL syntax errors
Answer: a) Translates optimized query into an executable format
Explanation: The code generator prepares a query for execution after optimization.
22. How does the DBMS decide on an execution plan in cost-based optimization?
a) By using predefined transformation rules
b) By evaluating multiple execution plans and choosing the lowest cost
c) By always choosing an index scan
d) By converting the query into a relational algebra expression
Answer: b) By evaluating multiple execution plans and choosing the lowest cost
Explanation: Cost-based optimization selects the plan with the lowest estimated resource
usage.
23. What type of join is preferred for large datasets?
a) Nested loop join
b) Merge join
c) Hash join
d) Cross join
Answer: c) Hash join
Explanation: Hash join is efficient for handling large datasets by reducing the number of
comparisons.
24. How does normalization help in query processing?
a) It removes duplicate records
b) It speeds up indexing
c) It reduces redundancy and improves efficiency
d) It encrypts query results
Answer: c) It reduces redundancy and improves efficiency
Explanation: Normalization eliminates redundant data, making queries more efficient.

Query Decomposition and Cost Factors

25. What is the difference between logical and physical query plans?
a) Logical plan focuses on what data is needed, while physical plan focuses on how to
 retrieve it
b) Logical plan involves indexing, while physical plan involves joins
c) Logical plan is for storage, while physical plan is for execution
d) Logical plan runs faster than physical plan
Answer: a) Logical plan focuses on what data is needed, while physical plan focuses on
how to retrieve it
Explanation: Logical query plans describe the data needed, while physical query plans
detail execution methods.
26. Why is minimizing disk I/O important in query execution?
a) It reduces the time required for query execution
b) It improves database security
c) It increases the complexity of the query
d) It reduces the need for indexing
Answer: a) It reduces the time required for query execution
Explanation: Disk I/O is often the slowest operation, so reducing it speeds up query
performance.
27. How does query decomposition help in processing complex queries?
a) It breaks them into smaller, manageable subqueries
b) It removes SQL constraints
c) It converts queries into relational algebra expressions
d) It merges multiple queries into one
Answer: a) It breaks them into smaller, manageable subqueries
Explanation: Query decomposition simplifies processing by dividing complex queries
into smaller parts.

Query Optimization Techniques

28. What happens in the query simplification step?

a) The query is converted to SQL
b) Redundant expressions are removed
c) The query is executed immediately
d) The query is decomposed into subqueries
Answer: b) Redundant expressions are removed
Explanation: Query simplification eliminates unnecessary parts to improve efficiency.
29. What is the benefit of eliminating common sub-expressions in query processing?
a) Reduces the execution cost
b) Increases query complexity
c) Improves query security
d) Increases the number of joins
Answer: a) Reduces the execution cost
Explanation: Eliminating duplicate computations lowers processing time and resource
usage.
30. How does a distributed database handle query optimization differently?
a) By considering communication costs
 b) By eliminating indexing
c) By executing all queries in one location
d) By removing normalization
Answer: a) By considering communication costs
Explanation: Distributed databases optimize queries by minimizing data transfer
between locations.

Execution Plan and Query Performance

31. What is the role of the runtime database processor?

a) Executes the query plan
b) Optimizes query performance
c) Stores query results permanently
d) Converts SQL into relational algebra
Answer: a) Executes the query plan
Explanation: The runtime processor executes the optimized query and retrieves results.
32. What does a query plan contain?
a) A list of execution steps for the query
b) A list of SQL commands
c) A stored version of the query
d) A list of constraints on the database
Answer: a) A list of execution steps for the query
Explanation: A query plan outlines the steps the DBMS follows to execute a query
efficiently.
33. How does query validation improve database security?
a) By ensuring only valid queries are executed
b) By encrypting query results
c) By eliminating joins
d) By disabling user access
Answer: a) By ensuring only valid queries are executed
Explanation: Query validation checks syntax, semantics, and schema correctness,
preventing errors and security risks.

Advanced Optimization Techniques

34. What are the different types of query optimization techniques?

a) Heuristic and cost-based optimization
b) Static and dynamic execution
c) Joins and indexing
d) Relational and non-relational optimization
Answer: a) Heuristic and cost-based optimization
 Explanation: Query optimization can be rule-based (heuristic) or cost-based, depending
on the DBMS approach.
35. What is the significance of heuristic rules in query processing?
a) They apply general transformation rules to optimize queries
b) They increase query execution time
c) They eliminate query parsing
d) They execute queries without validation
Answer: a) They apply general transformation rules to optimize queries
Explanation: Heuristic rules simplify query execution by rearranging and restructuring
queries.

Final Questions

36. What happens if an SQL query fails the parsing step?

a) The query is rejected with an error message
b) The query is optimized
c) The query is automatically corrected
d) The query runs with default values
Answer: a) The query is rejected with an error message
Explanation: If a query contains syntax errors, it is not executed and must be corrected.
37. Why is join optimization crucial in database performance?
a) Joins are computationally expensive
b) Joins are the simplest part of a query
c) Joins increase query complexity
d) Joins reduce the need for indexing
Answer: a) Joins are computationally expensive
Explanation: Optimizing joins reduces execution time, especially for large datasets.
38. What is a full table scan, and when is it used?
a) Scans all rows in a table, used when no index is available
b) Joins all tables in a database
c) Scans only indexed rows
d) Scans foreign keys only
Answer: a) Scans all rows in a table, used when no index is available
Explanation: Full table scans are slow and used when indexing is not available.