40x less overhead! Rateless Invertible Bloom Filters - Part 3 of 3

Подписаться 2,4 тыс.

50% 1

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

Наука

Опубликовано:

2 июн 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 19

@LeoDaLionEdits 5 дней назад

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

@n0computer 5 дней назад

Hey thanks!

@chopper3lw 9 дней назад

This is so farkin amazing, thanks for spending the time to cover it.

@gulamahsan5902 13 дней назад

You are amazing .. I wish I had a computer science teacher like you in my academia.

@n0computer 12 дней назад

Thanks so much! You just made our day ☺️

@manan6247 23 дня назад

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 23 дня назад

Thank you so much!

@kickeddroid 23 дня назад

Very Juicy indeed!!! Love your videos man

@kickeddroid 23 дня назад

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.

@atom-06 23 дня назад

Love the videos

@dipi71 19 дней назад

Doesn't rsync already have this kind of improvement? (If not, the rsync project ought to publish something about their algorithm.) Cheers!

@n0computer 18 дней назад

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!

@triforce42 6 дней назад

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.

@n0computer 6 дней назад

Totally agreed, and thanks for the feedback! We’ll skip it moving forward ☺️

@atom-06 8 дней назад

can u do the signal protocol?

@n0computer 6 дней назад

Oooooh that’s a great idea! We have a full slate for the next few months, but might just start reading docs…

@atom-06 6 дней назад

@@n0computer thannk you