Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

RE: Efficiency and Large Arrays

by lhoward (Vicar)
on Jul 23, 2000 at 01:46 UTC ( [id://23930]=note: print w/replies, xml ) Need Help??


in reply to Efficiency and Large Arrays

If you have the memory to spare and efficiency is of utmost importance, then by all means load as much as you can into memory. If memory is tight or you can deal with longer runtimes (and more disk IO) then store the data in some sort of persistant storage (SQL DB, hash tied to a DBM file, etc...). This is the classic space vs. performance tradeoff. You are going to have to decide which is more important to you in your particular circumstances.

Replies are listed 'Best First'.
RE: RE: Efficiency and Large Arrays
by Kozz (Friar) on Jul 23, 2000 at 01:50 UTC
    Well, it all gets loaded into memory (currently), which is fine by me. Let it gobble the memory if it's necessary. But the issue is that the entire process is still too slow.
    *scratches head*
      I would recomend using a profiler like the Devel::DProf module to profile your code and try and isolate the bottlenecks.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others studying the Monastery: (6)
As of 2024-04-23 21:16 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found