>Hei
>
>From: postgis-users on behalf of Marco
>Boeringa
>Sent: Wednesday, March 4, 2020 2:49 PM
>To: postgis-users@lists.osgeo.org
>Subject: Re: [postgis-users] How does PostGIS / PostgreSQL distribute parallel
>work to cores fo
Hi Paul and Darafei,
Thanks for the insightful answers.
I may attempt to do a comparative test using both my multi-threaded
implementation using the vertex count load balancing between threads,
and having postgreSQL do its parallel work. But it will require some
custom development, so I
> On Mar 1, 2020, at 3:36 AM, Marco Boeringa wrote:
>
> Although it is hard to give figures here, because I do not have a fully
> equivalent non-multi threaded processing flow, I do see significant benefits
> from distributing records based on vertex complexity.
Yes and no. The executor
Hi,
There are different ways to push down complexity of each record.
Most popular ones are simplification and subdivision.
For polygons, you can create a new table which will have all polygons
split into small pieces with limited amount of vertices using
ST_Subdivide.
This way instead of more of
Hi Darafei,
Sorry, but I do not have the intimate knowledge of the intricacies of
PostgreSQL / PostGIS that you have, so my post was more of the layman's
level regarding the database itself. My main expertise is more in the
field of GIS.
Anyway, regarding your post, I think this already
Hi,
Can you please be more specific with the question?
Parallelism is tuple level. All load balancing is provided by Postgres
- different Parallel Scan types have different ordering properties and
different tuple passing graph.
Parallel index scan pushes out each tuple to next free worker,
Hi all,
With some of the recent discussions related to PostgreSQL 12.x / PostGIS
3.x query execution performance and parallel query processing, I have
been wondering how PostGIS / PostgreSQL actually distribute parallel
work for GIS type data? Is there any form of load balancing to different
