What is the difference between Binary Tree (B-TREE) INDEX and BITMAP INDEX

[dtech-team]

.

[dtech-team]

Bitmap indexes are more advantageous than b-tree indexes when the table has millions of rows and the key columns have low cardinality.

Bitmap indexes provide better performance than b tree indexes when queries often use a combination of multiple where conditions involving the OR operator, the table is read-only, or when there is low update activity on the key columns.


Read more about both : http://www.oraclepassport.com/OracleIndex.html