Better solution:

• Use r hash functions.

  • For each K turn on
    B(h1(K), B(h2(K)),…,B(hr(K))
  • Say K is in iff all hash bits are on.
  • Probability of false drop is
  • Optimum choice for r is
  • With this choice, probability of false drop

Previous slide

Next slide

Back to first slide

View graphic version