List down the Differences between bitmap and btree index?

Internally, a bitmap and a btree indexes are very different, but functionally they are identical in that they serve to assist Oracle in retrieving rows faster than a full-table scan. The basic differences between b-tree and bitmap indexes include:
1: Syntax differences: The bitmap index includes the “bitmap” keyword. The btree index does not say “bitmap”.
2: Cardinality differences: The bitmap index is generally for columns with lots of duplicate values (low cardinality), while b-tree indexes are best for high cardinality columns.
3: Internal structure differences: The internal structures are quite different. A b-tree index has index nodes (based on data block size), it a tree form:

Asked on May 30, 2017 in ETL.
Add Comment
0 Answer(s)

Your Answer

By posting your answer, you agree to the privacy policy and terms of service.