| From: | Markus Schaber <schabi(at)logix-tt(dot)com> |
|---|---|
| To: | pgsql-performance(at)postgresql(dot)org, pgsql-hackers(at)postgresql(dot)org |
| Subject: | Re: qsort again (was Re: [PERFORM] Strange Create Index |
| Date: | 2006-02-16 13:44:45 |
| Message-ID: | 43F481CD.2010509@logix-tt.com |
| Views: | Whole Thread | Raw Message | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers pgsql-performance |
Hi, Ron,
Ron wrote:
> ...and of course if you know enough about the data to be sorted so as to
> constrain it appropriately, one should use a non comparison based O(N)
> sorting algorithm rather than any of the general comparison based
> O(NlgN) methods.
Sounds interesting, could you give us some pointers (names, URLs,
papers) to such algorithms?
Thanks a lot,
Markus
--
Markus Schaber | Logical Tracking&Tracing International AG
Dipl. Inf. | Software Development GIS
Fight against software patents in EU! www.ffii.org www.nosoftwarepatents.org
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Jonah H. Harris | 2006-02-16 14:19:44 | Re: qsort again (was Re: [PERFORM] Strange Create Index |
| Previous Message | Alvaro Herrera | 2006-02-16 13:39:13 | Re: Doubt in parser |
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Jonah H. Harris | 2006-02-16 14:19:44 | Re: qsort again (was Re: [PERFORM] Strange Create Index |
| Previous Message | Ron | 2006-02-16 13:38:45 | Re: [PERFORM] qsort again |