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

preview_player
Показать описание
This month Justin Castilla does a little bit of Show-n-tell and Stephen Lorello presents on Probabilistic Data Structures.

-----

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.
Рекомендации по теме
Комментарии
Автор

How can we configure cell storage in count min sketch (counter ) from 8 bytes to less bytes? We need to store short int not long or integer

parasmehndiratta