Home | About | Sematext search-lucene.com search-hadoop.com
 Search Hadoop and all its subprojects:

Switch to Threaded View
HDFS >> mail # user >> how to design the mapper and reducer for the below problem


Copy link to this message
-
Re: how to design the mapper and reducer for the below problem
This is a Graph problem, you want to find all joined sub graphs, so i don't
think it's easy using Map/Reduce.

but  you can try Yarn, it can be iterated easily, at least compared with
M/R.

On Fri, Jun 14, 2013 at 12:41 PM, parnab kumar <[EMAIL PROTECTED]>wrote:

> Consider a following input file of format :
> input File :
> 1 2
> 2 3
> 3 4
> 6 7
> 7 9
> 10 11
>
> The output Should be as follows :
>
> 1 2 3 4
> 6 7 9
> 10 11