Re:Frequency Counting Algorithms Over Data Streams
by amelius on Monday July 20, 2015 @03:53PM
(#9918575)
Why not store the items in a random order? This can be achieved by performing a sort using a random key. Sorting can be done as a background job, so that the list is always "reasonably" random.
[ Parent
| on HN ]
Re:Frequency Counting Algorithms Over Data Streams
by mvogiatzis on Monday July 20, 2015 @07:32PM
(#9919773)
The items are stored in a map in random order (Red -> 45, Blue -> 23 etc). The picture makes it easier to read by showing many red boxes but the actual implementation just stores a number for each item label.