Bit map indexes are used on low-cardinality columns(having low distinct values) 2.B-tree indexes are most effective for high-cardinality data(only for unique columns)
B-tree indexes cannot be used in environments typically have large amounts of data and ad hoc queries
bitmap indexes can be created on partitioned tables