QR-Code

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

This extended abstract describes and analyses a near-optimal probabilistic algorithm, HYPERLOGLOG, dedicated to estimating the number of \emphdistinct elements (the cardinality) of very large data ensembles. Using an auxiliary memory of m units (typically, "short bytes''), HYPERLOGLOG performs a sin...

Ausführliche Beschreibung

Gespeichert in:
Hauptverfasser: Philippe Flajolet, Éric Fusy, Olivier Gandouet, Frédéric Meunier
Format: Artigo
Sprache:Inglês
Veröffentlicht: Discrete Mathematics & Theoretical Computer Science 2007-01-01
Schriftenreihe:Discrete Mathematics & Theoretical Computer Science
Schlagworte:
cardinality estimation
probabilistic algorithm
[info.info-ds] computer science [cs]/data structures and algorithms [cs.ds]
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
[math.math-co] mathematics [math]/combinatorics [math.co]
[info.info-cg] computer science [cs]/computational geometry [cs.cg]
Online-Zugang:https://dmtcs.episciences.org/3545/pdf
Tags: Tag hinzufügen
Keine Tags, Fügen Sie das erste Tag hinzu!

Ähnliche Einträge