Data Engineering, Spark, Data.
longer need to use an amount of memory proportional to the number of items counted, and instead can use a constant amount of memory; in the KB range. It has O(log(log(n)) space complexity and constant O(1) time complexity Flajolet-Martin Algorithm → LogLog →SuperLogLog →HyperLogLog The basic idea