On 12/3/10 10:20 PM, Tom Lane wrote:
> John Papandriopoulos<dr(dot)jpap(at)gmail(dot)com> writes:
>> I've found that a k-ary table inheritance tree works quite well to
>> reduce the O(n) CHECK constraint overhead  in the query planner
>> when enabling partition constraint exclusion.
> Um ... you mean you're creating intermediate child tables for no reason
> except to reduce the number of direct descendants of any one table?
> That's an utter waste of time, because the first thing the planner will
> do with an inheritance tree is flatten it. Just create *one* parent
> table and make all the leaf tables direct children of it.
>> My machine swaps wildly when PostgreSQL plans an UPDATE or DELETE.
> This is a strong hint that you've got way too many child tables.
Thanks for your advice, Tom.
I've recreated the same example with just one parent table, and 4096 child tables.
SELECT query planning is lightning fast as before; DELETE and UPDATE cause my machine to swap.
What's different about DELETE and UPDATE here? If I've way too many child tables, why isn't the SELECT query plan causing the same large memory usage?
In response to
pgsql-performance by date
|Next:||From: Markus Schulz||Date: 2010-12-04 10:24:02|
|Subject: Re: problem with from_collapse_limit and joined views|
|Previous:||From: Tom Lane||Date: 2010-12-04 06:20:54|
|Subject: Re: Query-plan for partitioned UPDATE/DELETE slow and swaps vmem compared to SELECT |