Re: determining random_page_cost value - Mailing list pgsql-hackers

From Jim C. Nasby
Subject Re: determining random_page_cost value
Date
Msg-id 20051026215611.GJ16682@pervasive.com
Whole thread Raw
In response to Re: determining random_page_cost value  (Yohanes Santoso <pgsql-hackers@microjet.ath.cx>)
List pgsql-hackers
On Tue, Oct 25, 2005 at 04:37:34PM -0400, Yohanes Santoso wrote:
> > All of this goes to uphold Tom's general assertion that the default of 4 is 
> > more or less correct 
> 
> Doesn't this show that 4:1 is a pretty optimistic value considering
> that no long-running db files are fragmentation-free?
> 
> >but the calculation in which we're using that number is 
> > not.
> 
> The calculation inside the planner, IOW, how the planner uses the RPC
> value?

The problem with RPC is that the estimator functions are sub-optimal in
many cases and tend to favor seqscan when they shouldn't. This is why
many people run with RPC set unrealistically low, such as 2.

IMHO until the estimator algorithms improve worrying about RPC is
pointless.
-- 
Jim C. Nasby, Sr. Engineering Consultant      jnasby@pervasive.com
Pervasive Software      http://pervasive.com    work: 512-231-6117
vcard: http://jim.nasby.net/pervasive.vcf       cell: 512-569-9461


pgsql-hackers by date:

Previous
From: "Marc G. Fournier"
Date:
Subject: Re: sort_mem statistics ...
Next
From: "Jim C. Nasby"
Date:
Subject: Re: TRAP: FailedAssertion("!((itemid)->lp_flags & 0x01)", File: "nbtsearch.c", Line: 89)