Redis Monthly Live: Count-min Sketch to Infinity with Stephen Lorello

Every month we host speakers from around the world and talk about everything Redis. This month we have our very own Stephen Lorello talking about Probabilistic Data Structures/

About this event

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.

Speakers

When

Monday, Nov 15
2:00 PM - 4:00 PM (EST)

Host

Organizer