On Fri, Apr 13, 2012 at 7:01 PM, Peter Geoghegan <pe...@2ndquadrant.com> wrote: > Well, timsort is specifically designed to take advantage of pre-sorted > data. It does appear to have a lot of traction, as wikipedia points > out:
I hadn't heard of it. But reading up on it it does seem like a good fit for us. It trades some additional storage -- an array of pointers into the sort array where in our case the pointers would be much smaller than a whole SortTuple -- for fewer comparisons -- which in our case are often much slower than a simple integer comparison. -- greg -- Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers
