麻省理工学院算法导论lecture (8).pdfVIP

Introduction to Algorithms 6.046J/18.401J/SMA5503 Lecture 8 Prof. Charles E. Leiserson A weakness of hashing Problem: For any hash function h, a set of keys exists that can cause the average access time of a hash table to skyrocket. • An adversary can pick all keys from {k ∈U : h(k) = i} for some slot i. IDEA : Choose the hash function at random, independently of the keys. • Even if an adversary can see your code, he or she cannot find a bad set of keys, since he or she doesn’t know exactly which hash function will be chosen. © 2001 by Charles E. Leiserson Introduction to Algorithms Day 12 L8.2 Universal hashing Definition. Let U be a universe of keys, and let H be a finite collection of hash functions, each mapping U to {0, 1, …, m–1}. We say H is universal if for all x , y ∈U, where x ≠y , we have |{h ∈H : h(x) = h(y )}| = |H|/m. That is, the chance H of a collision {h : h(x) = h(y )} between x and y is 1/m if we choose h |H| randomly from H. m © 2001 by Charles E. Leiserson Introduction to Algorithms Day 12 L8.3 Universality is good Theorem. Let h be a hash function chosen (uniformly) at random from a universal set H of hash functions. Suppose h is used to hash n arbitrary keys into the m slots of a table T. Then, for a given key x , we have E [#collisions with x] n/m. © 2001 by Charles E. Leiserson Introduction to Algorithms Day 12 L8.4 Proof of theorem Proof. Let C be the random variable denoting x the total number of colli