This is from Ch.4 and 5 of Lyn and Dyer. Ch.4 is on MR invwrted index and Ch.5 is on graph algorithms.
Web search problem has three major components: web crawling, inverted index development and information retrieval. See Web search
Web crawling and inverted index are done offline to facilitate a fast realtime response for IR. We will begin with an example. Then we will look at MR algs for inverted indexing. We will begin with a baseline implementation, and then a revised one
Graph algorithms: We will discuss graph problems, graph representations
We will discuss Dijkstra's algorithm and then MR alg for paralell breadth first search for large graphs
We will move onto pagerank algorithm as specified in Ch.5