Re: Making all nbtree entries unique by having heap TIDs participatein comparisons - Mailing list pgsql-hackers

From Andrey Lepikhov
Subject Re: Making all nbtree entries unique by having heap TIDs participatein comparisons
Date
Msg-id a3b46cc4-8767-a718-a9df-0aa166bd3378@postgrespro.ru
Whole thread Raw
In response to Re: Making all nbtree entries unique by having heap TIDs participatein comparisons  (Peter Geoghegan <pg@bowt.ie>)
Responses Re: Making all nbtree entries unique by having heap TIDs participatein comparisons  (Peter Geoghegan <pg@bowt.ie>)
List pgsql-hackers

On 19.10.2018 0:54, Peter Geoghegan wrote:
> I would welcome any theories as to what could be the problem here. I'm
> think that this is fixable, since the picture for the patch is very
> positive, provided you only focus on bgwriter/checkpoint activity and
> on-disk sizes. It seems likely that there is a very specific gap in my
> understanding of how the patch affects buffer cleaning.

I have same problem with background heap & index cleaner (based on your 
patch). In this case the bottleneck is WAL-record which I need to write 
for each cleaned block and locks which are held during the WAL-record 
writing process.
Maybe you will do a test without writing any data to disk?

-- 
Andrey Lepikhov
Postgres Professional
https://postgrespro.com
The Russian Postgres Company


pgsql-hackers by date:

Previous
From: Hironobu SUZUKI
Date:
Subject: Re: pgbench - add pseudo-random permutation function
Next
From: Amit Kapila
Date:
Subject: Re: Buildfarm failures for hash indexes: buffer leaks