Sign inSign in
ConceptSystems & CS

Skip scan

A query optimization technique where an index is traversed using partial attributes of a composite key even when leading attributes are omitted.
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 index1Binary search1Composite key index1Index lookup1Multi-column indexes1

Lecturers

2

Each in their own terms, from the easiest level.

  • D. Richard Hipp

    Carnegie Mellon University · Undergraduate

    An optimization technique where the query planner iterates through all possible values of the first column in a multi-column index when it has few distinct values, performing separate lookups for the second column.
    • 53:55The Architecture and Bytecode Virtual Machine of SQLite

Connections

4

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

Concepts2

Lectures2

2 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.