Re: [HACKERS] Cost model for parallel CREATE INDEX
От | Peter Geoghegan |
---|---|
Тема | Re: [HACKERS] Cost model for parallel CREATE INDEX |
Дата | |
Msg-id | CAH2-Wzk+7Zf3r7oH3RxSxF9LvCjb+fekfnUv8Y6o58-zgGEMQQ@mail.gmail.com обсуждение исходный текст |
Ответ на | Re: [HACKERS] Cost model for parallel CREATE INDEX (Robert Haas <robertmhaas@gmail.com>) |
Ответы |
Re: [HACKERS] Cost model for parallel CREATE INDEX
|
Список | pgsql-hackers |
On Sat, Mar 4, 2017 at 12:23 AM, Robert Haas <robertmhaas@gmail.com> wrote: >> I guess that the workMem scaling threshold thing could be >> min_parallel_index_scan_size, rather than min_parallel_relation_size >> (which we now call min_parallel_table_scan_size)? > > No, it should be based on min_parallel_table_scan_size, because that > is the size of the parallel heap scan that will be done as input to > the sort. I'm talking about the extra thing we do to prevent parallelism from being used when per-worker workMem is excessively low. That has much more to do with projected index size than current heap size. I agree with everything else you've said, I think. -- Peter Geoghegan
В списке pgsql-hackers по дате отправления: