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

Sdílet
Vložit
  • čas přidán 27. 05. 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
  • Věda a technologie

Komentáře • 17

  • @chopper3lw
    @chopper3lw Před 4 dny

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

  • @gulamahsan5902
    @gulamahsan5902 Před 7 dny

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

    • @n0computer
      @n0computer  Před 7 dny

      Thanks so much! You just made our day ☺️

  • @manan6247
    @manan6247 Před 18 dny

    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

  • @kickeddroid
    @kickeddroid Před 17 dny

    Very Juicy indeed!!! Love your videos man

    • @kickeddroid
      @kickeddroid Před 17 dny

      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
    @atom-06 Před 17 dny

    Love the videos

  • @atom-06
    @atom-06 Před 2 dny

    can u do the signal protocol?

    • @n0computer
      @n0computer  Před dnem +1

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

    • @atom-06
      @atom-06 Před 12 hodinami

      @@n0computer thannk you

  • @triforce42
    @triforce42 Před 21 hodinou

    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
      @n0computer  Před 15 hodinami +1

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

  • @dipi71
    @dipi71 Před 13 dny

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

    • @n0computer
      @n0computer  Před 12 dny

      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!

  • @madhavgoyal6093
    @madhavgoyal6093 Před 16 dny

    Can you please make a video about sixel.
    en.m.wikipedia.org/wiki/Sixel

    • @n0computer
      @n0computer  Před 12 dny

      Hmm… not sure how sixel applies to distributed systems? 🤔