Re: row filtering for logical replication
Amit Kapila <amit.kapila16@gmail.com>
Commits
GET /api/v1/messages/:b64id/commits
the thread's linked commits as JSON, with link sources.
API reference →
-
Release cache tuple when no longer needed
- ed0fbc8e5ac9 15.0 landed
-
Add some additional tests for row filters in logical replication.
- ceb57afd3ce1 15.0 landed
-
Fix one of the tests introduced in commit 52e4f0cd47.
- cfb4e209ec15 15.0 landed
-
Allow specifying row filters for logical replication of tables.
- 52e4f0cd472d 15.0 landed
-
Move scanint8() to numutils.c
- cfc7191dfea3 15.0 cited
-
Replace Test::More plans with done_testing
- 549ec201d613 15.0 cited
-
Reduce relcache access in WAL sender streaming logical changes
- 6ce16088bfed 15.0 cited
-
Small cleanups related to PUBLICATION framework code
- c9105dd3660f 15.0 cited
-
Add a view to show the stats of subscription workers.
- 8d74fc96db5f 15.0 cited
-
Allow publishing the tables of schema.
- 5a2832465fd8 15.0 cited
-
Doc: improve documentation of CREATE/ALTER SUBSCRIPTION.
- 1882d6cca161 15.0 cited
-
Add PublicationTable and PublicationRelInfo structs
- 0c6828fa987b 15.0 cited
-
Remove unused argument "txn" in maybe_send_schema().
- 93d573d86571 15.0 cited
-
Add prepare API support for streaming transactions in logical replication.
- 63cf61cdeb7b 15.0 cited
-
Unify PostgresNode's new() and get_new_node() methods
- 201a76183e20 15.0 cited
-
Use l*_node() family of functions where appropriate
- 2b00db4fb0c7 15.0 cited
-
Add support for prepared transactions to built-in logical replication.
- a8fd13cab0ba 15.0 cited
-
Restore the portal-level snapshot after procedure COMMIT/ROLLBACK.
- ef9480509622 11.13 cited
-
Rename a parse node to be more general
- 91d1f2d30210 14.0 landed
-
Remove unused column atttypmod from initial tablesync query
- 4ad31bb2ef25 14.0 landed
-
SEARCH and CYCLE clauses
- 3696a600e229 14.0 cited
On Tue, Dec 21, 2021 at 6:17 AM Ajin Cherian <itsajin@gmail.com> wrote: > > On Tue, Dec 21, 2021 at 5:58 AM Euler Taveira <euler@eulerto.com> wrote: > > > >In pgoutput_row_filter_update(), first, we are deforming the tuple in > >local datum, then modifying the tuple, and then reforming the tuple. > >I think we can surely do better here. Currently, you are reforming > >the tuple so that you can store it in the scan slot by calling > >ExecStoreHeapTuple which will be used for expression evaluation. > >Instead of that what you need to do is to deform the tuple using > >tts_values of the scan slot and later call ExecStoreVirtualTuple(), so > >advantages are 1) you don't need to reform the tuple 2) the expression > >evaluation machinery doesn't need to deform again for fetching the > >value of the attribute, instead it can directly get from the value > >from the virtual tuple. > > Storing the old tuple/new tuple in a slot and re-using the slot avoids > the overhead of > continuous deforming of tuple at multiple levels in the code. > Yeah, deforming tuples again can have a significant cost but what is the need to maintain tmp_new_tuple in relsyncentry. I think that is required in rare cases, so we can probably allocate/deallocate when required. Few other comments: ================== 1. TupleTableSlot *scantuple; /* tuple table slot for row filter */ + TupleTableSlot *new_tuple; /* slot for storing deformed new tuple during updates */ + TupleTableSlot *old_tuple; /* slot for storing deformed old tuple during updates */ I think it is better to name these as scan_slot, new_slot, old_slot to avoid confusion with tuples. 2. +++ b/src/backend/replication/logical/proto.c @@ -19,6 +19,7 @@ #include "replication/logicalproto.h" #include "utils/lsyscache.h" #include "utils/syscache.h" +#include "executor/executor.h" The include is in wrong order. We keep includes in alphabatic order. 3. @@ -832,6 +847,7 @@ logicalrep_write_tuple(StringInfo out, Relation rel, HeapTuple tuple, bool binar ReleaseSysCache(typtup); } + } Spurious addition. 4. -logicalrep_write_tuple(StringInfo out, Relation rel, HeapTuple tuple, bool binary) +logicalrep_write_tuple(StringInfo out, Relation rel, HeapTuple tuple, TupleTableSlot *slot, +bool binary) The formatting is quite off. Please run pgindent. 5. If we decide to go with this approach then I feel let's merge the required comments from Euler's version. -- With Regards, Amit Kapila.