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

Поиск
Список
Период
Сортировка
От Mikheev, Vadim
Тема RE: btree split logic is fragile in the presence of lar ge index items
Дата
Msg-id 8F4C99C66D04D4118F580090272A7A23018C62@SECTORBASE1
обсуждение исходный текст
Ответы Re: btree split logic is fragile in the presence of large index items  (Tom Lane <tgl@sss.pgh.pa.us>)
Список 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 по дате отправления:

Предыдущее
От: "Oliver Elphick"
Дата:
Сообщение: Re: Shared library search paths
Следующее
От: Lamar Owen
Дата:
Сообщение: linux.h