Probabilistic data structures are an essential tool for efficiently handling large datasets or streaming data. Unlike traditional data structures that provide exact answers, probabilistic data structures provide either approximate answers or random runtimes, in favour of performance and/or memory consumption. In this presentation we're going to deep dive into the most used probabilistic data structures, analyzing their uses-cases, their trade-offs and the code to implement them.
Get notified about new features and conference additions.