3 The above graph shows the a sample of the internet of 5 pages with the...

Transcribed Image Text:

3 The above graph shows the a sample of the internet of 5 pages with the edges representing the links between the pages. Express the graph as an adjacency matrix and a sparse transition matrix stored on HDFS in CSV format. If the HDFS file containing keys 1,5 are in block 1 and 2,3,4 are in block 2, then compute page rank for one iteration using Map Reduce. Show keys of mappers and reducers and how the keys are transferred between the 2 mappers and the reducer(Assume a single reducer is used. Assume initial page rank of all the pages is 1 and this is already available to the mapper.) c) If you need to export the page rank obtained out to an SQL database after the computation, which tool would you use? 3 The above graph shows the a sample of the internet of 5 pages with the edges representing the links between the pages. Express the graph as an adjacency matrix and a sparse transition matrix stored on HDFS in CSV format. If the HDFS file containing keys 1,5 are in block 1 and 2,3,4 are in block 2, then compute page rank for one iteration using Map Reduce. Show keys of mappers and reducers and how the keys are transferred between the 2 mappers and the reducer(Assume a single reducer is used. Assume initial page rank of all the pages is 1 and this is already available to the mapper.) c) If you need to export the page rank obtained out to an SQL database after the computation, which tool would you use?

Answer rating: 100% (QA)

To solve this Ill address each part step by step a Expressing the graph as an adjacency matrix and a sparse transition matrix stored on HDFS in CSV fo... View the full answer