Re: Planner performance in partitions

From: Michael Lewis <mlewis(at)entrata(dot)com>
To: Piotr Włodarczyk <piotr(dot)wlodarczyk(at)gnb(dot)pl>
Cc: "pgsql-performance(at)lists(dot)postgresql(dot)org" <pgsql-performance(at)lists(dot)postgresql(dot)org>
Subject: Re: Planner performance in partitions
Date: 2019-08-12 19:05:25
Message-ID: CAHOFxGrPiuFFNETAbV3rcw1COns8vJbgPm5zrGiSeO9GZPRshQ@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-performance

"It is also important to consider the overhead of partitioning during query
planning and execution. The query planner is generally able to handle
partition hierarchies with *up to a few hundred partitions fairly well*,
provided that typical queries allow the query planner to prune all but a
small number of partitions. Planning times become longer and memory
consumption becomes higher as more partitions are added." (emphasis added)

--https://www.postgresql.org/docs/current/ddl-partitioning.html

In response to

Responses

Browse pgsql-performance by date

  From Date Subject
Next Message MichaelDBA 2019-08-12 19:24:58 Re: Planner performance in partitions
Previous Message Jeremy Finzel 2019-08-12 13:29:21 Re: Bitmap heap scan performance