Postgres Pro
Downloads
Home   >   mailing lists

Re: What kind of index to use for many rows with few unique - Mailing list pgsql-admin

From David F. Skoll
Subject Re: What kind of index to use for many rows with few unique
Date
Msg-id Pine.LNX.4.50.0212021813470.6481-100000@shishi.roaringpenguin.com
Whole thread Raw
In response to Re: What kind of index to use for many rows with few unique values?  (Joel Burton <joel@joelburton.com>)
Responses Re: What kind of index to use for many rows with few unique  (Joe Conway <mail@joeconway.com>)
List pgsql-admin
Tree view 
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.

pgsql-admin by date:

Previous
From: Joel Burton
Date:
Subject: Re: What kind of index to use for many rows with few unique values?
Next
From: "Dan Langille"
Date:
Subject: Re: What kind of index to use for many rows with few unique values?