RE: Proposal: Filter irrelevant change before reassemble transactions during logical decoding

Dear Ajin,

> I compared the patch 1 which does not employ a hash cache and has the
> overhead of starting a transaction every time the filter is checked.
> 
> I created a test setup of 10 million inserts in 3 different scenarios:
> 1. All inserts on unpublished tables
> 2. Half of the inserts on unpublished table and half on pupblished table
> 3. All inserts on published tables.
> 
> The percentage improvement in the new optimized patch compared to the
> old patch is:
> 
> No transactions in publication: 85.39% improvement
> Half transactions in publication: 72.70% improvement
> All transactions in publication: 48.47% improvement
> 
> Attaching a graph to show the difference.

I could not find any comparisons with HEAD. Can you clarify the throughput/latency/memory
usage with HEAD?

Best regards,
Hayato Kuroda
FUJITSU LIMITED