Re: 9.2beta1, parallel queries, ReleasePredicateLocks, CheckForSerializableConflictIn in the oprofile
Stephen Frost <sfrost@snowman.net>
From: Stephen Frost <sfrost@snowman.net>
To: Merlin Moncure <mmoncure@gmail.com>
Cc: Tom Lane <tgl@sss.pgh.pa.us>, Sergey Koposov <koposov@ast.cam.ac.uk>, Jeff Janes <jeff.janes@gmail.com>, Robert Haas <robertmhaas@gmail.com>, pgsql-hackers@postgresql.org
Date: 2012-05-25T16:17:27Z
Lists: pgsql-hackers
Commits
Same data as JSON:
GET /api/v1/messages/:b64id/commits
the thread's linked commits as JSON, with link sources.
API reference →
-
Improve bulk-insert performance by keeping the current target buffer pinned
- 85e2cedf985b 8.4.0 cited
* Merlin Moncure (mmoncure@gmail.com) wrote: > Right -- duh. Well, hm. Is this worth fixing? ISTM there's a bit of > 'optimizing for pgbench-itis' in the buffer partitions -- they seem > optimized to lever the mostly random access behavior of pgbench. But > how likely is it to see multiple simultaneous scans in the real world? > Interleaving scans like that is not a very effective optimization -- > if it was me, it'd be trying to organize something around a > partitioned tid scan for parallel sequential access. Didn't we implement a system whereby this is exactly what we intend to happen on the read side- that is, everyone doing a SeqScan gangs up on one ring buffer and follows it, which we felt was going to dramatically improve performance in some cases? Or is this completely different from that..? Thanks, Stephen