3 ms·
It's mentioned, albeit in the second-last line of the whole presentation, as a possible reaction to GPU-based sorting in the future.
by Alexss 11y ago
It's mentioned, albeit in the second-last line of the whole presentation, as a possible reaction to GPU-based sorting in the future.
- Ono-Sendai 11y agoOk. Because you can radix sort on CPU and it's a lot faster than e.g. quicksort in my experience.
- zkzkz 11y agoPostgres has an extensible type system so Radix sort isn't really suitable, it really needs a comparison sort. For SSE/MMX/AVX/etc or GPU sorts it would have to use integer or floating point surrogate keys. It would probably be the same abbreviated keys mentioned in the last few slides. That could be a radix sort but generally I think bitonic sort is preferred.
- Jweb_Guru 11y ago> Postgres has an extensible type system so Radix sort isn't really suitable, it really needs a comparison sort. That's not quite true. It supports string tries, for example (using SP-GIST). Such operations just have to be built for specific types. I think it would be more accurate to say that (AFAICT) Postgres doesn't currently have any way to extend the optimizer with custom plans (though it's been a very popular feature suggestion).
- anarazel 11y ago> I think it would be more accurate to say that (AFAICT) Postgres doesn't currently have any way to extend the optimizer with custom plans (though it's been a very popular feature suggestion). There's http://www.postgresql.org/docs/devel/static/custom-scan.html http://www.postgresql.org/docs/devel/static/custom-scan.html