>
> As stated in the previous email if I use partitioning then queries will
> be executed sequentially - i.e., instead of log(n) it would be (#
> partitions) * log(n). Right?
>
depends.. since indexes would be hit for each child table, the time for
query is dependent on the amount of data that is indexed in each table.
the querying of the parent is still pretty quick given dual processor and a
fast array filestorage device.
given your situation, i would give the parent/child approach a child. I
haven't checked in postgres if it is has it has Joshua had replied, but I do
know bizgres does as i have been running this configuration for the last 3
years and it solved my problem of importing 30-60M records in a day and
still being able to query the database for data.
-brandon
http://www.t3report.com - marketing intelligence for online marketing and
affiliate programs
