| From: | Simon Riggs <simon(at)2ndquadrant(dot)com> |
|---|---|
| To: | Neil Conway <neilc(at)samurai(dot)com> |
| Cc: | pgsql-hackers <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: nodeAgg perf tweak |
| Date: | 2004-12-01 10:03:40 |
| Message-ID: | 1101895420.5728.55.camel@localhost.localdomain |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Wed, 2004-12-01 at 08:37, Neil Conway wrote:
> On Wed, 2004-12-01 at 08:25 +0000, Simon Riggs wrote:
> > I'd be a little twitchy about new memory contexts at this stage of beta,
> > but if the code is fairly well isolated that could be good.
>
> This would be for 8.1 anyway.
>
> > Would it possible to differentiate between well-known builtin functions
> > and added transition functions?
>
> IMHO, this would be ugly and add unnecessary complexity. I'd like to
> find a solution that actually fixes the problem, rather than just
> working around it in the common case.
It would be my suggestion to implement the optimisation for the common
case *now*, then fix the general case later.
Please shave 20% off everybody's aggregation queries, ugly or not.
You'll see a lot of happy people.
--
Best Regards, Simon Riggs
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Mike Rylander | 2004-12-01 11:46:39 | Re: Error handling in plperl and pltcl |
| Previous Message | Thomas Hallgren | 2004-12-01 09:56:45 | Re: Error handling in plperl and pltcl |