Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re: Efficient memory

by jlongino (Parson)
on Nov 05, 2002 at 16:56 UTC ( #210511=note: print w/ replies, xml ) Need Help??


in reply to Efficient memory

I agree with rdfield and think that it would be worthwhile to give Storable a try. Why? because it is simple, faster than MLDBM, and you could probably write/test throwaway scripts in less than 15 minutes:

use strict; use warnings; use Storable qw(nstore); my %data; ## sub that loads hash GetData('data.txt', \%data); ## store to disk nstore (\%data, "data.nstore");
To retrieve:
use strict; use warnings; use Storable qw(retrieve); my %data = %{ retrieve("data.nstore") };
I use storable on data structures of the form data{a}{b}{c} for employee records. The flat text file is 1.5MB (5000 records), the nstored version is 3.5MB and it takes less than 2 seconds to store or retrieve. Try it and decide for yourself.

--Jim


Comment on Re: Efficient memory
Select or Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (4)
As of 2015-07-04 01:00 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (57 votes), past polls