I might suggest a new definition for "Big Data" - Data, whose size is greater than fits in one machine's memory.
For example 1TB of data won't fit in memory, but if all you need to do is a sequential read in under a day then it's not a problem.
11–20 of 54 posts
I might suggest a new definition for "Big Data" - Data, whose size is greater than fits in one machine's memory.
For example 1TB of data won't fit in memory, but if all you need to do is a sequential read in under a day then it's not a problem.
I might suggest a new definition for "Big Data" - Data, whose size is greater than fits in one machine's memory.
BTW, some previous HN discussions along these lines:
"Don't use Hadoop - your data isn't that big " - https://www.chrisstucchio.com/blog/2013/hadoop_hatred.html and https://news.ycombinator.com/item?id=6398650
"Your data fits in RAM " - http://yourdatafitsinram.com/ - https://news.ycombinator.com/item?id=9581862
Then why big data land is dominated by JVM-based frameworks?
http://codexpi.com/java-vs-cpp-performance-comparison-jit-co...
http://stackoverflow.com/questions/5641356/why-is-it-that-by...
http://beautynbits.blogspot.com/2013/01/performance-java-vs-...
Then why big data land is dominated by JVM-based frameworks?
You assume that JVM is slow, yes? That's not always the case. Interestingly, there's cases where JVM applications run just as fast as if not faster than native code. This blows my mind, as a C++ programmer myself. http://codexpi.com/java-vs-cpp-performance-comparison-jit-co... http://stackoverflow.com/questions/5641356/why-is-it-that-by... http://beautynbits.blogspot.com/2013/01/performance-java-vs-...
So no, it's not "every" CPU cycle, it's the ones that scale with the highest dimension of your data that matter. Which is the same old story we have always had, save your energy for optimising the parts that matter, because the ones that matter probably matter orders of magnitudes more than the ones that don't.
Earlier quoted context omitted.
You assume that JVM is slow, yes? That's not always the case. Interestingly, there's cases where JVM applications run just as fast as if not faster than native code. This blows my mind, as a C++ programmer myself. http://codexpi.com/java-vs-cpp-performance-comparison-jit-co... http://stackoverflow.com/questions/5641356/why-is-it-that-by... http://beautynbits.blogspot.com/2013/01/performance-java-vs-...
Once compiled to native code, which it will be for big data because the same classes are reused over and over, I would assume it would be in same ball-park as C/C++ code.
A lot of big-data work involves pulling out struct fields from a deeply nested composite record, and then performing some manipulation on them.
Would love to see if the performance bump is highly significant on a much larger and complex data set.
Then why big data land is dominated by JVM-based frameworks?
So, now they have a few million Java jockeys churning away and a few million person-decades of work put into their mud piles. When starting any new project, there isn't much question about how to build it: More Mud!
In my experience, CPU is rarely the big issue when dealing with a lot of data (I am talking about tens of PB per day). IO is the main problem and designing systems that move the least amount of data is the real challenge.