bloom-filters
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
Provides implementations of sketch algorithms for real-time counting of stream data. Useful for real-time web analytics and other streaming or big data scenarios.
hyperloglog support for mongo (16kb per counter)
HyperLogLog Distinct Value Estimator with an alternative implementation to murmurhash 128bit based on murmurhash-native instead of murmurhashv3
HyperLogLog Distinct Value Estimator
a hyperloglog implementation
Node.js bindings to Skizze (https://github.com/skizzehq/skizze)
HyperLogLog using a 32-bit murmurhash3 for node and browser
Predict anonymous visitors tomorrow based on anonymous visitors today and -beyond
Native (plain C and C++) HLL implementation for node.js
Stream-based HyperLogLog implementation
HLLD client
Efficiently estimate the cardinality of a set in Typescript and Javascript