On Thu, Dec 29, 2011 at 8:03 PM, Peter Geoghegan <peter(at)2ndquadrant(dot)com> wrote:
> * A spreadsheet that shows the results of re-running my earlier heap
> tuple sorting benchmark with this new patch. The improvement in the
> query that orders by 2 columns is all that is pertinent there, when
> considering the value of (1) and the sense in standing still for
> controversy A.
> * A spreadsheet that shows the difference in index creation times,
> generated with the help of the new python script.
very nice. let me save everyone the effort of opening his
spreadsheets (which by the way both show 'HEAD/unoptimized' --
probably not what you meant): he's showing a consistent ~50% reduction
in running time of sort driven queries -- that's money.
In response to
pgsql-hackers by date
|Next:||From: Peter Geoghegan||Date: 2011-12-30 20:30:05|
|Subject: Re: Progress on fast path sorting, btree index creation time|
|Previous:||From: Jeff Janes||Date: 2011-12-30 16:58:14|
|Subject: Re: 16-bit page checksums for 9.2|