HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm

Résumé

This extended abstract describes and analyses a near-optimal probabilistic algorithm, HYPERLOGLOG , dedicated to estimating the number of distinct elements (the cardinality) of very large data ensembles. Using an auxiliary memory of m units (typically, “short bytes”), HYPERLOGLOG performs a single pass over the data and produces an estimate of the cardinality such that the relative accuracy (the standard error) is typically about 1.04/√m. This improves on the best previously known cardinality estimator, LOGLOG, whose accuracy can be matched by consuming only 64% of the original memory. For instance, the new algorithm makes it possible to estimate cardinalities well beyond 10^9 with a typical accuracy of 2% while using a memory of only 1.5 kilobytes. The algorithm parallelizes optimally and adapts to the sliding window model.
Fichier principal
Vignette du fichier
FlFuGaMe07.pdf (396.64 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00406166 , version 1 (21-07-2009)
hal-00406166 , version 2 (17-08-2015)

Identifiants

  • HAL Id : hal-00406166 , version 1

Citer

Philippe Flajolet, Eric Fusy, Olivier Gandouet, Frédéric Meunier. HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm. Analysis of Algorithms 2007 (AofA07), Jun 2007, Juan les pins, France. pp.127--146. ⟨hal-00406166v1⟩
32049 Consultations
8289 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More