Re: Bitmap or B-Tree indexes...?

On Fri, 12 Jan 2007 11:11:18 -0800, Aftermath Fan wrote:

> Hi,
>
> I have a table with about 120 million rows. I'd like to index two
> columns. Column id1 has about 15,000 distinct values; column id2 has
> about 600,000. Most of the queries are:
>
> select <something> from <table> where id1 = ?
> select <something> from <table> where id2 = ?
> select <something> from <table> where id1 = ? and id2 = ?
>
> I'm thinking for id1, the column with 15,000 values, a bitmap index
> would be appropriate given its low relative cardinality. And for id2
> and (id1,id2) a B-tree index.
>
> Just looking for a sanity check...thanks.

Q1: Do any users update <table> ????

-- 
Hans Forbrich   (mailto: Fuzzy.GreyBeard_at_gmail.com)   
*** Feel free to correct me when I'm wrong!
*** Top posting [replies] guarantees I won't respond.