Oracle index type

Oracle indexes are an important concept in Oracle. Here we will discuss the Oracle Index classification for your reference. If you are interested in Oracle indexes, take a look.

Logically:
Single column Single Row Index
Concatenated multi-row Index
Unique index
NonUnique non-unique index
Function-based Function Index
Domain index

Physically:
Partitioned partition Index
NonPartitioned non-partition Index
B-tree:
Normal B-type tree
Rever Key reverse B-tree
Bitmap Index

Index Structure:
B-tree:
Suitable for large numbers of additions, deletions, and changes to OLTP );
Queries that contain the OR operator cannot be used;
Suitable for columns with multiple unique values with a high base)
Typical tree structure;
Each node is a data block;
Most of them are physical, two or three layers, but logical;
The leaf block data is sorted, increasing from left to right;
The range of the index is placed in the branch block and the root block;
Bitmap:
Applicable and decision support systems;
The UPDATE cost is very high;
It is very suitable for OR operator queries;
Bitmap indexes can be created only when the base number is small;
Tree Structure:
Index Header
Start ROWID, end ROWID first list the maximum range of the index)
BITMAP
Each BIT corresponds to a ROWID. Its value is 1 or 0. If it is 1, it indicates that the ROWID corresponding to the BIT has a value;

B * tree indexes are generally applicable when accessing small data volumes. For example, if you access a table with no more than 5% data, this is only a relative ratio and is applicable to general situations. Bitmap is used in data warehouses for low-base columns, such as fields with many duplicate values such as gender. The smaller the base, the better.
 

How to create an Oracle Index

Introduction to Oracle index creation policies

Master talk about Oracle index Scanning

Oracle indexing principles

Procedure