Re: Parallel Append implementation

Поиск
Список
Период
Сортировка
От Robert Haas
Тема Re: Parallel Append implementation
Дата
Msg-id CA+TgmobOdD4eVdnkoMG+mJUT+5sB191v2pwL=JVxCHMzU1Wm3g@mail.gmail.com
обсуждение исходный текст
Ответ на Re: Parallel Append implementation  (Andres Freund <andres@anarazel.de>)
Список pgsql-hackers
On Tue, Apr 4, 2017 at 12:47 AM, Andres Freund <andres@anarazel.de> wrote:
> I don't think the parallel seqscan is comparable in complexity with the
> parallel append case.  Each worker there does the same kind of work, and
> if one of them is behind, it'll just do less.  But correct sizing will
> be more important with parallel-append, because with non-partial
> subplans the work is absolutely *not* uniform.

Sure, that's a problem, but I think it's still absolutely necessary to
ramp up the maximum "effort" (in terms of number of workers)
logarithmically.  If you just do it by costing, the winning number of
workers will always be the largest number that we think we'll be able
to put to use - e.g. with 100 branches of relatively equal cost we'll
pick 100 workers.  That's not remotely sane.

-- 
Robert Haas
EnterpriseDB: http://www.enterprisedb.com
The Enterprise PostgreSQL Company



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

Предыдущее
От: Robert Haas
Дата:
Сообщение: Re: Page Scan Mode in Hash Index
Следующее
От: Robert Haas
Дата:
Сообщение: Re: wait event documentation