Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change

Re^2: Memory Efficient Alternatives to Hash of Array

by dragonchild (Archbishop)
on Dec 29, 2008 at 03:25 UTC ( #732953=note: print w/ replies, xml ) Need Help??

in reply to Re: Memory Efficient Alternatives to Hash of Array
in thread Memory Efficient Alternatives to Hash of Array

As the maintainer of DBM::Deep, I need to echo tilly here. While dbm-deep can allow you to address such large datasets (>4G requires 64-bit Perl just because 32 bits only addresses 4G and change), it is going to be very slow. Just building the 4G file can take a very long time. Sorting a large array (>10k entries, roughly) in dbm-deep will take a very very long time.

While one of dbm-deep's use cases is dealing with data that's too large to fit in RAM, you really want to have that happen with lookups, not when dealing with large datasets. There are other languages and setups better suited for this, such as Erlang or CouchDB.

My criteria for good software:
  1. Does it work?
  2. Can someone else come in, make a change, and be reasonably certain no bugs were introduced?

Comment on Re^2: Memory Efficient Alternatives to Hash of Array

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (5)
As of 2015-11-28 14:56 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (742 votes), past polls