Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re: Questions about BerkeleyDB

by starbolin (Hermit)
on Jun 14, 2008 at 08:20 UTC ( [id://692062]=note: print w/replies, xml ) Need Help??


in reply to Questions about BerkeleyDB

Poor performance is due the keys not being sorted. One million partially sorted keys on my 500MHz P4 takes 2 minutes. For random keys I only get one tenth the keys stored in that same time or 100k keys in 2 minutes 18. Extrapolating with my numbers it would take a minimum of 6 hours to store 17 million unsorted keys on my system; that's ignoring that larger BTrees take longer to access. Since most of the time is taken up sorting the keys I don't see where changes in parameters will have much effect. This is the price we pay for being able to do random access recall.

The best you could do is buy a faster processor. Nevertheless, things to try are: Verify that your page size is equal to your disk page size. Set your cache size as high as possible within limits of performance for the rest of the system. Are there other users on your system? If no turn of transactions. Are you running out of memory? Look at the output from top.


s//----->\t/;$~="JAPH";s//\r<$~~/;{s|~$~-|-~$~|||s |-$~~|$~~-|||s,<$~~,<~$~,,s,~$~>,$~~>,, $|=1,select$,,$,,$,,1e-1;print;redo}

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://692062]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others musing on the Monastery: (1)
As of 2024-04-24 14:09 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found