Re: Progress on fast path sorting, btree index creation time

Поиск
Список
Период
Сортировка
От Peter Geoghegan
Тема Re: Progress on fast path sorting, btree index creation time
Дата
Msg-id CAEYLb_Vc0ovDG+3vghF0ZeiCs1qAMBbZ9f4eG62mp=pnFHGGcA@mail.gmail.com
обсуждение исходный текст
Ответ на Re: Progress on fast path sorting, btree index creation time  (Robert Haas <robertmhaas@gmail.com>)
Ответы Re: Progress on fast path sorting, btree index creation time  (Bruce Momjian <bruce@momjian.us>)
Список pgsql-hackers
On 9 February 2012 14:51, Robert Haas <robertmhaas@gmail.com> wrote:
> I'm not sure I entirely follow all this, but I'll look at the code
> once you have it.  Are you saying that all the comparetup_yadda
> functions are redundant to each other in the single-key case?

Yes, I am. The main reason that the loops exist in those functions
(which is the only way that they substantially differ) is because they
each have to get the other keys through various ways that characterise
the tuple class that they encapsulate (index_getattr(),
heap_getattr(), etc).

--
Peter Geoghegan       http://www.2ndQuadrant.com/
PostgreSQL Development, 24x7 Support, Training and Services


В списке pgsql-hackers по дате отправления:

Предыдущее
От: Tom Lane
Дата:
Сообщение: Re: [COMMITTERS] pgsql: Add new keywords SNAPSHOT and TYPES to the keyword list in gram.
Следующее
От: "Kevin Grittner"
Дата:
Сообщение: Notify system doesn't recover from "No space" error