| From: | Alvaro Herrera <alvherre(at)commandprompt(dot)com> |
|---|---|
| To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
| Cc: | Gregory Stark <stark(at)enterprisedb(dot)com>, Hannu Krosing <hannu(at)skype(dot)net>, pgsql-hackers(at)postgresql(dot)org |
| Subject: | Re: has anyone looked at burstsort ? |
| Date: | 2007-07-13 15:29:16 |
| Message-ID: | 20070713152916.GC4839@alvh.no-ip.org |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
Tom Lane wrote:
> Gregory Stark <stark(at)enterprisedb(dot)com> writes:
> > The key to the algorithm is that it uses a trie to bin rows with common
> > leading prefixes together. This avoids performing redundant comparisons
> > between those columns later.
>
> Interesting, but doesn't that make it utterly useless for sorting in
> non-C locales?
It seems so. But on the other hand it might prove helpful for
multicolumn sorts (which removes the "datatype-specific" objection).
--
Alvaro Herrera Valdivia, Chile ICBM: S 39º 49' 18.1", W 73º 13' 56.4"
"No hay cielo posible sin hundir nuestras raíces
en la profundidad de la tierra" (Malucha Pinto)
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Stefan Kaltenbrunner | 2007-07-13 16:06:27 | GSSAPI on Solaris - psql segfault |
| Previous Message | Tom Lane | 2007-07-13 15:21:18 | Re: has anyone looked at burstsort ? |