Re: Quick Performance Poll

From: "Luke Lonergan" <llonergan(at)greenplum(dot)com>
To: jim(at)contactbda(dot)com, "Simon Dale" <sdale(at)rm(dot)com>, pgsql-performance(at)postgresql(dot)org
Subject: Re: Quick Performance Poll
Date: 2006-04-20 14:31:33
Message-ID: C06CE955.21E1C%llonergan@greenplum.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-performance

Jim,

On 4/20/06 6:36 AM, "Jim Buttafuoco" <jim(at)contactbda(dot)com> wrote:

> The access is very fast when looking for a small subset of the data.

I guess you are not using indexes because building a (non bitmap) index on
6TB on a single machine would take days if not weeks.

So if you are using table partitioning, do you have to refer to each child
table separately in your queries?

- Luke

In response to

Responses

Browse pgsql-performance by date

  From Date Subject
Next Message Jim Buttafuoco 2006-04-20 14:40:50 Re: Quick Performance Poll
Previous Message Scott Marlowe 2006-04-20 14:16:27 Re: Inserts optimization?