Re: Faster inserts with mostly-monotonically increasing values

From: Andrey Borodin <x4mmm(at)yandex-team(dot)ru>
To: Pavan Deolasee <pavan(dot)deolasee(at)gmail(dot)com>
Cc: pgsql-hackers <pgsql-hackers(at)postgresql(dot)org>, Simon Riggs <simon(dot)riggs(at)2ndquadrant(dot)com>, Peter Geoghegan <pg(at)bowt(dot)ie>
Subject: Re: Faster inserts with mostly-monotonically increasing values
Date: 2017-12-31 14:05:34
Views: Raw Message | Whole Thread | Download mbox | Resend email
Lists: pgsql-hackers

> 31 дек. 2017 г., в 11:44, Pavan Deolasee <pavan(dot)deolasee(at)gmail(dot)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.

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Arthur Zakirov 2017-12-31 15:28:13 Re: [PROPOSAL] Shared Ispell dictionaries
Previous Message John Naylor 2017-12-31 12:01:55 Re: MCV lists for highly skewed distributions