Re: demystifying nested loop vs. merge join query plan choice - Mailing list pgsql-general

From Sandeep Gupta
Subject Re: demystifying nested loop vs. merge join query plan choice
Date
Msg-id CAAywg7tv_jx5mhvZUg+C5hCrCg2G1hbTCCpKh-6G29zOTiCfxQ@mail.gmail.com
Whole thread Raw
In response to Re: demystifying nested loop vs. merge join query plan choice  (Tom Lane <tgl@sss.pgh.pa.us>)
Responses Re: demystifying nested loop vs. merge join query plan choice  (BladeOfLight16 <bladeoflight16@gmail.com>)
List 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@sss.pgh.pa.us> wrote:
Sandeep Gupta <gupta.sandeep@gmail.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

pgsql-general by date:

Previous
From: Bèrto ëd Sèra
Date:
Subject: Re: incremental dumps
Next
From: Kevin Grittner
Date:
Subject: Re: Why are stored procedures looked on so negatively?