Quiz
CHAPTER 11: DATABASE PERFORMANCE TUNING AND QUERY OPTIMIZATION
Questions in this quiz (60)
11. One of the main functions of a database system is to provide timely answers to end users.
- ATrue
- BFalse
22. Good database performance is easy to evaluate
- ATrue
- BFalse
33. All factors must be checked to ensure that each system component operates at its optimum level and has sufficient resources to minimize the occurrence of bottlenecks.
- ATrue
- BFalse
44. Good database performance starts with good database design.
- ATrue
- BFalse
55. DBMS implementations are typically similar in complexity to two-tier client/server configurations.
- ATrue
- BFalse
66. A data file can contain rows from a single table alone.
- ATrue
- BFalse
77. The data cache caches system catalog data and the contents of the indexes.
- ATrue
- BFalse
88. The SQL cache stores the end-user written SQL.
- ATrue
- BFalse
99. To work with data, the DBMS must retrieve the data from permanent storage and place it in RAM.
- ATrue
- BFalse
1010. The purpose of an I/O operation is to move data to and from different computer components or devices.
- ATrue
- BFalse
1111. Working with data in the data cache is many times faster than working with data in the data files.
- ATrue
- BFalse
1212. Fully equivalent means that the optimized query results are always the same as the original query.
- ATrue
- BFalse
1313. The SQL execution activities are performed by the query optimizer.
- ATrue
- BFalse
1414. All transaction management commands are processed during the parsing and execution phases of query processing.
- ATrue
- BFalse
1515. An index scan is less efficient than a full table scan.
- ATrue
- BFalse
1616. Indexes do not facilitate join operations.
- ATrue
- BFalse
1717. Using index characteristics, a database designer can determine the best type of index to use.
- ATrue
- BFalse
1818. A cost-based optimizer uses a set of preset rules and points to determine the best approach to execute a query.
- ATrue
- BFalse
1919. The primary factor in determining the most efficient access plan is the I/O cost.
- ATrue
- BFalse
2020. Most current-generation relational DBMSs perform automatic query optimization at the client end.
- ATrue
- BFalse
21
21. Indexes are very useful in small tables or tables with low sparsity.- ATrue
- BFalse
2222. Character field comparisons are faster than numeric, date, and NULL comparisons
- ATrue
- BFalse
2323. In-memory database systems are optimized to store small portions of the database in disk storage alone
- ATrue
- BFalse
2424. DBMS performance tuning includes global tasks such as managing the DBMS processes in primary memory and managing the structures in physical storage.
- ATrue
- BFalse
2525. Maximizing disk contention is one of the general recommendations for the physical storage of databases.
- ATrue
- BFalse
2626. RAID systems use a single disk to create storage volumes.
- ATrue
- BFalse
2727. On the client side, the objective is to generate an SQL query that returns a correct answer in the least amount of time, using a minimum amount of resources at the server end. The activities required to achieve this goal are commonly referred to as tuning.
- Aa. client SQL
- Bb. database SQL
- Cc. SQL performance
- Dd. DBMS performance
2828. On the server side, the database environment must be properly configured to respond to clients' requests in the fastest way possible, while making optimum use of existing resources. The activities required to achieve this goal are commonly referred to as tuning.
- Aa. client and server
- Bb. database SQL
- Cc. SQL performance
- Dd. DBMS performance
2929. When moving data from permanent storage to RAM, an I/O disk operation retrieves:
- Aa. an entire table.
- Bb. an entire physical disk block.
- Cc. only the row containing the attribute requested.
- Dd. only the attribute which was requested.
3030. A DBA determines the initial size of the data files that make up the database; however, as required, the data files can automatically expand in predefined increments known as .
- Aa. procedure cache
- Bb. buffer cache
- Cc. supplements
- Dd. extends
3131. A(n) is a logical grouping of several data files that store data with similar characteristics.
- Aa. procedure cache
- Bb. table space
- Cc. data cache
- Dd. listener
3232. A system table space, a user data table space, an index table space, and a temporary table space are examples of _____.
- Aa. procedure caches
- Bb. file groups
- Cc. data caches
- Dd. operation modes
3333. The data cache is where the data read from the database data files are stored the data have been read or the data are written to the database data files.
- Aa. after; before
- Bb. after; after
- Cc. before; before
- Dd. before; after
3434. To work with data, a DBMS must retrieve the data from and place them in .
- Aa. data files; procedure cache
- Bb. RAM; data cache
- Cc. permanent storage; RAM
- Dd. temporary files; procedure cache
3535. The data cache or is a shared, reserved memory area that stores the most recently accessed data blocks in RAM.
- Aa. buffer cache
- Bb. procedure cache
- Cc. SQL cache
- Dd. permanent storage
36
36. The is a shared, reserved memory area that stores the most recently executed SQL statements or PL/SQL procedures, including triggers and functions.- Aa. buffer cache
- Bb. procedure cache
- Cc. data cache
- Dd. permanent storage
3737. The process analyzes SQL queries and finds the most efficient way to access data.
- Aa. optimizer
- Bb. scheduler
- Cc. listener
- Dd. user
3838. To generate database object statistics manually, following syntax should be used in Oracle: .
- Aa. ANALYZE <TABLE/INDEX> object_name;
- Bb. CREATE <TABLE/INDEX> object_name;
- Cc. ANALYZE <TABLE/INDEX> object_name COMPUTE STATISTICS;
- Dd. CREATE <TABLE/INDEX> object_name COMPUTE STATISTICS;
3939. Automatic query optimization means that the:
- Aa. optimization takes place at compilation time by the programmer.
- Bb. DBMS finds the most cost-effective access path without user intervention.
- Cc. optimization process is scheduled and selected by the end user or programmer.
- Dd. database access strategy is defined when the program is executed.
4040. The DBMS the SQL query and chooses the most efficient access/execution plan.
- Aa. parses
- Bb. executes
- Cc. fetches
- Dd. processes
4141. Which of the following is the first step of query processing at the DBMS server end?
- Aa. Executing
- Bb. Parsing
- Cc. Fetching
- Dd. Delivering
4242. The DBMS the data and sends the result set back to the client.
- Aa. parses
- Bb. executes
- Cc. fetches
- Dd. processes
4343. If there is no index, the DBMS will perform a scan.
- Aa. loop
- Bb. range
- Cc. row ID table access
- Dd. full table
4444. refers to the number of different values a column could possibly have.
- Aa. Database statistics
- Bb. Data sparsity
- Cc. A bitmap index
- Dd. Clustering
4545. Bitmap indexes tend to use less space than a because they use bits instead of bytes to store their data.
- Aa. hash index
- Bb. sparse index
- Cc. B-tree index
- Dd. reverse index
4646. Knowing the sparsity of a column helps you decide whether the use of is appropriate.
- Aa. query processing
- Bb. query optimization
- Cc. an index
- Dd. a full table scan
4747. is the central activity during the parsing phase in query processing.
- Aa. Clustering
- Bb. Partitioning
- Cc. Query validation
- Dd. Query optimization
4848. When setting optimizer hints, instructs the optimizer to minimize the overall execution time, that is, to minimize the time it takes to return the total number of rows in the query result set. This hint is generally used for batch mode processes.
- Aa. ALL_ROWS
- Bb. FIRST_ROWS
- Cc. INDEX(P_QOH_NDX)
- Dd. OPTIMIZATION_ROWS
4949. In standard SQL, the optimizer hint FIRST_ROWS is generally used for mode processes.
- Aa. batch
- Bb. interactive
- Cc. transaction
- Dd. real-time
5050. In standard SQL, the optimizer hint ALL_ROWS is generally used for mode processes.
- Aa. interactive
- Bb. real-time
- Cc. batch
- Dd. transaction
51
51. The LIKE conditional operator is used by the OPERAND1.- Aa. P_PRICE
- Bb. V_STATE
- Cc. P_QOH
- Dd. V_CONTACT
5252. The must be set large enough to permit as many data requests to be serviced from cache as possible.
- Aa. data cache
- Bb. SQL cache
- Cc. sort cache
- Dd. optimizer mode
5353. The majority of primary memory resources will be allocated to the cache.
- Aa. data
- Bb. SQL
- Cc. sort
- Dd. optimizer
5454. The cache is used as a temporary storage area for ORDER BY or GROUP BY operations, as well as for index-creation functions.
- Aa. data
- Bb. SQL
- Cc. sort
- Dd. optimizer
5555. From the performance point of view, databases eliminate disk access bottlenecks.
- Aa. RAID
- Bb. distributed
- Cc. index-organized
- Dd. in-memory
5656. The table space is used for transaction-recovery purposes.
- Aa. system
- Bb. user data
- Cc. temporary
- Dd. rollback segment
5757. In the context of RAID levels, refers to writing the same data blocks to separate drives.
- Aa. striping
- Bb. mirroring
- Cc. partitioning
- Dd. aggregating
5858. The table space is used to store the data dictionary tables.
- Aa. system
- Bb. user data
- Cc. temporary
- Dd. rollback segment
5959. In the context of RAID levels, striped arrays provide:
- Aa. increased read performance and fault tolerance.
- Bb. increased fault tolerance but decreased performance.
- Cc. increased read performance but no fault tolerance
- Dd. neither fault tolerance nor good performance.
6060. In RAID level 5,:
- Aa. the data and the parity data are striped across separate drives.
- Bb. the data blocks are spread over separate drives and are duplicated.
- Cc. the array requires a minimum of two drives and is known as a striped array.
- Dd. the array requires a minimum of five drives and is known as duplexing.
Information
- Description
- CIS 3365 Quiz on CHAPTER 11: DATABASE PERFORMANCE TUNING AND QUERY OPTIMIZATION, created by Miguel Lucero on 06/04/2017.
- Author
- Miguel Lucero
- Language
- English
- Views
- 1,766
- Tags
- Rating
- No ratings yet Rate this quiz