Mentioning this here as well as at Re^2: Sparse Matrix Multiplication Problem: I'd suggest PDL::CCS (collapsed-column storage).

Alternatively, if one wanted a non-sparse representation, you can use a memory-mapped file with PDL::IO::FastRaw