Re: oracle's indexing methods

From: Winnie Liu <poohland_at_hotmail.com>
Date: Thu, 9 Jul 1998 19:22:24 -0700
Message-ID: <6o3tl3$3on@sjx-ixn10.ix.netcom.com>

B-trees index may use up a lot of disk space (like the ROWID and the columns whick you index on), where bitmap index use a lot less space. Oracle doc said that bitmap index is good for a columns with low distinct values but a huge number of rows.

I know that you have to rebuild the B-tree index once in a while if insert,update or delete is servere on the system. But I am not sure about the bit-mapped index. Can any one tell me if there is a need to rebuild the bitmap index?

Winnie LIu
DBA
Unihealth,CA

Umar FArooq wrote in message <35A4983D.9817F64F_at_cressoft.com.pk>...
>hi!
>im searching for a comparison between oracle's various indexing
>techniques....ie B-trees vs bitmapped indexes ....
>
>more specifically im looking for scenarios in which each type of index
>is used and a comprison of the performance, storage and maintenance
>requirements of each type
>
>Thx.
>
>umar farooq
>umar.farooq_at_cressoft.com.pk
>
Received on Thu Jul 09 1998 - 21:22:24 CDT