Please use this identifier to cite or link to this item: http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/5207
Title: Minimum Spanning Tree Algorithms in MapReduce Framework on Hadoop
Authors: Sharma, Mohit
Saha, Suman [Guided by]
Keywords: Cloud computing
MapReduce
Hadoop
WordCount algorithm
Java
C++
Issue Date: 2014
Publisher: Jaypee University of Information Technology, Solan, H.P.
Abstract: We live in a data age, it means that today there is big problem for processing the data. Data processing is required everywhere like industry, educational centers or research center. So handling of these types of huge data is big problem. Graphs are analyzed in many important contexts like page rank, protein-protein interaction networks, and analysis of social networks. Many graphs of interest are difficult to analyze because of their large size, often spanning millions of vertices and billions of edges. We believe that MapReduce has emerged as an enabling technology for large-scale distributed graph processing. Its functional abstraction provides an easy-to-understand model for designing scalable, distributed algorithms. The open-source Hadoop implementation of MapReduce has provided researchers with a powerful tool for tackling large-data problems.
URI: http://ir.juit.ac.in:8080/jspui//xmlui/handle/123456789/5207
Appears in Collections:Dissertations (M.Tech.)

Files in This Item:
File Description SizeFormat 
Minimum Spanning Tree Algorithms in MapReduce Framework on Hadoop.pdf4.38 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.