ExaLogLog: Space-Efficient and Practical Approximate Distinct Counting up to the Exa-Scale
<|reference_start|>ExaLogLog: Space-Efficient and Practical Approximate Distinct Counting up to the Exa-Scale: 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.<|reference_end|>
@article{ertl2024exaloglog:,
    title={ExaLogLog: Space-Efficient and Practical Approximate Distinct Counting
  up to the Exa-Scale},
    author={Otmar Ertl},
    journal={arXiv preprint arXiv:2402.13726},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.13726},
    primaryClass={cs.DS cs.DB}
}