Sign inSign in
ConceptSystems & CS

Prefix compression

A compression technique for sorted keys in a leaf node that stores a shared common prefix once and only unique suffixes for each key.
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.

B+tree leaf nodes1Leaf node1Lexicographical ordering1Sorted data1

Lecturers

1

    Connections

    2

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

    Concept1

    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.