Hi,

-- Alvar Freude <[EMAIL PROTECTED]> wrote:

hmmm, for a typical page I need between 50 and 1000 hash lookups. And
sometimes more and sometimes fewer. But I'll make some tests

so, the results for a first test with small hash lookup are:
With forks::BerkeleyDB it is about 10 to 20 times slower then with an unshared hash and about 10 times faster as with the usual forks::shared.

That's pretty fast, but for my problem it seems that the solution with an extra daemon is better.


Ciao
 Alvar


--
** Alvar C.H. Freude, http://alvar.a-blast.org/
** http://www.assoziations-blaster.de/
** http://www.wen-waehlen.de/
** http://odem.org/

Attachment: pgpW2deYgSIOO.pgp
Description: PGP signature

Reply via email to