Re: plan time of MASSIVE partitioning ...

From: Hans-Jürgen Schönig <postgres(at)cybertec(dot)at>
To: Stephen Frost <sfrost(at)snowman(dot)net>
Cc: Robert Haas <robertmhaas(at)gmail(dot)com>, Boszormenyi Zoltan <zb(at)cybertec(dot)at>, pgsql-hackers Hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: plan time of MASSIVE partitioning ...
Date: 2010-09-08 14:26:43
Message-ID: 72BE725D-2239-437A-965C-0DEBD8837F79@cybertec.at
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

here is the patch again.
we accidentally attached a wrong test file to the original posting so it grew to big. we had to revoke it from the moderator (this happens if you code from 8am to 10pm).
here is just the patch - it is nice and small.

you can easily test it by making yourself a nice parent table, many subtables (hundreds or thousands) and a decent number of indexes per partition.
then run PREPARE with \timing to see what happens.
you should get scary planning times. the more potential indexes and tables the more scary it will be.

using this wonderful RB tree the time for this function call goes down to basically zero.
i hope this is something which is useful to some folks out there.

many thanks,

hans

Attachment Content-Type Size
canon-pathkeys-as-rbtree-3-ctxdiff.patch application/octet-stream 15.3 KB
unknown_filename text/plain 669 bytes

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Magnus Hagander 2010-09-08 14:27:27 Re: git: uh-oh
Previous Message Marko Kreen 2010-09-08 14:23:45 Re: UTF16 surrogate pairs in UTF8 encoding