How much would the overhead of such an m/r be ? HashMap/Merge sort based grouping I assume
On Fri, Feb 19, 2010 at 5:28 AM, Ted Dunning <ted.dunn...@gmail.com> wrote: > Actually, this makes the case that we should have something like: > > microMapReduce(aggregatorFunction, aggregatorUnit, binaryMapFunction, > vectorA, vectorB) > > The name should be changed after its rhetorical effect has worn off. As > the > Chukwa guys tend to say, its turtles all the way down. We can have > map-reduce inside map-reduce. > > On Thu, Feb 18, 2010 at 3:41 PM, Robin Anil <robin.a...@gmail.com> wrote: > > > TODO: sum of minus to be optimised without having to hold the > intermediate > > vector. > > > > > > -- > Ted Dunning, CTO > DeepDyve >
