Timeline for What is the novelty in MapReduce?
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 10, 2012 at 18:36 | vote | accept | Raphael♦ | ||
| Aug 4, 2012 at 10:00 | comment | added | edA-qa mort-ora-y | @Raphael, I agree, but I'm not sure I can do that. However, I can observe, that as described here (first quote), merge sort uses the exact method of map/reduce. It can, indeed, be distributed with zero alteration. | |
| Aug 4, 2012 at 9:14 | comment | added | Raphael♦ | @edA-qamort-ora-y: In that case, we should be able to express MapReduce in older terms, and that would make for good answer! | |
| Aug 4, 2012 at 9:13 | comment | added | Raphael♦ | @Aryabhata: If there is novelty, this question has a good, constructive answer. If there is not, little can be said to prove so (except maybe reducing MapReduce to an older technique explicitly), true. But if you feel that way, by all means, vote! | |
| Aug 4, 2012 at 9:11 | history | edited | Raphael♦ | CC BY-SA 3.0 |
added 90 characters in body
|
| Aug 3, 2012 at 17:54 | answer | added | Massimo Cafaro | timeline score: 6 | |
| Aug 3, 2012 at 17:53 | comment | added | edA-qa mort-ora-y | There is no novelty. I won't make this an answer, but it is my strong opinion that nothing new in computation, or even distributed computing was discovered by MapReduce. | |
| Aug 3, 2012 at 17:47 | answer | added | Xodarap | timeline score: 3 | |
| Aug 3, 2012 at 17:43 | answer | added | Sasho Nikolov | timeline score: 22 | |
| Aug 3, 2012 at 16:38 | history | tweeted | twitter.com/#!/StackCompSci/status/231428816063565824 | ||
| Aug 3, 2012 at 15:14 | answer | added | Mike Samuel | timeline score: 48 | |
| Aug 3, 2012 at 14:04 | history | asked | Raphael♦ | CC BY-SA 3.0 |