On Sun, 2006-02-19 at 01:16 -0500, Tom Lane wrote:
Simon Riggs [EMAIL PROTECTED] writes:
Following patch implements matching sort cost calculations in the
planner in sort_cost()
As given, this didn't even compile. Cleaned up and applied.
Well given it was a patch-on-patch, I guess I did
Simon Riggs [EMAIL PROTECTED] writes:
The enclosed patch substantially improves large sort performance,
Applied with revisions. I thought the addition of the Tapestate structs
complicated the notation considerably without really buying anything,
so instead I just made the fixed-size arrays into
Simon Riggs [EMAIL PROTECTED] writes:
Following patch implements matching sort cost calculations in the
planner in sort_cost()
As given, this didn't even compile. Cleaned up and applied.
regards, tom lane
---(end of
On Thu, 2006-01-26 at 00:33 +, Simon Riggs wrote:
The enclosed patch substantially improves large sort performance, in the
general case
cvstip: elapsed 5693 sec, CPU 196 sec
patch:elapsed 4132 sec, CPU 90 sec
Following patch implements matching sort cost calculations in
