Lecture 26: Distributed Decision Trees with PLANET

Content locked

The catalog is public. Reading this content requires approved access.

A good question reduces uncertainty

Grow a tree by splitting leaves

The in-memory split search

PLANET uses different strategies for small and large nodes

Logical tree membership is not physical placement

Small leaves: shuffle rows, then finish locally

Large leaves: shuffle statistics instead of rows

Exam practice: model the system, not a memorized picture

Connections