From: | Mark Kirkwood <markir(at)paradise(dot)net(dot)nz> |
---|---|
To: | Mike Castle <dalgoda(at)ix(dot)netcom(dot)com> |
Cc: | pgsql-general(at)postgresql(dot)org |
Subject: | Re: qsort (was Re: Solaris) |
Date: | 2003-05-14 20:35:49 |
Message-ID: | 3EC2A8A5.4010408@paradise.net.nz |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-general |
Mike Castle wrote:
>First I added a counter to the compare function, and the most cases, the
>glibc implementation was called significantly less often than the BSD
>compare function.
>
>
Interesting - all examples I tried had glibc compare count higher, do
you want to post one of yours?
>In a simple test function, like comparing two ints, then yes, the BSD
>implementation was faster. But in a more complex function, say comparing
>strings, often times the glibc version was faster. Why? Because the
>time spent in the compare function became the overwhelming factor.
>
>
Considering strings is a good point - I went away and tried some
examples, unfortunately I only managed to see BSD faster, but the
difference was not as large as in the integer tests.
regards
Mark
From | Date | Subject | |
---|---|---|---|
Next Message | Tom Lane | 2003-05-14 21:08:37 | Re: dump/restore to 7.4devel giving "[archiver (db)] error returned by PQputline" |
Previous Message | Tilo Schwarz | 2003-05-14 19:33:49 | ERROR: Memory exhausted in AllocSetAlloc(188) |