To accelerate data access, database systems have long relied on probabilistic filters, most notably Bloom filters, to avoid unnecessary I/O. These compact structures are highly effective for point queries: they answer ''is key x present?'' with one-sided error, i.e., with false positives but not false negatives.
Viktor Leis (Thu,) studied this question.