@hackage hyperloglogplus0.1.0.0

Approximate cardinality estimation using constant space

Categories
License
BSD-3-Clause
Maintainer
eugene.zhulenev@gmail.com
Links
Versions
- 0.1.0.0 Tue, 5 Jul 2016

Installation
In your cabal file:
Dependencies (6)
- base >=4.7 && <5
- containers >=0.5 && <0.6
- vector >=0.11 && <0.12
- bits >=0.2 && <1
- murmur-hash >=0.1 && <0.2
- semigroups >=0.18 && <1
Dependents (1)
@hackage/acme-everything

HyperLogLogPlus

Haskell implementation of HyperLogLog++ with MinHash for efficient cardinality and intersection estimation using constant space.

See original AdRoll paper for details: HyperLogLog and MinHash

-- Example:
:set -XDataKinds
:load Data.HyperLogLogPlus

type HLL = HyperLogLogPlus 12 8192

mempty :: HLL

size (foldr insert mempty [1 .. 75000] :: HLL)

size $ (foldr insert mempty [1 .. 5000] ::  HLL) <> (foldr insert mempty [3000 .. 10000] :: HLL)

intersection $ [ (foldr insert mempty [1 .. 15000] ::  HLL)
               , (foldr insert mempty [12000 .. 20000] :: HLL) ]

Testing

stack test