Descending indexes extend the functionality of a B*Tree index. They allow for a column to be stored sorted in descending…
Another feature of a BTree index is the ability to reverse its keys. At first, you might ask yourself, “Why…
One of the interesting things you can do with a B*Tree index is compress it. This is not compression in…
B*Tree—or what I call conventional—indexes are the most commonly used type of indexing structure in the database. They are similar…
Oracle provides many different types of indexes for us to use. Briefly, they are as follows: •\ BTree indexes: These…
Hopefully, after reading this chapter you have come to the conclusion that not all tables are created equal. Oracle provides…
The blockchain row retention clause controls when rows can be removed from the table.The syntax for the blockchain row retention…
We have already seen a partial example of an object table with nested tables. An object table is a table…
When performing direct path operations on a temporary table (where ON COMMIT PRESERVE ROWS is enabled), session-level statistics are gathered…
Oracle provides an internal PL/SQL package DBMS_BLOCKCHAIN_TABLE that can be used to perform the following: •\ Delete rows in a…