Re: merge>hash>loop

From: "Jim C(dot) Nasby" <jnasby(at)pervasive(dot)com>
To: Mark Kirkwood <markir(at)paradise(dot)net(dot)nz>
Cc: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, Markus Schaber <schabi(at)logix-tt(dot)com>, pgsql-performance(at)postgresql(dot)org
Subject: Re: merge>hash>loop
Date: 2006-04-19 05:18:35
Message-ID: 20060419051835.GR49405@pervasive.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-performance

On Wed, Apr 19, 2006 at 04:47:40PM +1200, Mark Kirkwood wrote:
> Jim C. Nasby wrote:
> >On Tue, Apr 18, 2006 at 06:22:26PM -0400, Tom Lane wrote:
> >>"Jim C. Nasby" <jnasby(at)pervasive(dot)com> writes:
> >>>Actually, if you run with stats_block_level turned on you have a
> >>>first-order approximation of what is and isn't cached.
> >>Only if those stats decayed (pretty fast) with time; which they don't.
> >
> >Good point. :/ I'm guessing there's no easy way to see how many blocks
> >for a given relation are in shared memory, either...
>
> contrib/pg_buffercache will tell you this - what buffers from what
> relation are in shared_buffers (if you want to interrogate the os file

So theoretically with that code we could make the cost estimator
functions more intelligent about actual query costs. Now, how you'd
actually see how those estimates improved...

> buffer cache, that's a different story - tho I've been toying with doing
> a utility for Freebsd that would do this).

Well, the problem is that I doubt anything that OS-specific would be
accepted into core. What we really need is some method that's
OS-agnostic...
--
Jim C. Nasby, Sr. Engineering Consultant jnasby(at)pervasive(dot)com
Pervasive Software http://pervasive.com work: 512-231-6117
vcard: http://jim.nasby.net/pervasive.vcf cell: 512-569-9461

In response to

Browse pgsql-performance by date

  From Date Subject
Next Message Tom Lane 2006-04-19 05:25:28 Re: merge>hash>loop
Previous Message Jim C. Nasby 2006-04-19 05:13:47 Re: Blocks read for index scans