Re: Highly Efficient Custom Sorting

Поиск
Список
Период
Сортировка
От Eliot Gable
Тема Re: Highly Efficient Custom Sorting
Дата
Msg-id AANLkTikJZvJ3v5nzLRSvXdVL3WUKOd6_qfUU4Re5Qp93@mail.gmail.com
обсуждение исходный текст
Ответ на Re: Highly Efficient Custom Sorting  (Joe Conway <mail@joeconway.com>)
Ответы Re: Highly Efficient Custom Sorting
Список pgsql-performance

On Tue, Jul 6, 2010 at 4:00 PM, Joe Conway <mail@joeconway.com> wrote:


This approach works, but you could also use the SFRM_Materialize mode
and calculate the entire result set in one go. That tends to be simpler.
See, for example crosstab_hash() in contrib/tablefunc for an example.

FWIW, there are also some good examples of array handling in PL/R, e.g.
pg_array_get_r() in pg_conversion.c


 Thanks. That looks like less code and probably will be slightly more efficient.

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

Предыдущее
От: Joe Conway
Дата:
Сообщение: Re: Highly Efficient Custom Sorting
Следующее
От: Stephen Frost
Дата:
Сообщение: Re: Question about partitioned query behavior