Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Bloom Filters: More than a space-efficient hashmap. Parent comment
HyperLogLog (and variants) can do the union part as well, and need much less space than Bloom filters thought. For large sets, that is. For cardinality smaller than e.g. 100, Bloom filters are better.
Also another alternative is Theta datasketches.
HyperLogLog (and variants) can do the union part as well, and need much less space than Bloom filters thought. For large sets, that is. For cardinality smaller than e.g. 100, Bloom filters are better.