Sign inSign in
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.
as Andy Pavlo defines itCarnegie Mellon UniversityThe wording closest to all 4 definitions
Watch it explained

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

3

Each in their own terms, from the easiest level.

  • Andy Pavlo

    Carnegie Mellon University · Undergraduate

    A probabilistic data structure that answers set membership queries with no false negatives and possible false positives.
    • 55:37Static & Dynamic Hash Tables (Linear Probe, Robin Hood, Cuckoo, Extendible)
  • Matt Butrovich

    Carnegie Mellon University · Undergraduate

    A probabilistic data structure that can never have a false negative but can have a false positive.
  • Thomas Kejser

    Carnegie Mellon University · Graduate

    A space-efficient probabilistic data structure used to test whether an element is a member of a set.
    • 12:56FloeScan and Other Interesting Design Magic

Lectures that assume it

3

Connections

16

The lectures that define it or assume it, and the concepts next to it.

3 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.