Re: demystifying nested loop vs. merge join query plan choice

From: Sandeep Gupta <gupta(dot)sandeep(at)gmail(dot)com>
To: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
Cc: Pavel Stehule <pavel(dot)stehule(at)gmail(dot)com>, pgsql-general(at)postgresql(dot)org
Subject: Re: demystifying nested loop vs. merge join query plan choice
Date: 2013-08-01 14:25:18
Message-ID: CAAywg7tv_jx5mhvZUg+C5hCrCg2G1hbTCCpKh-6G29zOTiCfxQ@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

@Jeff : Thanks for pointing this out. Turns out that was the case.

@Tom: Thank you for the reference to random_page_cost parameters. It would
be very useful for us. Would go through the rest of the documentation as
well.

On Wed, Jul 31, 2013 at 3:55 PM, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> wrote:

> Sandeep Gupta <gupta(dot)sandeep(at)gmail(dot)com> writes:
> > details regarding buffer usage:
> > [ 100% buffer hit rate ]
>
> Your database is evidently fully cached in memory. If that's the
> operating mode you expect, you need to change the planner's cost
> parameters, in particular reduce random_page_cost to equal seq_page_cost.
> There is plenty of material about this on the PG wiki or in the
> pgsql-performance archives.
>
> regards, tom lane
>

In response to

Responses

Browse pgsql-general by date

  From Date Subject
Next Message Kevin Grittner 2013-08-01 20:24:05 Re: Why are stored procedures looked on so negatively?
Previous Message Martin Collins 2013-08-01 13:24:13 Re: incremental dumps