Lecture 10 Searching.ppt

Lecture 10: Searching Double Hashing Open address hashing with double hashing requires, on average: 1/(1-alpha) operations for an unsuccessful search -log(1-alpha)/alpha operations for a successful search E.g., for alpha = 2/3 we’ll make 3 probes for an average unsuccessful search, and 1.65 for a successful search Lecture 10: Searching Chained Hashing Chained hashing requires, on average: 1+alpha operations for an unsuccessful search 1+alpha/2 operations for a successful search E.g., for alpha = 2/3 we’ll make 1.66 probes for an average unsuccessful search, and 1.33 for a successful search Lecture 10: Searching Time Analysis These formulas require significant mathematical analysis, which we won’t go into. Lecture 10: Searching Average Number of Probes Successful Search Lecture 10: Searching Radix Searching For many applications, keys can be thought of as numbers Searching methods that take advantage of digital properties of these keys are called radix searches Radix searches treat keys as numbers in base M (the radix) and work with individual digits Lecture 10: Searching Radix Searching Provide reasonable worst-case performance without complication of balanced trees. Provide way to handle variable length keys. Compete with BST and Hash Tables. Lecture 10: Searching The Simplest Radix Search Digital Search Trees — like BSTs but branch according to the key’s bits. Key comparison replaced by function that accesses the key’s next bit. Works for variable length keys. Data is not sorted by key. Lecture 10: Searching Digital Search Example A R H C S E A 00001 S 10011 E 00101 R 10010 C 00011 H 01000 Lecture 10: Searching Digital Search Trees Requires O(log N) comparisons on average for lookup. Why? Requires b comparisons in the worst case for a tree built with N random b-bit keys Lecture 10: Searching Digital Search Problem: At each node we make a full key comparison — this may be expensive, e.g. very long keys Solution: store keys only at the leaves