JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
-
Updated
Aug 12, 2026 - TypeScript
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
Learn stream processing & analytics in TypeScript at a Staff/EM level — windows, watermarks, Count-Min Sketch, HyperLogLog, Bloom filters, and rollup cubes.
여행하게(Align)의 실시간 랭킹 시스템을 NestJS·TypeScript·TypeORM으로 재구성한 학습·기여형 프로젝트 — HLL·ZSET·BullMQ 마이크로배치
Interactive lab for probabilistic data structures — Bloom, Cuckoo, HyperLogLog, Count-Min, Top-K, DDSketch, MinHash, reservoir sampling. Real tested implementations, live visualizations, sizing calculators.
Add a description, image, and links to the hyperloglog topic page so that developers can more easily learn about it.
To associate your repository with the hyperloglog topic, visit your repo's landing page and select "manage topics."