Top-k Packages

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

Minimalistic RedisBloom client for Node.js.

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

Stream-based stream summary implementation

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