Re: optimizer behavior in the case of highly updated tables

From: Scott Marlowe <scott(dot)marlowe(at)gmail(dot)com>
To: Mark Rostron <mrostron(at)ql2(dot)com>
Cc: "pgsql-admin(at)postgresql(dot)org" <pgsql-admin(at)postgresql(dot)org>
Subject: Re: optimizer behavior in the case of highly updated tables
Date: 2010-06-09 05:54:27
Message-ID: AANLkTik8XqRz6pheRvn3X52aRmTRqJnqagPrJJLEZFSy@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-admin

On Tue, Jun 8, 2010 at 8:58 PM, Mark Rostron <mrostron(at)ql2(dot)com> wrote:
> I am looking for some specific information regarding optimizer behavior.
>
> We recently experienced a situation where a query that was previously using
> a btree lookup (efficient) SWITCHED to using seqscan/hash lookup.

OK, before we go any further, got any explain analyze output of the
fast and slow queries?

In response to

Browse pgsql-admin by date

  From Date Subject
Next Message Scott Marlowe 2010-06-09 06:02:09 Re: Details about pg_stat_bgwriter
Previous Message Greg Smith 2010-06-09 05:14:33 Re: Details about pg_stat_bgwriter