Re: What kind of index to use for many rows with few unique

From: "David F(dot) Skoll" <dfs(at)roaringpenguin(dot)com>
To: Joel Burton <joel(at)joelburton(dot)com>
Cc: pgsql-admin(at)postgresql(dot)org
Subject: Re: What kind of index to use for many rows with few unique
Date: 2002-12-02 23:14:49
Message-ID: Pine.LNX.4.50.0212021813470.6481-100000@shishi.roaringpenguin.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-admin

On Mon, 2 Dec 2002, Joel Burton wrote:

> Looks right to me: index scan for the less-common option, seqscan for
> the most common. Why don't you think this, as a btree, will work for
> you?

No, I'm sure a btree will work. However, won't the index be
inefficient (i.e., very flat) if there are many entries with the same
value? Or is this not a problem?

--
David.

In response to

Responses

Browse pgsql-admin by date

  From Date Subject
Next Message Joe Conway 2002-12-02 23:15:08 Re: What kind of index to use for many rows with few unique
Previous Message Joel Burton 2002-12-02 23:04:38 Re: What kind of index to use for many rows with few unique values?