On Fri, May 26, 2006 at 04:41:51PM -0400, Tom Lane wrote: > Simon Riggs <[EMAIL PROTECTED]> writes: > > There is a noticeable rise in sort time with increasing work_mem, but > > that needs to be offset from the benefit that in-general comes from > > using a large Heap for the sort. With the data you're using that always > > looks like a loss, but that isn't true with all input data orderings. > > Yeah, these are all the exact same test data, right? We need a bit more > variety in the test cases before drawing any sweeping conclusions.
All testing is select count(*) from (select * from accounts order by bid) a; hitting a pgbench database, since that's something anyone can (presumably) reproduce. Suggestions for other datasets welcome. -- Jim C. Nasby, Sr. Engineering Consultant [EMAIL PROTECTED] Pervasive Software http://pervasive.com work: 512-231-6117 vcard: http://jim.nasby.net/pervasive.vcf cell: 512-569-9461 ---------------------------(end of broadcast)--------------------------- TIP 2: Don't 'kill -9' the postmaster
