Re: plans for bitmap indexes?

Greg Stark wrote:

>I think what you're trying to accomplish is better accomplished through
>partitioned tables. Then the user can decide which keys to use to partition
>the data and the optimizer can use the data to completely exclude some
>partitions from consideration. And it wouldn't interfere with indexes to
>access the data within a partition.
>  
>
Though partitioning will help, you can only partition on one key (I 
guess the ability to partition *indexes* might help here).

I think that bitmap indexes provide a flexible may to get fact access to 
the result set for multiple low cardinality conditions - something that 
partitioning will generally not do.

regards

Mark