The difference between a bitmap index and a b-tree index in Oracle

1, the applicable system is different: Bitmap index is suitable for OLAP system, and B-tree index is suitable for OLTP system.

2, occupy different storage space: Bitmap index requires only a small amount of storage space, and the B-tree index needs to occupy a lot of storage space.

3. The time required for creation is different: Bitmap indexing is created quickly, and B-tree index creation is time consuming.

4, DML operations affect the size of different: The bitmap index is only suitable for large queries, update, INSERT, delete will have a negative impact, and the B-tree index is suitable for frequent DML operations.

5. The query scope is different: The bitmap index is suitable for the table with high data repetition rate, and can efficiently execute the query and count of the logical query containing and,or or XOR, null. Null values are also indexed when the bitmap is indexed, and the B-tree index does not fit.

The difference between a bitmap index and a b-tree index in Oracle