Deck 11: Database Performance Tuning and Query Optimization
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/82
Play
Full screen (f)
Deck 11: Database Performance Tuning and Query Optimization
1
Using index characteristics,a database designer can determine the best type of index to use.
True
2
The purpose of an I/O operation is to move data to and from different computer components or devices.
True
3
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.
True
4
To work with data,the DBMS must retrieve the data from permanent storage and place it in RAM.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
5
The primary factor in determining the most efficient access plan is the I/O cost.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
6
DBMS implementations are typically similar in complexity to two-tier client/server configurations.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
7
Indexes do not facilitate join operations.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
8
A data file can contain rows from a single table alone.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
9
The SQL execution activities are performed by the query optimizer.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
10
A cost-based optimizer uses a set of preset rules and points to determine the best approach to execute a query.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
11
Most current-generation relational DBMSs perform automatic query optimization at the client end.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
12
One of the main functions of a database system is to provide timely answers to end users.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
13
All transaction management commands are processed during the parsing and execution phases of query processing.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
14
Good database performance is easy to evaluate.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
15
The data cache caches system catalog data and the contents of the indexes.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
16
Fully equivalent means that the optimized query results are always the same as the original query.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
17
Good database performance starts with good database design.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
18
The SQL cache stores the end-user written SQL.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
19
An index scan is less efficient than a full table scan.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
20
Working with data in the data cache is many times faster than working with data in the data files.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
21
Character field comparisons are faster than numeric,date,and NULL comparisons.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
22
The DBMS the SQL query and chooses the most efficient access/execution plan.
A)parses
B)executes
C)fetches
D)processes
A)parses
B)executes
C)fetches
D)processes
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
23
Maximizing disk contention is one of the general recommendations for the physical storage of databases.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
24
To work with data,a DBMS must retrieve the data from and place them in .
A)data files; procedure cache
B)RAM; data cache
C)permanent storage; RAM
D)temporary files; procedure cache
A)data files; procedure cache
B)RAM; data cache
C)permanent storage; RAM
D)temporary files; procedure cache
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
25
A system table space,a user data table space,an index table space,and a temporary table space are examples of _____.
A)procedure caches
B)file groups
C)data caches
D)operation modes
A)procedure caches
B)file groups
C)data caches
D)operation modes
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
26
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.
A)client SQL
B)database SQL
C)SQL performance
D)DBMS performance
A)client SQL
B)database SQL
C)SQL performance
D)DBMS performance
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
27
A(n)is a logical grouping of several data files that store data with similar characteristics.
A)procedure cache
B)table space
C)data cache
D)listener
A)procedure cache
B)table space
C)data cache
D)listener
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
28
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.
A)after; before
B)after; after
C)before; before
D)before; after
A)after; before
B)after; after
C)before; before
D)before; after
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
29
Indexes are very useful in small tables or tables with low sparsity.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
30
When moving data from permanent storage to RAM,an I/O disk operation retrieves:
A)an entire table.
B)an entire physical disk block.
C)only the row containing the attribute requested.
D)only the attribute which was requested.
A)an entire table.
B)an entire physical disk block.
C)only the row containing the attribute requested.
D)only the attribute which was requested.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
31
The process analyzes SQL queries and finds the most efficient way to access data.
A)optimizer
B)scheduler
C)listener
D)user
A)optimizer
B)scheduler
C)listener
D)user
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
32
The data cache or is a shared,reserved memory area that stores the most recently accessed data blocks in RAM.
A)buffer cache
B)procedure cache
C)SQL cache
D)permanent storage
A)buffer cache
B)procedure cache
C)SQL cache
D)permanent storage
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
33
DBMS performance tuning includes global tasks such as managing the DBMS processes in primary memory and managing the structures in physical storage.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
34
RAID systems use a single disk to create storage volumes.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
35
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.
A)client and server
B)database SQL
C)SQL performance
D)DBMS performance
A)client and server
B)database SQL
C)SQL performance
D)DBMS performance
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
36
To generate database object statistics manually,following syntax should be used in Oracle: .
A)ANALYZE object_name;
B)CREATE
object_name;
C)ANALYZE
object_name COMPUTE STATISTICS;
D)CREATE
object_name COMPUTE STATISTICS;
A)ANALYZE object_name;
B)CREATE
C)ANALYZE
D)CREATE
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
37
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 .
A)procedure cache
B)buffer cache
C)supplements
D)extends
A)procedure cache
B)buffer cache
C)supplements
D)extends
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
38
Automatic query optimization means that the:
A)optimization takes place at compilation time by the programmer.
B)DBMS finds the most cost-effective access path without user intervention.
C)optimization process is scheduled and selected by the end user or programmer.
D)database access strategy is defined when the program is executed.
A)optimization takes place at compilation time by the programmer.
B)DBMS finds the most cost-effective access path without user intervention.
C)optimization process is scheduled and selected by the end user or programmer.
D)database access strategy is defined when the program is executed.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
39
In-memory database systems are optimized to store small portions of the database in disk storage alone.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
40
The is a shared,reserved memory area that stores the most recently executed SQL statements or PL/SQL procedures,including triggers and functions.
A)buffer cache
B)procedure cache
C)data cache
D)permanent storage
A)buffer cache
B)procedure cache
C)data cache
D)permanent storage
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
41
The must be set large enough to permit as many data requests to be serviced from cache as possible.
A)data cache
B)SQL cache
C)sort cache
D)optimizer mode
A)data cache
B)SQL cache
C)sort cache
D)optimizer mode
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
42
From the performance point of view,databases eliminate disk access bottlenecks.
A)RAID
B)distributed
C)index-organized
D)in-memory
A)RAID
B)distributed
C)index-organized
D)in-memory
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
43
If there is no index,the DBMS will perform a scan.
A)loop
B)range
C)row ID table access
D)full table
A)loop
B)range
C)row ID table access
D)full table
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
44
The table space is used for transaction-recovery purposes.
A)system
B)user data
C)temporary
D)rollback segment
A)system
B)user data
C)temporary
D)rollback segment
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
45
The majority of primary memory resources will be allocated to the cache.
A)data
B)SQL
C)sort
D)optimizer
A)data
B)SQL
C)sort
D)optimizer
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
46
In standard SQL,the optimizer hint ALL_ROWS is generally used for mode processes.
A)interactive
B)real-time
C)batch
D)transaction
A)interactive
B)real-time
C)batch
D)transaction
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
47
The DBMS the data and sends the result set back to the client.
A)parses
B)executes
C)fetches
D)processes
A)parses
B)executes
C)fetches
D)processes
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
48
In RAID level 5,:
A)the data and the parity data are striped across separate drives.
B)the data blocks are spread over separate drives and are duplicated.
C)the array requires a minimum of two drives and is known as a striped array.
D)the array requires a minimum of five drives and is known as duplexing.
A)the data and the parity data are striped across separate drives.
B)the data blocks are spread over separate drives and are duplicated.
C)the array requires a minimum of two drives and is known as a striped array.
D)the array requires a minimum of five drives and is known as duplexing.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
49
In standard SQL,the optimizer hint FIRST_ROWS is generally used for mode processes.
A)batch
B)interactive
C)transaction
D)real-time
A)batch
B)interactive
C)transaction
D)real-time
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
50
is the central activity during the parsing phase in query processing.
A)Clustering
B)Partitioning
C)Query validation
D)Query optimization
A)Clustering
B)Partitioning
C)Query validation
D)Query optimization
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
51
Knowing the sparsity of a column helps you decide whether the use of is appropriate.
A)query processing
B)query optimization
C)an index
D)a full table scan
A)query processing
B)query optimization
C)an index
D)a full table scan
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
52
Bitmap indexes tend to use less space than a because they use bits instead of bytes to store their data.
A)hash index
B)sparse index
C)B-tree index
D)reverse index
A)hash index
B)sparse index
C)B-tree index
D)reverse index
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
53
Which of the following is the first step of query processing at the DBMS server end?
A)Executing
B)Parsing
C)Fetching
D)Delivering
A)Executing
B)Parsing
C)Fetching
D)Delivering
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
54
In the context of RAID levels,refers to writing the same data blocks to separate drives.
A)striping
B)mirroring
C)partitioning
D)aggregating
A)striping
B)mirroring
C)partitioning
D)aggregating
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
55
The table space is used to store the data dictionary tables.
A)system
B)user data
C)temporary
D)rollback segment
A)system
B)user data
C)temporary
D)rollback segment
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
56
refers to the number of different values a column could possibly have.
A)Database statistics
B)Data sparsity
C)A bitmap index
D)Clustering
A)Database statistics
B)Data sparsity
C)A bitmap index
D)Clustering
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
57
The LIKE conditional operator is used by the OPERAND1.
A)P_PRICE
B)V_STATE
C)P_QOH
D)V_CONTACT
A)P_PRICE
B)V_STATE
C)P_QOH
D)V_CONTACT
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
58
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.
A)ALL_ROWS
B)FIRST_ROWS
C)INDEX(P_QOH_NDX)
D)OPTIMIZATION_ROWS
A)ALL_ROWS
B)FIRST_ROWS
C)INDEX(P_QOH_NDX)
D)OPTIMIZATION_ROWS
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
59
The cache is used as a temporary storage area for ORDER BY or GROUP BY operations,as well as for index-creation functions.
A)data
B)SQL
C)sort
D)optimizer
A)data
B)SQL
C)sort
D)optimizer
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
60
In the context of RAID levels,striped arrays provide:
A)increased read performance and fault tolerance.
A)increased read performance but no fault tolerance.
B)increased fault tolerance but decreased performance.
D)neither fault tolerance nor good performance.
A)increased read performance and fault tolerance.
A)increased read performance but no fault tolerance.
B)increased fault tolerance but decreased performance.
D)neither fault tolerance nor good performance.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
61
The analyzes the SQL query and finds the most efficient way to access the data.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
62
DBMS query processing has phases.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
63
_________is evaluated based on client perspective.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
64
List and describe some typical DBMS processes.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
65
Describe query optimization and the modes that an optimizer can operate in.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
66
The table space is the most frequently accessed table space and should be stored in its own volume.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
67
End users and the DBMS interact through the use of to generate information.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
68
A (n)____ is an index based on a specific SQL function or expression.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
69
How can queries be written to perform the fastest when equality and inequality comparisons are needed?
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
70
helps provide a balance between performance and fault tolerance.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
71
A(n)request is a low-level read or write data access operation to or from computer devices.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
72
Why do we need to optimize a DBMS with SQL performance tuning,even though they automatically optimize SQL queries?
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
73
Once an SQL statement is transformed,the DBMS creates what is commonly known as a(n)plan.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
74
A conditional expression is normally expressed within the or HAVING clauses of a SQL statement.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
75
A is good for simple and fast lookup operations based on equality conditions.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
76
is another name for table space.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
77
A system will perform best when its hardware and software resources are .
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
78
Database activities can be divided into those taking place either on the client side or on the server side.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
79
is a measure of the likelihood that an index will be used in query processing.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck
80
are ordered sets of values that are crucial in speeding up data access.
Unlock Deck
Unlock for access to all 82 flashcards in this deck.
Unlock Deck
k this deck