Search results

5 packages found

JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash

published 3.0.1 6 months ago
M
Q
P

A fast and performant *Least Frequently Used* (LFU) sorted set implementation for working with reasonably sized integers (unsigned). Trades memory for performance, optimised for frequently updating and counting a relatively small set of integers (integer

published 0.4.6 7 months ago
M
Q
P

Estimate top K items in data stream using the SpaceSaver algorithm. Backed by Redis.

published 0.6.4 10 years ago
M
Q
P

Stream-based stream summary implementation

published 0.4.0 9 years ago
M
Q
P

Minimalistic RedisBloom client for Node.js.

published 2.5.0 3 years ago
M
Q
P