On Tue, Aug 6, 2024 at 5:42 PM Matthias van de Meent
wrote:
> Attached is version 16 now.
I ran this with my old land registry benchmark, used for validating
the space utilization impact of nbtree deduplication (among other
things). This isn't obviously the best benchmark for this sort of
thing,
On Fri, 1 Mar 2024 at 14:48, Matthias van de Meent
wrote:
> Attached is version 15 of this patch, with the above issues fixed.
> It's also rebased on top of 655dc310 of this morning, so that should
> keep good for some time again.
Attached is version 16 now. Relevant changes from previous patch v
On Wed, 24 Jan 2024 at 13:02, Matthias van de Meent
wrote:
> > 1.
> > Commit message refers to a non-existing reference '(see [0])'.
>
> Noted, I'll update that.
>
> > 2.
> > +When we do a binary search on a sorted set (such as a BTree), we know that
> > a
> > +tuple will be smaller than its left
On Fri, 19 Jan 2024 at 05:55, Dilip Kumar wrote:
>
> On Wed, Nov 1, 2023 at 2:42 AM Matthias van de Meent
> wrote:
> >
> > Hi,
> >
> > Currently, nbtree code compares each and every column of an index
> > tuple during the binary search on the index page. With large indexes
> > that have many dupl
On Wed, Nov 1, 2023 at 2:42 AM Matthias van de Meent
wrote:
>
> Hi,
>
> Currently, nbtree code compares each and every column of an index
> tuple during the binary search on the index page. With large indexes
> that have many duplicate prefix column values (e.g. an index on (bool,
> bool, uuid) )
st 1. 11. 2023 v 11:32 odesílatel Matthias van de Meent <
boekewurm+postg...@gmail.com> napsal:
> On Wed, 1 Nov 2023 at 07:47, Pavel Stehule
> wrote:
> >
> > Hi
> >
> > út 31. 10. 2023 v 22:12 odesílatel Matthias van de Meent <
> boekewurm+postg...@gmail.com> napsal:
> >> This patch was originall
On Wed, 1 Nov 2023 at 07:47, Pavel Stehule wrote:
>
> Hi
>
> út 31. 10. 2023 v 22:12 odesílatel Matthias van de Meent
> napsal:
>> This patch was originally suggested at [0], but it was mentioned that
>> they could be pulled out into it's own thread. Earlier, the
>> performance gains were not cl
Hi
út 31. 10. 2023 v 22:12 odesílatel Matthias van de Meent <
boekewurm+postg...@gmail.com> napsal:
> Hi,
>
> Currently, nbtree code compares each and every column of an index
> tuple during the binary search on the index page. With large indexes
> that have many duplicate prefix column values (e
Hi,
Currently, nbtree code compares each and every column of an index
tuple during the binary search on the index page. With large indexes
that have many duplicate prefix column values (e.g. an index on (bool,
bool, uuid) ) that means a lot of wasted time getting to the right
column.
The attached
