Re: Using quicksort for every external sort run
От | Greg Stark |
---|---|
Тема | Re: Using quicksort for every external sort run |
Дата | |
Msg-id | CAM-w4HMVPgqv4b251asVtjhnT7Csb3LQAJKcVgGxz9v3Xt1h_Q@mail.gmail.com обсуждение исходный текст |
Ответ на | Re: Using quicksort for every external sort run (Peter Geoghegan <pg@heroku.com>) |
Ответы |
Re: Using quicksort for every external sort run
|
Список | pgsql-hackers |
On Fri, Nov 20, 2015 at 12:54 AM, Peter Geoghegan <pg@heroku.com> wrote: > * One run can be created with replacement selection, where a > hyrbid-sort merge strategy needs to create and then merge many runs. > When I started work on this patch, I was pretty sure that case would > be noticeably regressed. I was wrong. Hm. Have you tested a nearly-sorted input set around 1.5x the size of work_mem? That should produce a single run using the heap to generate runs but generate two runs if, AIUI, you're just filling work_mem, running quicksort, dumping that run entirely and starting fresh. I don't mean to say it's representative but if you're looking for a worst case... -- greg
В списке pgsql-hackers по дате отправления: