Room 5

15:00 - 16:00 (UTC+02)

Talk (60 min)

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.

Big Data

Steve Lorello

An experienced polyglottic full-stack Software Engineer, Steve's worked on everything from video conferencing software to GPS satellites. Steve now works as the .NET Developer Advocate for Redis