YoVDO

Count-min Sketch to Infinity - Using Probabilistic Data Structures to Solve Counting Problems in .NET

Offered By: NDC Conferences via YouTube

Tags

NDC Conferences Courses .NET Courses Bloom Filters Courses Real-Time Data Processing Courses Probabilistic Data Structures Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.

Syllabus

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


Taught by

NDC Conferences

Related Courses

Algorithms for Big Data
Indian Institute of Technology Madras via Swayam
Graph Search, Shortest Paths, and Data Structures
Stanford University via Coursera
Algorithms for Searching, Sorting, and Indexing
University of Colorado Boulder via Coursera
Advanced SQL for Data Scientists
LinkedIn Learning
Cassandra Data Modeling Essential Training
LinkedIn Learning