Understanding Count-Min Sketches: Frequency Estimation Without Storing Data in JavaScript
By
stopachka
Fresh out the oven, still warm. Top of the tray.
Summary
This article explores Count-Min Sketches, a probabilistic data structure for frequency estimation in JavaScript. The author shares their journey of discovering this technique through a teammate's implementation in Instant (a sync engine), highlighting how sketches provide frequency data without storing the actual data. The piece appears to be a technical deep-dive explaining the concept, implementation, and practical applications of Count-Min Sketches in programming contexts.
Key quotes
· 5 pulledOur teammate Daniel introduced Count-Min Sketches in Instant (a sync engine you can spin up in less than a minute)
Sketches were so small and so fast that I got into a rabbit hole learning about them
The following post came out of the process
I have read and re-read just about every one of PG Wodehouse's 71 novels
Wodehouse can take seemingly silly plots (quite a few involving stealing pigs) and twist them until you're rapt with attention
You might also wanna read
Practical Applications of Skiplists: From Niche Data Structure to Real-World Problem Solving
The article explores skiplists, a data structure often considered niche, and reveals their practical applications through the author's perso
antithesis.com·1mo ago
GPU-Accelerated Cuckoo Filter Implementation Using CUDA
This article describes a GPU-accelerated Cuckoo Filter implementation using CUDA, developed as part of a thesis project. The library provide
github.com·4mo ago
Wavelet Matrix: High-Performance Rust Implementation for Indexed Sequence Queries
Wavelet-matrix is a high-performance Rust-powered implementation of the Wavelet Matrix data structure for indexing static sequences of integ
pypi.org·5mo ago
Functional Quadtree Implementation in Clojure for Browser-Based Visualization
This article presents a functional programming implementation of Quadtrees in Clojure that runs in the browser. Quadtrees are tree data stru
lbjgruppen.com·5mo ago
Optimizing Async Loops in JavaScript: Avoiding Common Performance Pitfalls
This article explores common pitfalls with using 'await' in JavaScript loops and provides solutions for optimizing asynchronous code perform
allthingssmitty.com·7mo ago
Combining Cuckoo Hashing with SIMD-Accelerated Probing for Improved Hash Table Performance
This technical article explores how cuckoo hashing, traditionally avoided in industry hash table implementations like Google's Swiss Tables
reiner.org·7mo ago