Count-min Sketch to Infinity - Steve Lorello - NDC Oslo 2022

Count-min Sketch to Infinity: Using Probabilistic Data Structures to Solve Counting Problems in .NET A major problem in computer science is performing element counting, distinct element counts, and presence checks on enormous streams of data, in real-time, at scale, without breaking the bank or over-complicating our apps. In this talk, we’ll learn how to address these issues using probabilistic data structures. We’ll learn what a probabilistic data structure is, we’ll learn about the guts of the Count-Min Sketch, Bloom Filter, and HyperLogLog data structures. And finally, we’ll talk about using them in our apps at scale. Check out more of our featured speakers and talks at https://ndcconferences.com/ https://ndcoslo.com/