Sharding strategies: lookup-based, range-based, and hash-based

Поделиться
HTML-код
  • Опубликовано: 13 сен 2024

Комментарии • 11

  • @tmanley1985
    @tmanley1985 2 месяца назад +6

    One thing that I've never seen addressed fully in any video relating to sharding is the issue of how best to manage relationships. You can't do joins across shards, so all of that gluing together has to be done in memory. That's fine. But say you have a members table like in your example, but they can have many "orders". The number of orders will likely exceed that of the members table so they'll need to be sharded as well. So the question becomes: do they need to exist on their own sharded instance, how do you choose their sharding key? I'm sure there are questions relating to this that I'm not thinking of, but that's the gist of it.

    • @HollyGuevaraPS
      @HollyGuevaraPS 2 месяца назад +2

      Ooh great question we can definitely cover that! Exactly the type of in the weeds topics I'm looking for.

    • @tmanley1985
      @tmanley1985 2 месяца назад +3

      @@HollyGuevaraPS Asking questions is my only talent. Thanks for the video.

  • @shoooozzzz
    @shoooozzzz 2 месяца назад +11

    Aaron sure looks different these days

  • @lionbryce10101
    @lionbryce10101 2 месяца назад +2

    At some point the d in sharding started to sound like t and I was losing my mind haha

    • @HollyGuevaraPS
      @HollyGuevaraPS 2 месяца назад

      🤣😭 never let your shard d's become t's

  • @engdoretto
    @engdoretto 2 месяца назад

    Excellent video! Thanks a lot!

  • @leandrocrs
    @leandrocrs 2 месяца назад +1

    Could you share what software you did use as blackboard?

    • @HollyGuevaraPS
      @HollyGuevaraPS 2 месяца назад +1

      Yeah I actually just make everything in Figma and then use the presenter mode when I record!