Sign inSign in
ConceptSystems & CS

Hopscotch hashing

An extension of linear probe hashing where keys can move between positions within a restricted contiguous range of slots called a neighborhood.
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.

Lecturers

1

    Connections

    6

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

    Concepts5

    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.