Explore probabilistic data structures for solving counting problems in .NET in this conference talk from NDC Oslo 2022. Dive into the challenges of element counting, distinct element counts, and presence checks on massive data streams in real-time and at scale. Learn about probabilistic data structures, including Count-Min Sketch, Bloom Filter, and HyperLogLog, and understand their inner workings. Discover how to implement these structures in your applications to efficiently handle large-scale data processing without compromising performance or complexity.
Count-min Sketch to Infinity - Using Probabilistic Data Structures to Solve Counting Problems in .NET
Overview
Syllabus
Count-min Sketch to Infinity - Steve Lorello - NDC Oslo 2022
Taught by
NDC Conferences
Related Courses
-
Data Mining: Count-Min Sketch and Count Sketch Algorithms - Spring 2023
-
Hyper Speed! When Big Data Blooms
-
Data Mining: Sketch Algorithms and Count-Min Sketch Analysis - Spring 2023
-
No, Maybe and Close Enough - Using Probabilistic Data Structures in Python
-
Understanding Probabilistic Data Structures with UFO Sightings
-
Hyper Speed - When Big Data Blooms
