I was thinking about this for a bit, so...
Map would take the input and write into the persistent storage
something like:
A 1
B 1
A 1
...
Then it is sorted like:
A 1
A 1
...
B 1
Then the input for the reduce is a key and a list of values for the
same key, as in:
A 1 1 ...
B 1 ...
Right ?
On May 19, 12:05 am, Peter Dolan <
peterjdo...@gmail.com> wrote:
> Mapping is done in parallel, and Reducing is done in parallel. Take a look
> at the wikipedia page, it should clarify the concept for you. This is just
> an implementation of that, using CPU time on an HTTP server to do the
> mapping processing and reducing processing, and handling parallelizing the
> requests that trigger those operations.
>
>
>
> On Tue, May 18, 2010 at 10:07 AM, Isaac Llamas <
kpu...@gmail.com> wrote:
> > I still don't know at which step the scalability comes into place. I belive
> > you have to do several requests to the application for it to scale, but I
> > just can't see where or when.
>
> > Thanks for your replies, they are helping a lot.
>
> > 2010/5/18 Peter Dolan <
peterjdo...@gmail.com>
> >>> 2010/5/18 Peter Dolan <
peterjdo...@gmail.com>
>
> >>>> Hi Isaac,
>
> >>>> Yeah, you basically just described map-reduce. Take a look at
> >>>>
http://en.wikipedia.org/wiki/MapReducefor a broad overview of how
> >>>>>
httpmr-discus...@googlegroups.com<
httpmr-discuss%2Bunsu...@googlegroups.com>
> >>>>> .
> >>>>
httpmr-discus...@googlegroups.com<
httpmr-discuss%2Bunsu...@googlegroups.com>
> >>>> .
> >>>
httpmr-discus...@googlegroups.com<
httpmr-discuss%2Bunsu...@googlegroups.com>
> >>> .
> >>
httpmr-discus...@googlegroups.com<
httpmr-discuss%2Bunsu...@googlegroups.com>
> >> .
> >
httpmr-discus...@googlegroups.com<
httpmr-discuss%2Bunsu...@googlegroups.com>
> > .
> For more options, visit this group athttp://
groups.google.com/group/httpmr-discuss?hl=en.