System Design Using Bloom Filter | What is Bloom Filter | Data Structure | System Design Interview

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

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

  • @nipulsindwani117
    @nipulsindwani117 3 года назад +1

    Few queries
    1. what are the preffered way of implementing these hash functions?
    2. why we have choose exactly 3 hash functions?
    Thanks for the video btw. Making shorts can help channel.

    • @TheTechGranth
      @TheTechGranth  3 года назад

      1) these can be similar to the one we used in count min sketch
      2) that is just for explanation purpose, more the number of functions, less will be hash collision

  • @venkatramanpothiraj9438
    @venkatramanpothiraj9438 3 года назад +1

    In this example, how can we check whether Chennai is not on the list?

    • @TheTechGranth
      @TheTechGranth  3 года назад

      We can't that is the point of probabilistic DS, we can only say with 100% guarantee if something is not present. Ideally we should have enough hash function so that collision is minimum

    • @venkatramanpothiraj9438
      @venkatramanpothiraj9438 3 года назад +1

      @@TheTechGranth Got it. Thanks for the clarification.

    • @TheTechGranth
      @TheTechGranth  3 года назад

      @@venkatramanpothiraj9438 do like and subscribe and share with others 🙂