On Fri, Jul 30, 2010 at 11:24 AM, Vincenzo Romano <vincenzo.rom...@notorand.it> wrote: > At a first glance it seems that for inheritance some bottleneck is > hindering a full exploit for table partitioning.
There have been lengthy discussions of how to implement partitioning to fix these precise problems, yes. > Is there anyone who knows whether those algorithms are linear or not? They're linear in both cases. But they happen at plan time rather than query execution time. So if your application prepares all its queries and then uses them many times it would not slow down query execution but would slow down the query planning time. In some applications this is much better but in others unpredictable run-times is as bad as long run-times. Also in the case of having many partial indexes it would slow down inserts and updates as well, though to a lesser degree, and that would happen at execution time. -- greg -- Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers
