Re: Indexing columns with low cardinality: persistent bitmap indexes?

From: "Scott Marlowe" <scott(dot)marlowe(at)gmail(dot)com>
To: "Bruno Lavoie" <bruno(dot)lavoie(at)gmail(dot)com>
Cc: PostgreSQL <pgsql-general(at)postgresql(dot)org>
Subject: Re: Indexing columns with low cardinality: persistent bitmap indexes?
Date: 2009-01-12 21:29:01
Message-ID: dcc563d10901121329i5a7a213fgf2ca3c4232bc7ea1@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

On Mon, Jan 12, 2009 at 1:38 PM, Bruno Lavoie <bruno(dot)lavoie(at)gmail(dot)com> wrote:
> Hello,
>
> I have a column with a small number of distinct values, indexing this one
> with a standard BTree is useless. How do I can index this column
> efficiently? I searched and it seems that pg doesn't support the creation of
> persistent bitmap indexes... Is that feature planned in next releases of pg?

You have a few options based on your access patterns. If you tend to
access just one of these an get them all at once, then either clusting
on this value, or partitioning your table will help.

If you access your data using these values and other column values at
the same time, then partial or multi-column indexes might help.

In response to

Browse pgsql-general by date

  From Date Subject
Next Message Alvaro Herrera 2009-01-12 21:34:59 Re: PgUS 2008 end of year summary
Previous Message Jaime Casanova 2009-01-12 21:20:40 Re: Indexing columns with low cardinality: persistent bitmap indexes?