RE: btree split logic is fragile in the presence of lar ge index items

From: "Mikheev, Vadim" <vmikheev(at)SECTORBASE(dot)COM>
To: "'Tom Lane'" <tgl(at)sss(dot)pgh(dot)pa(dot)us>, pgsql-hackers(at)postgreSQL(dot)org
Subject: RE: btree split logic is fragile in the presence of lar ge index items
Date: 2000-07-18 22:47:10
Message-ID: 8F4C99C66D04D4118F580090272A7A23018C62@SECTORBASE1
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: 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

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Oliver Elphick 2000-07-18 22:47:38 Re: Shared library search paths
Previous Message Mark Dalphin 2000-07-18 21:55:35 Re: Shared library search paths