HyperLogLog

id: hyperloglog-210-3511867
title: HyperLogLog
text: HyperLogLog is an algorithm for the count-distinct problem, approximating the number of distinct elements in a multiset. Calculating the exact cardinality of the distinct elements of a multiset requires an amount of memory proportional to the cardinality, which is impractical for very large data sets. Probabilistic cardinality estimators, such as the HyperLogLog algorithm, use significantly less memory than this, but can only approximate the cardinality. The HyperLogLog algorithm is able to esti
brand slug: wiki
category slug: encyclopedia
description: Approximate distinct counting algorithm
original url: https://en.wikipedia.org/wiki/HyperLogLog
date created: 2014-03-11T17:09:12Z
date modified: 2024-09-11T19:38:24Z
main entity: {"identifier":"Q17092118","url":"https://www.wikidata.org/entity/Q17092118"}
image:
fields total: 13
integrity: 15

Related Entries

Explore Next Part