Free Post Probabilistic Data Structures Frequency analysis on hundreds of billions of reports at Report URI: Top-K After looking at how a Bloom Filter works and moving on to understand a Count-Min Sketch, we were left with the final problem of identifying the most frequent reports we...
Free Post Pwned Passwords Sketchy Pwned Passwords After playing with some more probabilistic data structures and talking about Count-Min Sketch, I wanted to expand on my previous work with the Pwned Passwords data set. This is quite...
Free Post Report URI Frequency analysis on hundreds of billions of reports at Report URI: Count-Min Sketch At the time of writing, Report URI has processed a total of 669,142,999,794 reports. That's a lot of reports and sometimes it can be difficult to work...
Free Post Report URI When Pwned Passwords Bloom! I recently wrote about Bloom Filters, the hugely space efficient, probabilistic data structures, and how great they can be. I wanted to create a demonstration of just how useful they...
Free Post Report URI Frequency analysis on hundreds of billions of reports at Report URI: Bloom Filters Have we seen this report before? It sounds like a simple question to ask of a service that collects and processes hundreds of millions of reports per day, and in...
