Re: User concurrency thresholding: where do I look? - Mailing list pgsql-performance

From Simon Riggs
Subject Re: User concurrency thresholding: where do I look?
Date
Msg-id 1185212261.4284.270.camel@ebony.site
Whole thread Raw
In response to Re: User concurrency thresholding: where do I look?  ("Simon Riggs" <simon@2ndquadrant.com>)
Responses Re: User concurrency thresholding: where do I look?
List pgsql-performance
On Mon, 2007-07-23 at 16:48 +0100, Simon Riggs wrote:
> On Mon, 2007-07-23 at 10:54 -0400, Tom Lane wrote:
> > "Simon Riggs" <simon@2ndquadrant.com> writes:
> > > I looked at this last May and my notes say "ExecutorState". I guess that
> > > was wrong, but my analysis showed there was a single malloc of 8228
> > > bytes happening once per query during my tests.
> >
> > Well, if you can track down where it's coming from, we could certainly
> > hack the containing context's parameters.  But EState's not it.
>
> Well, I discover there is an allocation of 8232 (inflation...) made once
> per statement by a memory context called... ExecutorState. Still not
> sure exactly which allocation this is, but its definitely once per
> statement on pgbench, which should narrow it down. Plan, query etc?
>
> I don't see a way to hack the allocation, since the max chunk size is
> 8K.

It is the allocation of BTScanOpaqueData called from btrescan() in
nbtree.c

currPos and markPos are defined as BTScanPosData, which is an array of
BTScanPosItems. That makes BTScanOpaqueData up to 8232 bytes, which
seems wasteful since markPos is only ever used during merge joins. Most
of that space isn't even used during merge joins either, we just do that
to slightly optimise the speed of the restore during merge joins.

Seems like we should allocate the memory when we do the first mark.

--
  Simon Riggs
  EnterpriseDB  http://www.enterprisedb.com


pgsql-performance by date:

Previous
From: Paul van den Bogaard
Date:
Subject: Re: disable archiving
Next
From: "Simon Riggs"
Date:
Subject: Re: User concurrency thresholding: where do I look?