[ On Thursday, January 23, 2003 at 12:06:36 (+0100), Nico Erfurth wrote: ]
> Subject: Re: [Exim] Performance comparison, LDAP vs. lsearch
>
> You are comparing apples and oranges.
> Lsearch is really slow, does not use indexing, and with more entries it
> becomes slower and slower.
> If you want a filebased system, use dbm, or better cdb.
Depending on the size of the table a linear search, especially on a
modern OS with good disk buffer caching, is potentially ALWAYS faster
than any other kind of table lookup. E.g. for smaller tables it can
even be faster than a binary search.
Any kind of back-end database engine is probably ALWAYS going to be
slower than any other method. The reasons people pay the price for
using a back-end database such as LDAP are entirely at the other end of
things.
--
Greg A. Woods
+1 416 218-0098; <g.a.woods@???>; <woods@???>
Planix, Inc. <woods@???>; VE3TCP; Secrets of the Weird <woods@???>
