bloom-filters

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

v3.0.4 URL: https://unpkg.com/bloom-filters@3.0.4/dist/api.js

Open Browse Files

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 hyperloglog

@suptxt/quickset

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

v0.4.6 URL: https://unpkg.com/@suptxt/quickset@0.4.6/dist/index.js

Open Browse Files

fast quick set Set object performant frequency counter count top-k rank math LFU FIFO LIFO cache Typed sorted ranked window ordered integer typedArray statistics insertion sort data structure

@albert-team/rebloom

Minimalistic RedisBloom client for Node.js.

v2.5.0 URL: https://unpkg.com/@albert-team/rebloom@2.5.0/dist/index.js

Open Browse Files

bloom cuckoo topk top-k filter count-min-sketch redisbloom redis

spacesaver-js

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

v0.6.4 URL: https://unpkg.com/spacesaver-js@0.6.4/index.js

Open Browse Files

leaderboard spacesaver top items frequency heavy hitter data streams top-k

streamsummary-stream

Stream-based stream summary implementation

v0.4.0 URL: https://unpkg.com/streamsummary-stream@0.4.0/index.js

Open Browse Files

stream-summary stream top-k frequency