RelationalDBDesign
SiteMap
Advanced Tuning
SQL Tuning
Perform Tuning
Tuning Instance
Tuning Basics
External Environment
Index Enhancements
«Prev
Next»
Performance Tuning
Optimizer and Query
Oracle Optimizer Functions
Optimizer Characteristics
Using Stored Outlines
DBMS_STATS Package
Statistics Package
Monitoring DB Operations
Examine Stats
Materialized Views
What are materialized Views
Materialized View Syntax
Summary Data Joins
Index Materialized View
Oracle Handling Invalidation
Query Rewriting Conditions
Explain Plan Command
Managing MV
MV Conclusion
Index Enhancements
Index Types Review
Create Descending index
Oracle bitmapped Index
Create Reverse Index
Creating Statistics
Understanding Domain Indexing
Rebuilding Defragmenting indexes
Function Based indexing
Creating Function-based-index
Index Category Conclusion
Index Organized Tables
index Organized Table
Create IOT Ttable
Bridge Primary Keys
Rebuild Index
Create Secondary Indexes
IOT vs. Regular Tables
IOT Table Conclusion
Advanced Queuing
What is Advanced Queuing
Data Dictionary Views
PL/SQL Applications for Queuing
Developing Advanced Queuing Apps
Developing PL/SQL Apps for Enqueuing
Developing Appslications-dequeuing
PL/SQL Propagation Functionality
Run Queuing Apps
Advanced Queuing Conclusion
Managing LOB
Lob Data Types
Selecting Lob Storage
Converting long to LOB
Managing Lob Size
Large Varrays Lobs
Temporary Lobs
Buffering Lobs
Lob Storage Conclusion
Computing Statistics - Quiz
Each question is worth one point. Select the best answer or answers for each question.
1.
When can you compute statistics on an index?
Please select all the correct answers.
A.
When you perform maintenance operations
B.
When you create the index
C.
At any time using
DBMS_STATS
or legacy
ANALYZE
command
D.
Only when the database is not operating
2.
Which two conditions commonly lead to right-edge hot block contention or leaf block sparsity in a B-tree index?
Please select all the correct answers.
A.
The index uses a value that increases sequentially over time
B.
The index uses a character value for the index key
C.
The index is defined on multiple columns
D.
Earlier values in the underlying table are deleted over time, leaving sparse leaf blocks
3.
What is a good reason to use a descending index?
Please select the best answer.
A.
The index is in danger of becoming unbalanced over time.
B.
Common queries require the data in the associated table to return rows with a value in descending order.
C.
It is easier to compute statistics on a descending index.
D.
You must have an equal number of ascending and descending indexes on a table.