http://www.perlmonks.org?node_id=11135145


in reply to Re^4: efficient perl code to count, rank
in thread efficient perl code to count, rank

Just a reminder, you were the first one suggesting that the OP needs more RAM, see Re: efficient perl code to count, rank

Anything can be done with Perl, but search and sort operations requiring Perl to keep all data in memory are usually easier solved (read out-of-the-box) with a DB.

Otherwise they require re-implementing sophisticated algorithms to manually "swap" RAM and Disk structures, which doesn't qualify as out-of-the-box for me.

NB: But IF the OP really needs such operations is still unclear!

We are still speculating what exactly he wanted to be ranked/sorted. (like demonstrated, sorting 14m entries is still feasible in RAM with Perl under 2min, but how does it scale with larger data?)

Cheers Rolf
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery