Hi all. I laready posted this a couple of months ago on -hackers: http://archives.postgresql.org/pgsql-hackers/2010-07/msg01519.php I've also been directed to ask here for better and deeper details. What came out is that the management of both inheritance hierarchy and partial indexes doesn't scale well up as it'd have a linear algorithm deep in its bowels. What's the "real" story, then? Thanks in advance. 2010/7/29 Vincenzo Romano <vincenzo.romano@xxxxxxxxxxx>: > Hi all. > I'm wondering about PGSQL scalability. > In particular I have two main topics in my mind: > > 1. What'd be the behavior of the query planner in the case I have > a single huge table with hundreds or thousands of partial indexes > (just differing by the WHERE clause). > This is an idea of mine to make index-partitioning instead of > table-partitioning. > > 2. What'd be the behavior of the query planner in the case I have > hundreds or thousands of child tables, possibly in a multilevel hierarchy > (let's say, partitioning by year, month and company). > > I fear the presence of linear selection algorithms in these two cases that > would kill my design. > > Is there any insight about these two points? > > -- > NotOrAnd Information Technologies > Vincenzo Romano > -- > NON QVIETIS MARIBVS NAVTA PERITVS > -- Vincenzo Romano at NotOrAnd Information Technologies Software Hardware Networking Training Support Security -- NON QVIETIS MARIBVS NAVTA PERITVS -- Sent via pgsql-performance mailing list (pgsql-performance@xxxxxxxxxxxxxx) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-performance
