Oracle Index classification

I saw a post on the itpub forum and summarized the Oracle Index classification in a concise manner. So I added it to my favorites. I have been reading RAC recently, and I just added a bit of reverse indexing.

Logically:
Single Column Index
Concatenated multi-column Index
Unique unique index
Nonunique non-unique index
Function-based Function Index
Domain domain index

Physically:
Partitioned partition Index
Nonpartitioned non-partition Index
B-tree:
Normal B-type tree
Rever key reverse B-tree
Bitmap bitmap Index

Index Structure:

B-tree:
Suitable for a large number of addition, deletion, and modification (OLTP );
Queries that contain the OR operator cannot be used;
Suitable for columns with a high base (multiple unique values)
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:
Suitable for 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)
Each bit of Bitmap 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;

Reverse B-tree:
Applicable to Ops or RAC environments;
The bytes in each column of the index code are reversed to reduce the contention for index leaf blocks;
Reference http://www.stcore.com/oracle/2006-06-15/1150309026d27150.html