Bartosz Adamczewski. Probabilistic Data Structures

Показать описание

We generate more information in a day that we’re able to process in a year. Gone are the days when all relevant data would nicely fit in memory and be instantly aggregatable and searchable. This is where probabilistic data structures can help since they try to minimize memory footprint and maximize performance.
This presentation will show you how probabilistic data structures can be better, faster, and more memory-optimized than their classical counterparts. We shall look at how to solve common business problems using these data structures.

Bartosz Adamczewski is a performance and Data-Oriented Design freak, concurrency researcher, and Machine Learning practitioner that creates robust systems for over ten years. Research and Innovation Director at SDI Media, where he leads computer and data science teams.