Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

> very easy to partition and process in chunks

Which counters to increment at each byte depends on the previous bytes, though. You could probably succeed using overlapping chunks, but I wouldn't call it very easy.



That sort of "find the correct chunk boundary" logic was very common with all the mapreduce processing that was done when people still used the phrase big data.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: