On Jan 15, 2008, at 18:08, Ted Dunning wrote:
> One option that should work reasonably well is to have
each mapper
> output
> with a constant key (as Rui suggests) and use a
combiner to pre-
> select the
> top N elements. Communication between mappers and
combiners is very
> fast,
> so this will be just about as fast as was originally
suggested. The
> cost of
> the final single reducer will be so small as to be
unmeasurable.
Ah, I see. That should work. Thanks! I am still learning how
to do
things in
this map/reduce paradigm.
Vadim
|