From: | Gregory Stark <stark(at)enterprisedb(dot)com> |
---|---|
To: | "Zeugswetter Andreas ADI SD" <Andreas(dot)Zeugswetter(at)s-itsolutions(dot)at> |
Cc: | <josh(at)agliodbs(dot)com>, <pgsql-hackers(at)postgresql(dot)org>, <jason(at)mbi(dot)ucla(dot)edu> |
Subject: | Re: 2D partitioning of VLDB - sane or not? |
Date: | 2007-08-14 09:54:13 |
Message-ID: | 87hcn2mofu.fsf@oxford.xeocode.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
"Zeugswetter Andreas ADI SD" <Andreas(dot)Zeugswetter(at)s-itsolutions(dot)at> writes:
> I'd say that that point currently is well below 2000 partitions for all
> common db systems.
I think it will depend heavily on the type of queries you're talking about.
Postgres's constraint_exclusion is a linear search and does quite a bit of
work for each constraint. So it isn't terribly efficient for more than 1,000
partitions or so.
*But* that only affects planning time. If your queries are always effectively
pruned to few partitions and you execute them thousands of times then you not
care about slow planning time.
And if the overall table is large enough and you're dropping and loading
partitions then you may still be benefiting from partitioning by keeping all
the loaded records together and allowing dropping a partition to be constant
time.
--
Gregory Stark
EnterpriseDB http://www.enterprisedb.com
From | Date | Subject | |
---|---|---|---|
Next Message | Gregory Stark | 2007-08-14 10:01:41 | Re: Testing the async-commit patch |
Previous Message | Zeugswetter Andreas ADI SD | 2007-08-14 08:46:39 | Re: 2D partitioning of VLDB - sane or not? |