RE: btree split logic is fragile in the presence of lar ge index items - Mailing list pgsql-hackers

From Mikheev, Vadim
Subject RE: btree split logic is fragile in the presence of lar ge index items
Date
Msg-id 8F4C99C66D04D4118F580090272A7A23018C62@SECTORBASE1
Whole thread Raw
Responses Re: btree split logic is fragile in the presence of large index items  (Tom Lane <tgl@sss.pgh.pa.us>)
List pgsql-hackers
> However, I'm not sure I believe the comment anymore: it has 
> not changed since Postgres95 and I can see that quite a bit of work has
> been done on the duplicate-key logic since then.  Furthermore findsplitloc
> itself sometimes ignores the claimed requirement: when it does the
> split-in-the-middle case quoted above, it does not pay attention to
> whether it is splitting in the middle of a group of duplicates.  (But

Ops. This is bug.

> that path is taken infrequently enough that it's possible it's just
> plain broken, and we haven't noticed.)
> 
> Does anyone know whether this comment still describes the btree
> equal-key logic accurately?

I think so.

Vadim


pgsql-hackers by date:

Previous
From: "Oliver Elphick"
Date:
Subject: Re: Shared library search paths
Next
From: Lamar Owen
Date:
Subject: linux.h