Re: Further pg_upgrade analysis for many tables

From: Jeff Janes <jeff(dot)janes(at)gmail(dot)com>
To: Stephen Frost <sfrost(at)snowman(dot)net>
Cc: Simon Riggs <simon(at)2ndquadrant(dot)com>, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, Bruce Momjian <bruce(at)momjian(dot)us>, PostgreSQL-development <pgsql-hackers(at)postgresql(dot)org>, Magnus Hagander <magnus(at)hagander(dot)net>
Subject: Re: Further pg_upgrade analysis for many tables
Date: 2013-01-21 05:51:11
Message-ID: CAMkU=1zcCrJjCSNLK7kr=atombXzzMU-s3H7tMqodz4i40+DjQ@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On Sunday, January 20, 2013, Stephen Frost wrote:

> * Jeff Janes (jeff(dot)janes(at)gmail(dot)com <javascript:;>) wrote:
>

> > By making the list over-flowable, we fix a demonstrated pathological
> > workload (restore of huge schemas); we impose no detectable penalty to
> > normal workloads; and we fail to improve, but also fail to make worse, a
> > hypothetical pathological workload. All at the expense of a few bytes
> per
> > backend.
> [...]
> > > Why does the list not grow as needed?
> >
> > It would increase the code complexity for no concretely-known benefit.
>
> I'm curious if this is going to help with rollback's of transactions
> which created lots of tables..? We've certainly seen that take much
> longer than we'd like, although I've generally attributed it to doing
> all of the unlink'ing and truncating of files.
>

If you are using large shared_buffers, then you will probably get more
benefit from a different recent commit:

279628a Accelerate end-of-transaction dropping of relations.

Cheers,

Jeff

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Pavan Deolasee 2013-01-21 05:57:12 Re: Removing PD_ALL_VISIBLE
Previous Message Tom Lane 2013-01-21 05:48:22 Re: gistchoose vs. bloat