Re: Quick Performance Poll

From: "Jim Buttafuoco" <jim(at)contactbda(dot)com>
To: "Luke Lonergan" <llonergan(at)greenplum(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:40:50
Message-ID: 20060420143830.M5360@contactbda.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-performance

First of all this is NOT a single table and yes I am using partitioning and the constaint exclusion stuff. the largest
set of tables is over 2T. I have not had to rebuild the biggest database yet, but for a smaller one ~1T the restore
takes about 12 hours including many indexes on both large and small tables

Jim

---------- Original Message -----------
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
Sent: Thu, 20 Apr 2006 07:31:33 -0700
Subject: Re: [PERFORM] Quick Performance Poll

> 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
>
> ---------------------------(end of broadcast)---------------------------
> TIP 1: if posting/reading through Usenet, please send an appropriate
> subscribe-nomail command to majordomo(at)postgresql(dot)org so that your
> message can get through to the mailing list cleanly
------- End of Original Message -------

In response to

Responses

Browse pgsql-performance by date

  From Date Subject
Next Message Ruben Rubio Rey 2006-04-20 14:54:21 Re: Perfrmance Problems (7.4.6)
Previous Message Luke Lonergan 2006-04-20 14:31:33 Re: Quick Performance Poll