| From: | Peter Geoghegan <pg(at)bowt(dot)ie> |
|---|---|
| To: | "Andrey M(dot) Borodin" <x4mmm(at)yandex-team(dot)ru> |
| Cc: | PostgreSQL-development <pgsql-hackers(at)postgresql(dot)org>, Heikki Linnakangas <hlinnaka(at)iki(dot)fi> |
| Subject: | Re: Batching page logging during B-tree build |
| Date: | 2020-09-23 18:19:18 |
| Message-ID: | CAH2-WzksjeT2CbCTzeCE5iU5sL9bE8_xcQnmNO4Wn9vYOp=THw@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Fri, Sep 18, 2020 at 8:39 AM Andrey M. Borodin <x4mmm(at)yandex-team(dot)ru> wrote:
> Here is PoC with porting that same routine to B-tree. It allows to build B-trees ~10% faster on my machine.
It doesn't seem to make any difference on my machine, which has an
NVME SSD (a Samsung 970 Pro). This is quite a fast SSD, though the
sync time isn't exceptional. My test case is "reindex index
pgbench_accounts_pkey", with pgbench scale 500. I thought that this
would be a sympathetic case, since it's bottlenecked on writing the
index, with relatively little time spent scanning and sorting in
parallel workers.
Can you provide a test case that is sympathetic towards the patch?
BTW, I noticed that the index build is absurdly bottlenecked on
compressing WAL with wal_compression=on. It's almost 3x slower with
compression turned on!
--
Peter Geoghegan
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Andres Freund | 2020-09-23 18:29:40 | Re: Batching page logging during B-tree build |
| Previous Message | Takashi Menjo | 2020-09-23 17:37:56 | Re: [PoC] Non-volatile WAL buffer |