Be the first to like this
Chapter 4 of Data-Intensive Text Processing with Map Reduce introduce the efficiently map-reduce algorithm, pairs and stripes. It show how to use these two algorithm to contrust the co-occurrence matrix. It compare the time complexity between pairs and stripes algorithms. According to the experiments, the stripes algorithm have the better efficiency than pairs algorithm.