HyperLogLog Distinct Value Estimator with an alternative implementation to murmurhash 128bit based on murmurhash-native instead of murmurhashv3
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
Cube.js pre-aggregation storage layer.
hyperloglog support for mongo (16kb per counter)
HyperLogLog using a 32-bit murmurhash3 for node and browser
Native (plain C and C++) HLL implementation for node.js
HyperLogLog Distinct Value Estimator
Efficiently estimate the cardinality of a set in Typescript and Javascript
Count distinct values/cardinalities using HyperLogLog algrithm.
a hyperloglog implementation
HyperLogLog Distinct Value Estimator
High-performance probabilistic data structures for Node.js - 41 algorithms with 28-75% better space efficiency than classic algorithms
probabilistic data structure in js
TypeScript implementation of HyperLogLog algorithm
Probabilistic data structures for TypeScript/Node.js via WebAssembly
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.
Set cardinality estimates using HyperLogLog implementation
Redis application server.
HLLD client
A native HyperLogLog lib.
A SQL-like interface for Plywood
Official TypeScript/JavaScript SDK for Synap - High-Performance In-Memory Key-Value Store & Message Broker
Predict anonymous visitors tomorrow based on anonymous visitors today and -beyond