Earlier quoted context omitted.
Can you give an example of a job that would be difficult or impossible to perform efficiently with Cascading, but Pangool gives an advantage over raw MapReduce?
Hi avibryant, According to our initial benchmark ( http://pangool.net/benchmark.html ), secondary sorting in Cascading is slow ( http://bit.ly/wTKOxo ), showing a 243% performance overhead compared to an efficient implementation in MapReduce. The implementation in MapReduce has a lot of lines ( http://bit.ly/yYGnGe ) whereas Pangool's implementation is quite simple ( http://bit.ly/x9U7Yj ). A common application of se…
I'm asking because in my experience the extra level of abstraction provided by Cascading, Crunch etc is a huge advantage, and if you're making a conscious choice to operate at a lower level, you better be getting something significant in return; it's not clear to me yet what that is.