| From: | Andrey Borodin <x4mmm(at)yandex-team(dot)ru> |
|---|---|
| To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
| Cc: | Andres Freund <andres(at)anarazel(dot)de>, Paul Ramsey <pramsey(at)cleverelephant(dot)ca>, Владимир Лесков <vladimirlesk(at)yandex-team(dot)ru>, Stephen Frost <sfrost(at)snowman(dot)net>, Daniel Verite <daniel(at)manitou-mail(dot)org>, Simon Riggs <simon(at)2ndquadrant(dot)com>, rafia(dot)sabih(at)enterprisedb(dot)com, PostgreSQL Hackers <pgsql-hackers(at)lists(dot)postgresql(dot)org> |
| Subject: | Re: Compressed TOAST Slicing |
| Date: | 2019-04-16 12:56:52 |
| Message-ID: | 58B7237A-CBEC-47CF-AC5B-EFA52D6093BB@yandex-team.ru |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
> 9 апр. 2019 г., в 22:30, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> написал(а):
>
> The proposal is kind of cute, but I'll bet it's a net loss for
> small copy lengths --- likely we'd want some cutoff below which
> we do it with the dumb byte-at-a-time loop.
Ture.
I've made simple extension to compare decompression time on pgbench-generated WAL [0]
Use of smart memcpy unless match length is smaller than 16 (sane random value) gives about 20% speedup to decompression time.
Sole use of memcpy gives smaller effect.
We will dig into this further.
Best regards, Andrey Borodin.
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Tom Lane | 2019-04-16 13:37:42 | Re: Commit message / hash in commitfest page. |
| Previous Message | David Rowley | 2019-04-16 12:15:12 | Re: pg_dump is broken for partition tablespaces |