| From: | Merlin Moncure <mmoncure(at)gmail(dot)com> |
|---|---|
| To: | Peter Geoghegan <peter(at)2ndquadrant(dot)com> |
| Cc: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, Robert Haas <robertmhaas(at)gmail(dot)com>, PG Hackers <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: Progress on fast path sorting, btree index creation time |
| Date: | 2011-12-30 19:46:24 |
| Message-ID: | CAHyXU0zS=Y3o2b7ZF-FvD_kzoLZAUzYx=KNFTwLMZrpU+tU5Wg@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
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.
merlin
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Peter Geoghegan | 2011-12-30 20:30:05 | Re: Progress on fast path sorting, btree index creation time |
| Previous Message | Jeff Janes | 2011-12-30 16:58:14 | Re: 16-bit page checksums for 9.2 |