# SlowerLogLog

DevFeed: [SlowerLogLog](<https://devfeed.tech/articles/slowerloglog-37899.md>)

Original publisher: [Read original article](<https://www.evanmiller.org/slower-log-log.html>)

Author: Evan Miller

Published: 2020-02-06T18:00:00Z

Content type: article

Language: en

Sources: [Evan Miller](<https://devfeed.tech/sources/evan-miller.md>)

Topics: [Data structures](<https://devfeed.tech/topics/data-structures.md>), [Algorithm](<https://devfeed.tech/topics/algorithm.md>), [math](<https://devfeed.tech/topics/math.md>), [hash](<https://devfeed.tech/topics/hash.md>), [implementation](<https://devfeed.tech/topics/implementation.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [data-structure](<https://devfeed.tech/tags/data-structure.md>), [hash](<https://devfeed.tech/tags/hash.md>), [implementation](<https://devfeed.tech/tags/implementation.md>), [math](<https://devfeed.tech/tags/math.md>), [probabilistic](<https://devfeed.tech/tags/probabilistic.md>)

## AI overview

This article introduces SlowerLogLog, a variation of HyperLogLog for estimating the number of unique elements in a set. It explains how Maximum Likelihood Estimation can estimate cardinality and standard error, support small cardinalities, and avoid requiring a power-of-two register count. The method is easier to derive and implement but much more computationally expensive because each element is hashed once per register.

## Source excerpt

What rolls down stairs and counts unique items imprecisely? HyperLogLog. Also SlowerLogLog