40x less overhead! Rateless Invertible Bloom Filters - Part 3 of 3
Ғылым және технология
Practical Rateless Set Reconciliation by Lei Yang, Yossi Gilad, Mohammad Alizadeh: arxiv.org/abs/2402.02668
Part 3 in a 3 part series on bloom filters
Chapters:
00:00 Nerd Shade
01:36 Set Reconciliation Overview
03:08 vs Invertible Bloom Filters
05:04 Design Goals
06:40 Ratelessness
08:42 Probability Mapping
12:20 Building a RIBLT
15:18 Reconciliation using RIBLT
19:30 Conclusion
Пікірлер: 11
Love the videos
You are amazing .. I wish I had a computer science teacher like you in my academia.
@n0computer
Күн бұрын
Thanks so much! You just made our day ☺️
Very Juicy indeed!!! Love your videos man
@kickeddroid
12 күн бұрын
Something that interests me about probabilistic data structures. Is how they can be used to measure causality between order of events. If it’s a probability and it’s eventually consistent then couldn’t we achieve a rate less version of Order Reconciling. I know this wasn’t the point of the paper but lovely to ponder.
Great videos, I was in third year of undergrad when I first discovered your channel, I was looking for a research topic and your videos inspired me a lot. Thank you
@n0computer
12 күн бұрын
Thank you so much!
Doesn't rsync already have this kind of improvement? (If not, the rsync project ought to publish something about their algorithm.) Cheers!
@n0computer
7 күн бұрын
It’s been a while since we looked, but rsync famously uses a rolling hash function for file reconciliation, which is integrated into the wire protocol. Would be worth investigating!
Can you please make a video about sixel. en.m.wikipedia.org/wiki/Sixel
@n0computer
7 күн бұрын
Hmm… not sure how sixel applies to distributed systems? 🤔