Re: INSERT ... ON CONFLICT UPDATE and logical decoding
От | Peter Geoghegan |
---|---|
Тема | Re: INSERT ... ON CONFLICT UPDATE and logical decoding |
Дата | |
Msg-id | CAM3SWZSg3nLXPMj0bJ+JqkrNovaog3HnpA8Td-YzJVvz0442eA@mail.gmail.com обсуждение исходный текст |
Ответ на | Re: INSERT ... ON CONFLICT UPDATE and logical decoding (Peter Geoghegan <pg@heroku.com>) |
Ответы |
Re: INSERT ... ON CONFLICT UPDATE and logical decoding
|
Список | pgsql-hackers |
On Fri, Feb 20, 2015 at 3:44 PM, Peter Geoghegan <pg@heroku.com> wrote: >>> they'd only see a >>> REORDER_BUFFER_CHANGE_INSERT when that was the definitive outcome of >>> an UPSERT, or alternatively a REORDER_BUFFER_CHANGE_UPDATE when that >>> was the definitive outcome. No need for output plugins to consider >>> REORDER_BUFFER_CHANGE_INTERNAL_SUPERDELETE at all. >> >> Yes. It'd be easiest if the only the final insert/update were actually >> WAL logged as full actions. > > Well, that implies that we'd actually know that we'd succeed when WAL > logging the speculative heap tuple's insertion. We literally have no > way of knowing if that's the case at that point, though - that's just > the nature of value locking scheme #2's optimistic approach. Attached patch does this. This is just a sketch, to provoke a quick discussion (which is hopefully all this needs). I did things this way because it seemed more efficient than rolling this into a whole new revision of the ON CONFLICT patch series. Ostensibly, this does the right thing: The test_decoding output plugin only ever reports either an INSERT or an UPDATE within a transaction (that contains an INSERT ... ON CONFLICT UPDATE). With jjanes_upsert running, I have not found any problematic cases where this fails to be true (although I have certainly been less than thorough so far - please take that into consideration). I have two basic concerns: * Do you think that what I've sketched here is roughly the right approach? Consolidating super deletions and insertions at transaction reassembly seemed like the right thing to do, but obviously I'm not best qualified to judge that. Clearly, it would be possible to optimize this so REORDER_BUFFER_CHANGE_INSERT "peek ahead" happens much more selectively, which I haven't bothered with yet. * What are the hazards implied by my abuse of the ReorderBufferIterTXNNext() interface? It looks like it should be okay to "peek ahead" like this, because it has a slightly odd convention around memory management that accidentally works. But honestly, I'm feeling too lazy to make myself grok the code within ReorderBufferIterTXNNext() at the moment, and so have not put concerns about the code being totally broken to rest yet. Could the "current" ReorderBufferChange be freed before it is sent to a logical decoding plugin by way of a call to the rb->apply_change() callback (when the xact is spooled to disk, for example)? Thanks -- Peter Geoghegan
Вложения
В списке pgsql-hackers по дате отправления: