Consistent Hashing - Rebalancing Partitions | Systems Design Interview 0 to 1 with Ex-Google SWE

แชร์
ฝัง

ความคิดเห็น • 9

  • @MrDartfire
    @MrDartfire หลายเดือนก่อน +2

    Jordan has life of the great big sense. Thanks a lot for all of these videos!

  • @aleksandr_t
    @aleksandr_t 8 หลายเดือนก่อน +1

    Great work, thank you for that video

  • @user-rv5yb9kj6w
    @user-rv5yb9kj6w ปีที่แล้ว +4

    How are we choosing the K locations that belong to Nodes?

    • @jordanhasnolife5163
      @jordanhasnolife5163  ปีที่แล้ว +2

      Uniform random distribution sorry if that wasn't explicit

  • @LeoLeo-nx5gi
    @LeoLeo-nx5gi ปีที่แล้ว +2

    How can we avoid hot partition issues in consistent hashing if some nodes are removed ? Also this was quite cool video thanks!!

    • @jordanhasnolife5163
      @jordanhasnolife5163  ปีที่แล้ว +5

      Well generally speaking hot partitions will come up when one key in particular is hot which means it's pretty darn hard to avoid - at that point you have to kinda be clever about sharding even deeper within that key! Great question

    • @LeoLeo-nx5gi
      @LeoLeo-nx5gi ปีที่แล้ว +1

      @@jordanhasnolife5163 makes sense!!

  • @htm332
    @htm332 ปีที่แล้ว +1

    🔥