Re: Using quicksort for every external sort run

Поиск
Список
Период
Сортировка
От Jeremy Harris
Тема Re: Using quicksort for every external sort run
Дата
Msg-id 56686F67.4010303@wizmail.org
обсуждение исходный текст
Ответ на Re: Using quicksort for every external sort run  (Jeff Janes <jeff.janes@gmail.com>)
Список pgsql-hackers
On 09/12/15 00:02, Jeff Janes wrote:
> The second one consumes that giant tape run along with 232 small tape
> runs.

In terms of number of comparisons, binary merge works best when the
inputs are of similar length.  I'd assume the same goes for n-ary
merge, but I don't know if comparison count is an issue here.
-- 
Cheers, Jeremy




В списке pgsql-hackers по дате отправления:

Предыдущее
От: Robert Haas
Дата:
Сообщение: Re: Confusing results with lateral references
Следующее
От: Robert Haas
Дата:
Сообщение: Re: parallel joins, and better parallel explain