Cs 59000 Ctt Current Topics in Theoretical Cs Lecture 12

Abstract

Our goal is to store S (a set of keys) in such a way that we can quickly (i.e. with few memory accesses) answer queries of the form “Is i ∈ S?”. So we want to encode S in a table via some encoding scheme S → E(S). An algorithm for the membership problem takes a query “Is i ∈ S” and makes a few ‘probes’ into the table E(S), where a probe is just an index… (More)