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
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
NON QVIETIS MARIBVS NAVTA PERITVS
pgsql-performance by date
|Next:||From: Joshua D. Drake||Date: 2010-07-29 17:12:06|
|Subject: Re: On Scalability|
|Previous:||From: Tom Lane||Date: 2010-07-29 15:20:45|
|Subject: Re: planner index choice |
pgsql-hackers by date
|Next:||From: Tom Lane||Date: 2010-07-29 17:10:28|
|Subject: Re: string_to_array has to be stable? |
|Previous:||From: Robert Haas||Date: 2010-07-29 17:06:03|
|Subject: Re: string_to_array has to be stable?|