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


The stupid question is the question not asked
	PerlMonks

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

by tye (Sage)

on Oct 10, 2007 at 17:24 UTC ( [id://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