Scribd
Upload
26 views

Final Exam DBMS2

This document discusses various database concepts related to query optimization and performance. It covers index types like B-tree and full text indexes, query optimization techniques like covering indexes and hints/directives, isolation levels, transactions, and architectural approaches like machine learning based and rule-based optimizers. It also mentions concepts like parallel execution, result caching, and conditional expressions.

Uploaded by

Marvin
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
26 views

Final Exam DBMS2

This document discusses various database concepts related to query optimization and performance. It covers index types like B-tree and full text indexes, query optimization techniques like covering indexes and hints/directives, isolation levels, transactions, and architectural approaches like machine learning based and rule-based optimizers. It also mentions concepts like parallel execution, result caching, and conditional expressions.

Uploaded by

Marvin
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

A. B-Tree Index B. Query optimization C. covering index D.

Hints and Directives


E. Machine Learning- F. Optimizer Mode Hint G. Table Hint H. Transaction
Based Optimizers
I. 1-Tier architecture J. conditional expression K. Analysis L. full text index
M. Implementation N. Join Hint O. Rule-Based Optimizer P. Result Cache Hint
Q. Dynamic Optimization R. Durability S. Isolation T. Index Hint
U. unique index V. Atomicity W. Commit Command X. Index
Y. Parallel Hint

1. It implicates identifying goals, demands eliciting, transforming facts, diagnosing issues related to the current
project, recommending positive building. K
2. Code writing requires applying various programming tools, languages to match the documented
specification. M
3. Are units or sequences of work accomplished in a logical order, whether in a manual fashion by a user or
automatically by some sort of a database program. H
4. is a separate data structure that stores a sorted list of keys (values) and pointers to the actual data. X
5. widely used data structure in database management systems (DBMS) to optimize the retrieval and
organization of data in a table. A
6. Database index that is designed to efficiently handle and optimize textual search queries on large amounts
of text data. L
7. It prevents duplicate values from being inserted into the indexed column(s). U
8. This allows the database system to retrieve all the necessary data directly from the index without having to
access the table's data rows. C
9. It refers to the process of improving the efficiency and execution speed of database queries. B
10. It may not consider all possible execution plans but can be faster in generating plans for simple queries. E
11. It lacks the sophistication of cost-based optimizers but can work well for simple queries. O
12. This approach can be more flexible but may incur some overhead. Q
13. This is useful when there's a need to override the optimizer's decisions for specific queries. D
14. You can provide hints that affect the choice of tables used in the query. G
15. You can specify which index to use for a particular table to speed up data retrieval. T
16. You can control the join order or method used by the optimizer. N
17. Some database systems allow you to set the optimizer mode for a specific query, overriding the default
mode. F
18. You can specify the degree of parallelism for a query to control parallel execution. Y.
19. You can instruct the optimizer to use the result cache for query results. P
20. Is a fundamental construct in programming and is used to make decisions and execute different code
blocks based on whether a condition is true or false. J

You might also like