>From Wikipedia: >Thus the MapReduce framework transforms a list of (key, value) pairs into a >list of values. This behavior is different from the functional programming map >and reduce combination, >which accepts a list of arbitrary values and returns >one single value that combines all the values returned by map.
And what would be the difference to use a parallel algorithm such as Prim's or Dijkstra!? On Oct 22, 7:11 pm, Kishen Das <[email protected]> wrote: > MapReduce is the best option . > > For the word count its explained here -http://en.wikipedia.org/wiki/MapReduce > > Interesting thing is that the Map step can easily be made parallel. > > Once again I request the members of this group to go through all the > parallel constructs. ( Parallel sorting, Parallel collections, etc ) > Its cool to optimize sequential programs, but with GPUs and ever increasing > cores, you should start thinking in terms of parallelizing your code. > > Kishen > > On Fri, Oct 22, 2010 at 9:24 AM, ligerdave <[email protected]> wrote: > > for a large file, you probably would want to use external sort. kinda > > like a map-reduce concept. it's actually how sort&uniq kinda stuff > > work in unix/linux when you try to find some "TOP X" > > > again, we are talking about the memory might not hold the entire file > > > On Oct 21, 9:35 am, "Vinay..." <[email protected]> wrote: > > > how do u find 10 most repeating words on a large file containing words > > > in most efficient way...if it can also be done using heapsort plz post > > > ur answers.. > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To post to this group, send email to [email protected]. > > To unsubscribe from this group, send email to > > [email protected]<algogeeks%[email protected]> > > . > > For more options, visit this group at > >http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
