2024/02/21 by Otmar Ertl, Ertl, Otmar · 2 voices
Computer Science · #cs.DS #cs.DB
paper · pdf · doi:10.48550/arxiv.2402.13726
This work introduces ExaLogLog, a new data structure for approximate distinct counting, which has the same practical properties as the popular HyperLogLog algorithm. It is commutative, idempotent, mergeable, reducible, has a constant-time insert operation, and supports distinct counts up to the exa-scale. At the same time, as theoretically derived and experimentally verified, it requires 43% less space to achieve the same estimation error.