40x less overhead! Rateless Invertible Bloom Filters - Part 3 of 3
HTML-код
- Опубликовано: 28 май 2024
- 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 
Наука
I never even heard of a bloom filter before watching this series, but after I feel enlighted. Thank you for being so enthusiastic and teaching this in an easy way to understand
This is so farkin amazing, thanks for spending the time to cover it.
You are amazing .. I wish I had a computer science teacher like you in my academia.
Thanks so much! You just made our day ☺️
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
Thank you so much!
Very Juicy indeed!!! Love your videos man
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.
Love the videos
can u do the signal protocol?
Oooooh that’s a great idea! We have a full slate for the next few months, but might just start reading docs…
@@n0computer thannk you
To me, "Zeroth" is confusing in this context. I also haven't heard "Oneth." I understand it means "First" and "second" respectively but if it's confusing generally, maybe that's something worth changing in the future.
Totally agreed, and thanks for the feedback! We’ll skip it moving forward ☺️
Doesn't rsync already have this kind of improvement?
(If not, the rsync project ought to publish something about their algorithm.)
Cheers!
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
Hmm… not sure how sixel applies to distributed systems? 🤔