| From: | Eliot Gable <egable+pgsql-performance(at)gmail(dot)com> |
|---|---|
| To: | Joe Conway <mail(at)joeconway(dot)com> |
| Cc: | Robert Haas <robertmhaas(at)gmail(dot)com>, Merlin Moncure <mmoncure(at)gmail(dot)com>, Craig Ringer <craig(at)postnewspapers(dot)com(dot)au>, Craig James <craig_james(at)emolecules(dot)com>, pgsql-performance(at)postgresql(dot)org |
| Subject: | Re: Highly Efficient Custom Sorting |
| Date: | 2010-07-06 20:17:47 |
| Message-ID: | AANLkTikJZvJ3v5nzLRSvXdVL3WUKOd6_qfUU4Re5Qp93@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-performance |
On Tue, Jul 6, 2010 at 4:00 PM, Joe Conway <mail(at)joeconway(dot)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.
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Stephen Frost | 2010-07-06 20:26:23 | Re: Question about partitioned query behavior |
| Previous Message | Joe Conway | 2010-07-06 20:00:33 | Re: Highly Efficient Custom Sorting |