Published Sep 3, 2019
SE-Radio Episode 358: Probabilistic Data Structure for Big Data Problems
Dr. Andrii Gakhov delves into probabilistic data structures like Bloom filters, HyperLogLog, and Count-Min Sketch, showcasing their pivotal role in efficiently managing big data problems with approximate solutions, especially in cardinality and frequency estimation.
Topics covered
Popular Clips
Episode Highlights
Related Episodes
SE-Radio Episode 344: Pat Helland on Web Scale
Answers 383 questions
SE-Radio Episode 243: RethinkDB with Slava Akhmechet
Answers 383 questions
SE-Radio Episode 288: DevSecOps
Answers 383 questions
SE Radio 560: Sugu Sougoumarane on Distributed SQL Databases
Answers 383 questions
SE Radio 594: Sean Moriarity on Deep Learning with Elixir and Axon
Answers 383 questionsSE-Radio Episode 305: Charlie Berger on Predictive Applications
Answers 383 questions
SE-Radio Episode 252: Christopher Meiklejohn on CRDTs
Answers 383 questions
SE-Radio Episode 346: Stephan Ewen on Streaming Architecture
Answers 383 questions
SE-Radio Episode 357: Adam Barr on Code Quality
Answers 383 questions
SE-Radio Episode 362: Simon Riggs on Advanced Features of PostgreSQL
Answers 383 questionsSE-Radio Episode 321: Péter Budai on End to End Encryption
Answers 383 questions
SE Radio 561: Dan DeMers on Dataware
Answers 383 questions
SE-Radio Episode 276: Björn Rabenstein on Site Reliability Engineering
Answers 383 questions
SE Radio 635: Stevie Caldwell on Zero-Trust Architecture
Answers 383 questions
