It's slower than a row lookup.

Specifically, this model is an ensemble of decision trees.

This involves

1. Row lookup

2. N (tree depth) inequality checks on fields in the row for M trees

3. Weighted sum over M trees