A col-wise matrix.
A distributed Matrix, stored in coordinate format.
A distributed Matrix, stored in coordinate format. Operations are optimised assuming the matrix is both large and sparse, but shouldn't be too terrible for large dense matrixes.
A distributed row-wise matrix.
A distributed row-wise matrix. This is an efficient representation for multiplying by an in-memory vector. The contents of each row must be small enough to fit in memory
A distributed vector, stored in coordinate form.
A distributed vector, stored in coordinate form. Optimised for a huge spare vector, but should perform reasonably for a large dense vector too. If the vector is small (i.e. a few megabytes or less, you'll probably be better off with the in memory vectors instead
An efficient, dense vector that needs to be small enough to fit in memory.
An efficient, dense vector that needs to be small enough to fit in memory. It must be indexed by an int
A vector that is small enough to send to one mapper (i.e.
A vector that is small enough to send to one mapper (i.e. a few megs or less). Best suited for a sparse vector
A col-wise matrix. This is an efficient representation for multiplying by an in-memory vector. The contents of each column must be small enough to fit in memory