From: | Manfred Koizar <mkoi-pg(at)aon(dot)at> |
---|---|
To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
Cc: | pgsql-patches(at)postgresql(dot)org |
Subject: | Re: cost_nonsequential_access() |
Date: | 2004-06-08 18:18:31 |
Message-ID: | vutbc0dikb5al2d041vo2tq8e3f00psfug@email.aon.at |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-patches |
On Tue, 08 Jun 2004 13:13:01 -0400, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> wrote:
>Possibly the relsize axis ought to be measured on a log scale, or
>something like that, but that didn't seem to work nicely when relsize
>approaches zero.
In my experiments I used log(relsize) on the x axis, and I don't think
that the graph looks unpleasant for small relsize. My thought was (and
is) that we are much more interested in whether relpages is 1/100, 1/10,
1, 10, 100 times effective_cache_size than whether it is relpages +/-
1000, 2000, 3000, ...
I played around with some numbers that could be considered fairly
realistic. You might want to look at the graphs I linked to in the
previous message or download http://www.pivot.at/pg/costsize.sxc.
But I think we are wasting too much effort. The graphs don't look too
different, whether you use relsize or relsize^2. Maybe relsize^3 is
optimal? Nobody knows. The important part of the patch is that the
result is scaled and shifted into the range 1 to random_page_cost.
Whatever you decide to do is ok with me.
Servus
Manfred
From | Date | Subject | |
---|---|---|---|
Next Message | Andreas Pflug | 2004-06-08 18:27:29 | Re: serverlog function (log_destination file) |
Previous Message | Tom Lane | 2004-06-08 17:13:01 | Re: cost_nonsequential_access() |