One of the good things about Oracle is that it is based on the solid foundation of Oracle9 and Oracle8. Most of the improvements to
the basic indexing capabilities of Oracle are not brand-new features, but refinements of existing capabilities.
Nonetheless, these refinements can result in significant performance improvements in some situations.
In this module, you learned about enhancements to Oracle’s indexes, including how to:
- Describe the types of indexes that can be created in Oracle
- Create a descending index
- Describe the bitmap index improvements of Oracle
- Create a reverse index
- Describe two methods of creating statistics
- Describe the new Oracle feature of domain indexes
- Use the
ONLINE parameter for indexes
- Define function-based indexing
- Create a function-based index
The following term was defined in this module:
- B* tree: An index made up of a number of levels of leaf nodes. Each leaf node contains a range of values and pointers to a more detailed leaf node. The lowest leaf node points to a page of index values and the ROWIDs of the rows associated with them.
- Bitwise comparison: A situation where the Oracle database compares two values bit by bit, instead of character by character (also known as byte by byte).
In the next module, you will learn about index-organized tables.