Re: bitmapped indexes

Valiveru, Siva wrote:
>
> Need a advice here ..
>
> Table "A"
>
> Col1 - PK
> Col2 - Low cardinality column ( say 2 or 3 distinct values)
> Col3- Low cardinality column
> col4- Log Cardinality column
>
> which of the following options is appropriate for the queries like this(
> Ours is a high OLTP APPLICATION)
>
> select * from A where col2='a' and col3='1' and col4 = 'b' ;
>
> a) Separate bitmap indexes on each of the columns(col1, col2, col3)
>
> b) Composite bitmap index on the columns col1,col2,col3.
>
> c) Composite b*tree index on the columns col1,col2,col3.
>
> ** I remember reading that bitmap is not suitable for high transactional
> applications..because of the locks on the blocks..but what is the another
> alternative ..
>
> Thanks, Siva
>

I wouldn't use bitmap indexes but I would definitely consider partitioning ...

--
Regards,

  Stephane Faroult
  Oriole Corporation
------------------------------------------------------------------
http://www.oriolecorp.com, designed by Oracle DBAs for Oracle DBAs
------------------------------------------------------------------
-- 
Please see the official ORACLE-L FAQ: http://www.orafaq.com
-- 
Author: Stephane Faroult
  INET: sfaroult_at_oriolecorp.com

Fat City Network Services    -- (858) 538-5051  FAX: (858) 538-5051
San Diego, California        -- Public Internet access / Mailing Lists
--------------------------------------------------------------------
To REMOVE yourself from this mailing list, send an E-Mail message
to: ListGuru_at_fatcity.com (note EXACT spelling of 'ListGuru') and in
the message BODY, include a line containing: UNSUB ORACLE-L
(or the name of mailing list you want to be removed from).  You may
also send the HELP command for other information (like subscribing).