2 ms·
> 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
by teo_zero 2y ago
> 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.
- yencabulator 2y agoThat 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.