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

Поиск
Список
Период
Сортировка
От Robert Haas
Тема Re: Progress on fast path sorting, btree index creation time
Дата
Msg-id CA+TgmobJGT=pOs_yOO6qO2KcKe6VZg3Hmf68cSh_99d+gf+DFA@mail.gmail.com
обсуждение исходный текст
Ответ на Re: Progress on fast path sorting, btree index creation time  (Peter Geoghegan <peter@2ndquadrant.com>)
Ответы Re: Progress on fast path sorting, btree index creation time  (Peter Geoghegan <peter@2ndquadrant.com>)
Список pgsql-hackers
On Wed, Feb 8, 2012 at 1:48 PM, Peter Geoghegan <peter@2ndquadrant.com> wrote:
> That was clear from an early stage, and is something that I
> acknowledged way back in September

OK, so why didn't/don't we do and commit that part first, and then
proceed to argue about the remainder once it's in?

> I think that there may be additional benefits from making the
> qsort_arg specialisation look less like a c stdlib one, like refining
> the swap logic to have compile-time knowledge of the type it is
> sorting. I'm thinking that we could usefully trim quite a bit from
> this:

That's an interesting idea, which seems worth pursuing, though
possibly not for 9.2.

-- 
Robert Haas
EnterpriseDB: http://www.enterprisedb.com
The Enterprise PostgreSQL Company


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

Предыдущее
От: Robert Haas
Дата:
Сообщение: Re: CLOG contention, part 2
Следующее
От: Dan Scales
Дата:
Сообщение: Re: double writes using "double-write buffer" approach [WIP]