Sign inSign in
ConceptSystems & CS

Linear hashing Deletes and contraction

Shrinking the hash table when a bucket below the split pointer becomes empty by moving the split pointer in reverse and dropping the last hash table.
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

    3

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

    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.