Probabilistic (P11c) data structures allow you to cheat the storage requirements and computational load of many common data tasks. Join Kyle Davis and Loris Cro for a webinar covering P11c data structure concepts, trade offs, and advantages. You’ll hear about hyperloglog, Bloom filters, and cuckoo filters, and how to wield them in Redis. You’ll also hear about common use cases that can leverage these data structures.
|When:||January 24, 2019 | 9:00 AM|
|Featured Speaker:||Kyle Davis, Head of Developer Advocacy, Redis labs|
Before joining Redis, Kyle worked as an independent full-stack architect and code quality consultant. Kyle has written extensively on Node.js and Redis. Kyle holds a Bachelors of Science in Computer Publishing & Telecommunications from the University of Southern Indiana and a Masters of Science in College Student Personnel Administration from the University of Central Missouri.
By continuing to use this site, you consent to our updated privacy agreement. You can change your cookie settings at any time but parts of our site will not function correctly without them.