Search results
18 packages found
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
- bloom
- filter
- bloom filter
- probabilistic
- datastructure
- partitionned bloom filter
- scalable bloom filter
- counting bloom filter
- invertible bloom filter
- count min sketch
- cuckoo
- xor
- minhash
- top-k
a hyperloglog implementation
HyperLogLog using a 32-bit murmurhash3 for node and browser
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)
Efficiently estimate the cardinality of a set in Typescript and Javascript
Native (plain C and C++) HLL implementation for node.js
HyperLogLog Distinct Value Estimator with an alternative implementation to murmurhash 128bit based on murmurhash-native instead of murmurhashv3
Count distinct values/cardinalities using HyperLogLog algrithm.
Stream-based HyperLogLog implementation
HyperLogLog Distinct Value Estimator
Node.js bindings to Skizze (https://github.com/skizzehq/skizze)
Predict anonymous visitors tomorrow based on anonymous visitors today and -beyond
HyperLogLog Distinct Value Estimator
A Redis backed HyperLogLog implementation for node.js.
Set cardinality estimates using HyperLogLog implementation
- log
- loglog
- hyper
- hyperloglog
- cardinality
- estimate
- estimation
- algorithm
- set
- flajolet
- durand
- gandouet
- jean-marie
- fusy