Sign inSign in
ConceptSystems & CS

Count-min sketch

A probabilistic data structure that approximates frequency counts of elements in a data stream using hash functions and a multi-dimensional array of counters.
as Andy Pavlo defines itCarnegie Mellon University
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.

Frequency estimation1Hash function1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1

    Connections

    3

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

    Concepts2

    Lecture1

    1 lecturer. 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.