MIME-Version: 1.0
References: <5675f9f771f04d9f8b5cffe16f4a4175@EX13MBX02.gb.ad.corp>
In-Reply-To: <5675f9f771f04d9f8b5cffe16f4a4175@EX13MBX02.gb.ad.corp>
From: Michael Lewis <mlewis@entrata.com>
Date: Mon, 12 Aug 2019 13:05:25 -0600
Message-ID: 
 <CAHOFxGrPiuFFNETAbV3rcw1COns8vJbgPm5zrGiSeO9GZPRshQ@mail.gmail.com>
Subject: Re: Planner performance in partitions
To: =?UTF-8?Q?Piotr_W=C5=82odarczyk?= <piotr.wlodarczyk@gnb.pl>
Cc: "pgsql-performance@lists.postgresql.org"
 <pgsql-performance@lists.postgresql.org>
Content-Type: multipart/alternative; boundary="0000000000007620f2058ff03697"
Precedence: bulk

--0000000000007620f2058ff03697
Content-Type: text/plain; charset="UTF-8"

"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

--0000000000007620f2058ff03697
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr"><div>&quot;It is also important to consider the overhead o=
f partitioning during query planning and execution. The query planner is ge=
nerally able to handle partition hierarchies with <b><i>up to a few hundred=
 partitions fairly well</i></b>, provided that typical queries allow the qu=
ery planner to prune all but a small number of partitions. Planning times b=
ecome longer and memory consumption becomes higher as more partitions are a=
dded.&quot; (emphasis added)</div><div><br><div>--<a href=3D"https://www.po=
stgresql.org/docs/current/ddl-partitioning.html">https://www.postgresql.org=
/docs/current/ddl-partitioning.html</a></div></div></div>

--0000000000007620f2058ff03697--