ConceptSystems & CS
Bloom filter
A probabilistic data structure used to test whether an element is a member of a set, which may return false positives but never false negatives.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
3Each in their own terms, from the easiest level.
Andy Pavlo
A probabilistic data structure that answers set membership queries with no false negatives and possible false positives.Matt Butrovich
A probabilistic data structure that can never have a false negative but can have a false positive.Thomas Kejser
A space-efficient probabilistic data structure used to test whether an element is a member of a set.
Lectures that assume it
3Connections
16The lectures that define it or assume it, and the concepts next to it.