Oracle Database - (Level|Height) Index statistics

Card Puncher Data Processing

About

The level is also known as the Height of a B Tree|index or the number of blocks required to go from the root block to the leaf block.

Blevel is the number of branch levels and differs from HEIGHT by one (It does not count the leaf block).

Most of B*Tree indexes will have a height of 2 or 3 even for millions of record. This means that it will take in general, two or three I/Os to find your key in the index which is not too bad.

How to

See the value

The height value can be found in the INDEX_STATS view after the index has been analyzed using the ANALYZE INDEX

VALIDATE STRUCTURE command.





Discover More
Card Puncher Data Processing
Oracle Database - (B|Balanced) Tree - BTree indexes

The implementation of btree index in the Oracle database. To get to the leaf block to retrieve the first row of a query of the form will take the same number of I/Os regardless of the...
Card Puncher Data Processing
Oracle Database - Blevel Index Statistics

Blevel is the number of branch levels in a Btree index and differs from HEIGHT by one. It does not count the leaf block. The value of BLEVEL is found in the normal dictionary tables such as...
Card Puncher Data Processing
Oracle Database - Index Statistics

Statistics on Index stored in the data dictionary : DBA_INDEXES DBA_IND_STATISTICS Default Index Values When Statistics Are Missing Index Statistic Default Value Used by Optimizer Levels ...



Share this page:
Follow us:
Task Runner