Just considering, single table doesn't need much time to full scan. So, if each row of matrix A have one mapreduce job, it'll be fast. (Of course, there is a N time iterations.)
for(int i = 0; i < A.getColumns(); i++) {
// run Job
}
What do you think?
--
Best Regards, Edward J. Yoon
[email protected]
http://blog.udanax.org
