Yup, I actually started off using DBM::Deep, but realized that my dataset could squeeze into memory and so switched away from that. The DBM::Deep implementation takes quite a bit longer to run than the in-memory version (30 days vs. 12 hours based on two trials).
Also, the output (until the program crashes at least) looks perfectly normal. No blank or duplicate rows appear, its just as some point the system runs out of memory during output.
In reply to Re^2: Outputting Huge Hashes
by bernanke01
in thread Outputting Huge Hashes
by bernanke01
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |