Designing a Wide-Column database on a Key-Value Store

แชร์
ฝัง
  • เผยแพร่เมื่อ 5 ก.ย. 2024

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

  • @kartikmahajan4405
    @kartikmahajan4405 4 หลายเดือนก่อน +1

    great explanation. very helpful. thanks a lot for this.

    • @core_dump
      @core_dump  4 หลายเดือนก่อน

      Thanks for watching!

  • @yurii.matsak
    @yurii.matsak 22 วันที่ผ่านมา

    Great thank you!

    • @core_dump
      @core_dump  20 วันที่ผ่านมา

      Glad it was helpful!

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

    Hey really great video 🙌

    • @core_dump
      @core_dump  4 หลายเดือนก่อน

      Thanks for the visit

  • @user-dc9zo7ek5j
    @user-dc9zo7ek5j 4 หลายเดือนก่อน +3

    I don't get why they don't use a relational database. Speed?

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

      I don't know the actual reason internal to Pinterest, but if I have to guess... It seems like they are using this DB for analytical use-cases. In these scenario, the database is written to much more often than its read from. LSM Tree indexes are great for writing at scale in comparison to B-Tree indexes (in Relational databases). The strong relational data consistency guarantees are also not required here since it should be okay if there are few inconsistent data-points in a sea of data.
      (I have seen postgres being for a scenario like this and the data-model becomes quite complex. Although performance was decent, I am not sure how it would fare at Pinterest's scale)
      Of course, there might be multitude of other reasons, like ease of scaling, simpler data model, team expertise, established internal frameworks and infra etc.

    • @prashlovessamosa
      @prashlovessamosa 4 หลายเดือนก่อน

      Great explanation

  • @prashlovessamosa
    @prashlovessamosa 3 หลายเดือนก่อน

    1 month no upload 🫠

    • @core_dump
      @core_dump  3 หลายเดือนก่อน

      New video on geosharding and hilbert curve coming soon! Was dealing with some stuff lately