RE: What is the diff b/w BTREE INDEX and BITMAP INDEX
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.
RE: What is the diff b/w BTREE INDEX and BITMAP INDEX
b-tree indexes are used for high cardinaties usuall when we have too many distinct columns. and bitmap indexex are used for low cardinaties usuallywhen we have repeated columns
RE: What is the diff b/w BTREE INDEX and BITMAP INDEX
b-tree indexes are used usuall when we have too many distinct columns and for high cardinaties . and bitmap indexex are used for low cardinaties usually when we have repeated columns.
RE: What is the diff b/w BTREE INDEX and BITMAP INDEX
Difference Between B-Tree Index & Bitmap Index.
1. B-tree Index has low cardinality values where as Bitmap Index has High Cardinality values. 2. B-tree Index is userful for OLTP where as Bitmap Index is useful for Dataware Housing. 3. B-tree index updates on key values has relatively inexpensive where as Bitmap index has more expensive.
RE: What is the diff b/w BTREE INDEX and BITMAP INDEX
Btree Index is very usefull for OLTP and BITMAP index are useful for Decision Support System. When OLTP environment higly level DML activites where doing and it is better to use Btree indexes is better than Bitmap indexes. Where as BITMAP indexes is better for Decision support System because there will be few distinct values.
RE: What is the diff b/w BTREE INDEX and BITMAP INDEX
Bitmap index: ------------ A type of index that uses a string of bits to quickly locate rows in a table. Bitmap indexes are normally used to index low cardinality columns in a warehouse environment.
Btree index: ------------ A type of index that uses a balanced tree structure for efficient record retrieval. B-tree indexes store key data in ascending or descending order.
