Sign inSign in

Cache-oblivious search cost analysis

The memory transfer cost of a root-to-node path in a cache-oblivious search tree is bounded by twice the number of tree-sized subtrees (triangles) visited.
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.

    Concepts2

    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.