Re: Faster inserts with mostly-monotonically increasing values - Mailing list pgsql-hackers

From Andrey Borodin
Subject Re: Faster inserts with mostly-monotonically increasing values
Date
Msg-id B969C812-11E0-4DF2-8E61-52A0E348CF33@yandex-team.ru
Whole thread Raw
In response to Faster inserts with mostly-monotonically increasing values  (Pavan Deolasee <pavan.deolasee@gmail.com>)
List pgsql-hackers
Hi!
31 дек. 2017 г., в 11:44, Pavan Deolasee <pavan.deolasee@gmail.com> написал(а):
On a per-session basis, we cache the last heap block used for inserts and try to use the same block for subsequent inserts.
+1, from my POV this is good idea and it's cool that it already has implementation.
I'd suggest to do not 1\1 split for these pages, to keep tree lower. Like fillfactor/(1-fillfactor) split. Also, this will make splits less frequent.

Best regards, Andrey Borodin.

pgsql-hackers by date:

Previous
From: John Naylor
Date:
Subject: Re: MCV lists for highly skewed distributions
Next
From: Arthur Zakirov
Date:
Subject: Re: [PROPOSAL] Shared Ispell dictionaries