Re: Using quicksort for every external sort run
От | Peter Geoghegan |
---|---|
Тема | Re: Using quicksort for every external sort run |
Дата | |
Msg-id | CAM3SWZTC_LkGFxOaHfsFv9mZdtx8YXhYYyGc4kJkCnAufPkjqw@mail.gmail.com обсуждение исходный текст |
Ответ на | Re: Using quicksort for every external sort run (Greg Stark <stark@mit.edu>) |
Ответы |
Re: Using quicksort for every external sort run
Re: Using quicksort for every external sort run Re: Using quicksort for every external sort run |
Список | pgsql-hackers |
On Tue, Dec 8, 2015 at 6:39 PM, Greg Stark <stark@mit.edu> wrote: > Fwiw attached are two patches for perusal. One is a trivial patch to > add the size of the tape to trace_sort output. I guess I'll just apply > that without discussion. +1 > The other replaces the selection sort with an > open coded sort network for cases up to 8 elements. (Only in the perl > generated qsort for the moment). I don't have the bandwidth to > benchmark this for the moment but if anyone's interested in trying I > suspect it'll make a small but noticeable difference. I'm guessing > 2-5%. I guess you mean insertion sort. What's the theoretical justification for the change? -- Peter Geoghegan
В списке pgsql-hackers по дате отправления: