"Marc Morin" <marc@xxxxxxxxxxxx> writes: > No, an insert consists of roughly 10,000+ rows per transaction block. Perhaps it would help to pre-sort these rows by key? Like Markus, I'm pretty suspicious of lowering BLCKSZ ... you can try it but it's likely to prove counterproductive (more btree index levels, more rows requiring toasting, a tighter limit on what rows will fit at all). I doubt I'd try to make it lower than a couple K in any case. The bottom line here is likely to be "you need more RAM" :-( I wonder whether there is a way to use table partitioning to make the insert pattern more localized? We'd need to know a lot more about your insertion patterns to guess how, though. regards, tom lane
