Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re^4: Sorting data that don't fit in memory (DBM::Deep)

by tye (Sage)
on Oct 10, 2007 at 17:24 UTC ( #644035=note: print w/replies, xml ) Need Help??


in reply to Re^3: Sorting data that don't fit in memory (DBM::Deep)
in thread Sorting data that don't fit in memory

Then you might want to test your suggestion of using sort on an enormous DBM::Deep'd array. I'm not convinced that it will be easy to actually avoid using huge amounts of memory or that it will be reasonably fast. More detailed instructions on how to accomplish the former might be helpful and you might find improvements to make while looking at the latter.

- tye        

  • Comment on Re^4: Sorting data that don't fit in memory (DBM::Deep)

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (4)
As of 2020-11-01 01:45 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My favourite web site is:












    Results (291 votes). Check out past polls.

    Notices?