CCF: Fast and scalable connected component computation in MapReduce

CCF: Fast and scalable connected component computation in MapReduce

                       CCF: Fast and scalable connected component computation in MapReduce.Finding connected components in a graph is a well-known problem in a wide variety of application areas such as social network analysis, data mining, image processing, and etc.In this paper, we present an efficient and scalable approach in MapReduce to find all the connected components in a given graph.

MapReduce-Projects

MapReduce-Projects

We compare our approach with the state-of-the-art on a real-world graph. We also demonstrate the viability of our approach on a massive graph with ~6B nodes and ~92B edges on an 80-node hadoop cluster. To the best of our knowledge, this is the largest graph publicly used in such an experiment.

Similar IEEE Project Titles


Work Progress

PHD - 24

M.TECH - 125

B.TECH -95

BIG DATA -110.

HADOOP -90.

ON-GOING Hadoop Projects

HADOOP MAP -90.

HADOOP YARN -27.

HADOOP HEBROS - 25.

HADOOP ZOOKEEPER -18.

Achievements – Hadoop Solutions

Hadoop-Projects-Achievement-Awards

Twitter Feed

Customer Review

Hadoop Solutions 5 Star Rating: Recommended 4.9 - 5 based on 1000+ ratings. 1000+ user reviews.