why simple hash functions work exploiting the.pptVIP

Why Simple Hash Functions Work :Exploiting the Entropyin a Data Stream Michael Mitzenmacher Salil Vadhan How Collaborations Arise… At a talk I was giving on Bloom filters... Salil: Your analysis assumes perfectly random hash functions. What do you use in your experiments? Michael: In practice, it works even with standard hash functions. Salil: Can you prove it? Michael: Um… Question Why do simple hash functions work? Simple = chosen from a pairwise (or k-wise) independent (or universal) family. Our results are actually more general. Work = perform just like random hash functions in most real-world experiments. Motivation: Close the divide between theory and practice. Universal Hash Families Defined by Carter/Wegman Family of hash functions L of form H:[N] ? [M] is k-wise independent if when H is chosen randomly, for any x1,x2,…xk, and any a1,a2,…ak, Family is k-wise universal if Applications Potentially, wherever hashing is used Bloom Filters Power of Two Choices Linear Probing Cuckoo Hashing Many Others… Review: Bloom Filters Given a set S = {x1,x2,x3,…xn} on a universe U, want to answer queries of the form: Bloom filter provides an answer in “Constant” time (time to hash). Small amount of space. But with some probability of being wrong. Bloom Filters Power of Two Choices Hashing n items into n buckets What is the maximum number of items, or load, of any bucket? Assume buckets chosen uniformly at random. Well-known result: ?(log n / log log n) maximum load w.h.p. Suppose each ball can pick two bins independently and uniformly and choose the bin with less load. Maximum load is log log n / log 2 + ?(1) w.h.p. With d ≥ 2 choices, max load is log log n / log d + ?(1) w.h.p. Power of Two Choices Suppose each ball can pick two bins independently and uniformly and choose the bin with less load. What is the maximum load now? log log n / log 2 + ?(1) w.h.p. What if we have d ≥ 2 choices? log log n / log d + ?(1) w.h.p. Linear Probing Hash elemen