| From: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
|---|---|
| To: | PostgreSQL - Hans-Jürgen Schönig <postgres(at)cybertec(dot)at> |
| Cc: | pgsql-hackers Hackers <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: plan time of MASSIVE partitioning ... |
| Date: | 2010-09-03 14:40:54 |
| Message-ID: | 22483.1283524854@sss.pgh.pa.us |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
=?iso-8859-1?Q?PostgreSQL_-_Hans-J=FCrgen_Sch=F6nig?= <postgres(at)cybertec(dot)at> writes:
> imagine a system with, say, 1000 partitions (heavily indexed) or so. the time taken by the planner is already fairly heavy in this case.
As the fine manual points out, the current scheme for managing
partitioned tables isn't intended to scale past a few dozen partitions.
I think we'll be able to do better when we have an explicit
representation of partitioning, since then the planner won't
have to expend large amounts of effort reverse-engineering knowledge
about how an inheritance tree is partitioned. Before that happens,
it's not really worth the trouble to worry about such cases.
regards, tom lane
| From | Date | Subject | |
|---|---|---|---|
| Next Message | PostgreSQL - Hans-Jürgen Schönig | 2010-09-03 14:46:26 | Re: plan time of MASSIVE partitioning ... |
| Previous Message | Tom Lane | 2010-09-03 14:31:29 | Re: regclass without error? |