The document provides an overview of query processing concepts including query cost measures, optimization techniques, and various operations such as selection, sorting, and joining. It includes a series of questions and answers related to these topics, covering aspects like cost-based optimizers, materialized views, and expression transformations. The content serves as a quiz format to test knowledge on relational database operations and optimization strategies.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
28 views
CSE+DBMS_UNIT_III
The document provides an overview of query processing concepts including query cost measures, optimization techniques, and various operations such as selection, sorting, and joining. It includes a series of questions and answers related to these topics, covering aspects like cost-based optimizers, materialized views, and expression transformations. The content serves as a quiz format to test knowledge on relational database operations and optimization strategies.
of expressions, transformation of relational expressions, estimating statistics of expression results,
evaluation plans, materialized views.
Sr. No. Question Options Answer
1. A ________ explores the a. Cost based optimizer a. Cost based space of all query evaluation b. b. Space based optimizer plans that are equivalent to a optimizer given query. c. c. Time based optimizer d. d. None of the mentioned 2. In query processing, the a. Index Search b. Linear search ___________ is the lowest- b. Linear search level operator to access data. c. File scan d. Access paths 3. Which oracle is the join a. Oracle 9i c.Pre-oracle 9i condition is specified using the b. Oracle 8i WHERE clause: c. Pre-oracle 9i d. Pre-oracle 8i 4. Which are the join types in a. Cross join d. All of the join condition: b. Natural join mentioned c. Join with USING clause d. All of the mentioned 5. ___________ combines the a. PL/SQL a. PL/SQL data manipulating power of b. SQL SQL with the data processing c. Advanced SQL power of Procedural d. PQL languages. 6. What is the disadvantage of a. It is too expensive a. It is too expensive cost-based optimizers? b. It is inefficient in producing results c. It does not perform the desired function d. None of the mentioned 7. The rule that allows the a. Logical equivalence rule b. Physical transformation of a logical b. Physical equivalence equivalence rule operation to a physical rule operation is called ----- c. Memory equivalence rule d. None of the mentioned 8. Size estimation can be done a. Projection d. All of the for which of the following b. Aggregation mentioned processes? c. Set operation d. All of the mentioned 9. If the results of one operation a. Chain b. Pipeline are passed on to the other, it b. Pipeline is called as _____ c. Materialized d. Tree 10. Which feature converts row a. Views c. Pivot data to a column for better b. Join analytical view? c. Pivot d. Trigger 11. What is the disadvantage of a. It is too expensive a. It is too expensive cost-based optimizers? b. It is inefficient in producing results c. It does not perform the desired function d. None of the mentioned 12. The process of finding a good a. Query optimization a. Query strategy for processing a b. Query processing optimization query is called c. Query management d. Query cost 13. The modification to a relation a. Moderator a. Differential or expression is referred to as b. Change its c. Alterations d. differential 14. The operations of Natural-join a. Commutative b. associative are b. Associative c. Distributive d. conjunctive 15. The iterator operation of a a. open() d.all of the above demand driven pipeline b. next() provides the function of c. close() d. all of the above 16. Incremental view a. Materialized views a. Materialized maintenance is needed to b. Relational views views efficiently update c. Rational views d. Query views 17. Materialized views constitute a. Linear data d.redundant data b. Uniform data c. Unique data d. Redundant data 18. Advanced optimization a. Top-K optimization d.all of the above techniques include b. Join minimization optimization of updates, c. Parametric query multiquery optimization and optimization d. All of the above 19. The optimizer that explores a. Cost-based a.Cost-based the space of all query- b. Plan-based evaluation plans is called c. Estimate-based d. Count-based 20. The complex queries a. Disk accesses a.Disk accesses evaluation plan involves many b. Sector accesses c. Parameters d. Differentials 21. The process of replacement of a. Correlation b.Decorrelation a nested query by a query b. Decorrelation with a join is called c. Materialization d. Non-materialization 22. The technique chosen by the a. Relation c.Both a & b database system for b. Distributed columns evaluation of an operation c. Both a & b depends on the size of d. Distribution of tuples 23. Each relational algebra a. Parameters c.Operatins expression represents a b. Differentials particular sequence of c. Operations d. routines 24. The operations of theta-join a. distributive c.Commutative are b. conjunctive c. commutative d. associative 25. Keeping a materialized view a. deferred maintenance c.View maintenance up-to-date with respect to the b. immediate underlying data is known as maintenance c. view maintenance d. data maintenance 26. Modern database system a. incremental view a.Incremental view provides more direct support maintenance maintenance for b. data view maintenance c. deferred view maintenance d. immediate view maintenance 27. The two expression generates a. Dependent c.Equivalent the same set of tuples on b. Independent every legal database instance, c. Equivalent the relational are said to be d. Non-equivalent 28. Materialized views are used to a. Query optimization b.Query processing speed up b. Query processing c. Query management d. Query cost 29. Optimizers use __________ to a. Analyzers c.Heuristic reduce the cost of b. Statistics optimization. c. Heuristics d. Caches 30. The join orders where the a. Right deep join orders b. Left deep join right operand of each join is in b. Left deep join orders orders one of the initial relations are c. Outer join orders called as ________ d. None of the mentioned