B-tree vs Bitmap index
B-tree vs bitmap index
=================
In this post i would like talk about index that to mainly b-tree vs bit man index.
Both are used to play key role in performance of query.
lets some comparison of both:-
B-tree:-
ON <table_name>(function(column_name));
Bitmap:-
syntax example:-
CREATE BITMAP INDEX
<index_name>
ON <table_name> (column_name);
still we can add on more points, but i want to hear from your side also.
so please post your opinion about index types in comment session.
=================
In this post i would like talk about index that to mainly b-tree vs bit man index.
Both are used to play key role in performance of query.
lets some comparison of both:-
B-tree:-
- it is one Default index, Like create index on one or columns using tree like structure.
- Cardinality is High, means less duplicate
- don`t confuse some people call it function based index as in.
syntax example:-
CREATE INDEX <index_name>ON <table_name>(function(column_name));
Bitmap:-
- Carnality is Low, means more duplicate.
- bitmap index create name with bimap
- key word, Bitmap only can use in oracle Enterprise edition, standard edition we can not use this feature.
<index_name>
ON <table_name> (column_name);
still we can add on more points, but i want to hear from your side also.
so please post your opinion about index types in comment session.
Comments
Post a Comment