Skip site navigation (1) Skip section navigation (2)

Re: plan time of MASSIVE partitioning ...

From: Heikki Linnakangas <heikki(dot)linnakangas(at)enterprisedb(dot)com>
To: Boszormenyi Zoltan <zb(at)cybertec(dot)at>
Cc: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, Alvaro Herrera <alvherre(at)commandprompt(dot)com>, Stephen Frost <sfrost(at)snowman(dot)net>, Hans-Jürgen Schönig <postgres(at)cybertec(dot)at>, Robert Haas <robertmhaas(at)gmail(dot)com>, pgsql-hackers Hackers <pgsql-hackers(at)postgresql(dot)org>, Josh Berkus <josh(at)agliodbs(dot)com>
Subject: Re: plan time of MASSIVE partitioning ...
Date: 2010-10-28 11:35:23
Message-ID: 4CC95FFB.4010502@enterprisedb.com (view raw or flat)
Thread:
Lists: pgsql-hackers
On 28.10.2010 13:54, Boszormenyi Zoltan wrote:
> A little better version, no need for the heavy hash_any, hash_uint32
> on the lower 32 bits on pk_eclass is enough. The profiling runtime
> is now 0.42 seconds vs the previous 0.41 seconds for the tree version.

Actually, I wonder if we could just have a separate canon_pathkeys list 
for each EquivalenceClass, instead of one big list in PlannerInfo. I'm 
not too familiar with equivalence classes and all that, but the attached 
patch at least passes the regressions. I haven't done any performance 
testing, but I would expect this to be even faster than the hashtable or 
tree implementations, and a lot simpler.

-- 
   Heikki Linnakangas
   EnterpriseDB   http://www.enterprisedb.com

Attachment: per-eclass-canon-pathkeys.patch
Description: text/x-diff (3.5 KB)

In response to

Responses

pgsql-hackers by date

Next:From: Kevin GrittnerDate: 2010-10-28 12:05:48
Subject: Re: max_wal_senders must die
Previous:From: Boszormenyi ZoltanDate: 2010-10-28 11:29:30
Subject: Re: plan time of MASSIVE partitioning ...

Privacy Policy | About PostgreSQL
Copyright © 1996-2014 The PostgreSQL Global Development Group