Re: Parallel Apply
| От | Álvaro Herrera |
|---|---|
| Тема | Re: Parallel Apply |
| Дата | |
| Msg-id | aeHIVhNiFtfGss4b@alvherre.pgsql обсуждение |
| Ответ на | RE: Parallel Apply ("Zhijie Hou (Fujitsu)" <houzj.fnst@fujitsu.com>) |
| Ответы |
Re: Parallel Apply
|
| Список | pgsql-hackers |
Hello, I have a quick question about this work -- is there an expectation of how quicker parallel apply is, compared to our normal (serial) apply, for average cases? Are we talking 20% faster, 2x faster, 10x faster? (When I say average, I mean not considering fringe cases where the workload is such that very little paralelization can be done, and also those where you have a contrived case with one thousand parallel processes each making progress separately to the point where you get ridiculously high numbers. I mean something that can occur in realistic workloads.) My point is that if it's 20% faster, it's nice. But if it's, say, 4x faster, then it's probably groundbreaking to the point that it may enable new use cases not currently possible. Thoughts, pointers? Many thanks -- Álvaro Herrera Breisgau, Deutschland — https://www.EnterpriseDB.com/ "¿Qué importan los años? Lo que realmente importa es comprobar que a fin de cuentas la mejor edad de la vida es estar vivo" (Mafalda)
В списке pgsql-hackers по дате отправления: