Name: Hyperloglog
Start: 2015-03-14T15:00:00+05:30
End: 2015-03-14T18:00:00+05:30
Location: Idea Device

I will be talking about Hyperloglog, a cardinality (i.e. number of distinct elements) estimation algorithm. In general, counting the number of elements in a set gets harder as the number of sets increase. For e.g., you might want to count number of users from a country.. i.e. number of sets is just 200+ and you can use a map of country to count. But, if you want to count the number of unique visitors to a popular website, then the number of sets become really large.

Probabilistic counting methods give a way to estimate the cardinality of sets without keeping track of every single item. Hyperloglog is probably the best known of those methods.

Paper: http://algo.inria.fr/flajolet/Publications/FlFuGaMe07.pdf

Vaidhy

Jaseem Abid

Papers we love, Bangalore

Technology

Lisp

Education & Technology

Computer Science

Computer Programming

Computing

Programming Languages

Scala

Haskell

Functional Programming

Clojure

Compilers

Hyperloglog

Idea Device

Share

Papers we love, Bangalore

Hyperloglog

Papers we love, Bangalore

Details

Members are also interested in