Exam 11: Database Performance Tuning and Query Optimization

arrow
  • Select Tags
search iconSearch Question
flashcardsStudy Flashcards
  • Select Tags

How can queries be written to perform the fastest when equality and inequality comparisons are needed?

Free
(Essay)
4.8/5
(31)
Correct Answer:
Verified

Equality comparisons are generally faster than inequality comparisons.For example,P_PRICE = 10.00 is processed faster because the DBMS can do a direct search using the index in the column.If there are no exact matches,the condition is evaluated as false.However,if you use an inequality symbol (>,>=,<,<=),the DBMS must perform additional processing to complete the request,because there will almost always be more "greater than" or "less than" values in the index than "equal" values.With the exception of NULL,the slowest of all comparison operators is LIKE with wildcard symbols,as in V_CONTACT LIKE "%glo%".Also,using the "not equal" symbol (<>)yields slower searches,especially when the sparsity of the data is high-that is,when there are many more different values than there are equal values.

Fully equivalent means that the optimized query results are always the same as the original query.

Free
(True/False)
4.8/5
(37)
Correct Answer:
Verified

True

The ____________________ table space is the most frequently accessed table space and should be stored in its own volume.

Free
(Short Answer)
4.9/5
(32)
Correct Answer:
Verified

system

The data cache caches system catalog data and the contents of the indexes.

(True/False)
4.9/5
(31)

RAID systems use a single disk to create storage volumes.

(True/False)
4.9/5
(33)

Good database performance starts with good database design.

(True/False)
4.7/5
(40)

DBMS implementations are typically similar in complexity to two-tier client/server configurations.

(True/False)
4.8/5
(31)

The SQL execution activities are performed by the query optimizer.

(True/False)
4.7/5
(29)

The DBMS ____ the SQL query and chooses the most efficient access/execution plan.

(Multiple Choice)
4.9/5
(35)

Indexes are very useful in small tables or tables with low sparsity.

(True/False)
4.9/5
(39)

The purpose of an I/O operation is to move data to and from different computer components or devices.

(True/False)
4.9/5
(36)

The ____ table space is used as a temporary storage area for merge,sort,or set aggregate operations.

(Multiple Choice)
4.9/5
(28)

To work with the data,the DBMS must retrieve the data from the ____ and place it in the ____.

(Multiple Choice)
4.8/5
(28)

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 ____.

(Multiple Choice)
4.9/5
(28)

How should storage volumes be allocated for indexes,system,and high-usage tables?

(Essay)
4.8/5
(36)

A system table space,a user data table space,an index table space,and a temporary table space are examples of ____.

(Multiple Choice)
4.9/5
(28)

To work with data,the DBMS must retrieve the data from permanent storage and place it in RAM.

(True/False)
4.8/5
(41)

Most current-generation relational DBMSs perform automatic query optimization at the client end.

(True/False)
4.8/5
(30)

The ____ table space is used to store end-user data.

(Multiple Choice)
4.8/5
(40)

End users and the DBMS interact through the use of ____________________ to generate information.

(Short Answer)
4.9/5
(31)
Showing 1 - 20 of 70
close modal

Filters

  • Essay(0)
  • Multiple Choice(0)
  • Short Answer(0)
  • True False(0)
  • Matching(0)