On 21.09.2011 02:53, Peter Geoghegan wrote:
> C stdlib quick-sort time elapsed: 2.092451 seconds
> Inline quick-sort time elapsed: 1.587651 seconds
>
> Does *that* look attractive to you?

Not really, to be honest. That's a 25% speedup in pure qsorting speed. 
How much of a gain in a real query do you expect to get from that, in 
the best case? There's so many other sources of overhead that I'm afraid 
this will be lost in the noise. If you find a query that spends, say, 
50% of its time in qsort(), you will only get a 12.5% speedup on that 
query. And even 50% is really pushing it - I challenge you to find a 
query that spends any significant amount of time qsorting integers.

-- 
   Heikki Linnakangas
   EnterpriseDB   http://www.enterprisedb.com

In response to

• Re: Inlining comparators as a performance optimisation at 2011-09-20 23:53:16 from Peter Geoghegan

Responses

• Re: Inlining comparators as a performance optimisation at 2011-09-21 07:01:11 from Simon Riggs
• Re: Inlining comparators as a performance optimisation at 2011-09-21 14:20:55 from Peter Geoghegan

pgsql-hackers by date

Next:	From: Simon Riggs	Date: 2011-09-21 06:55:55
	Subject: Re: Inlining comparators as a performance optimisation
Previous:	From: Fujii Masao	Date: 2011-09-21 06:23:53
	Subject: Re: Online base backup from the hot-standby