Query Planning

Drive from the cheapest clause, and never score a document that cannot reach the top K.

The question

How much of this work can be skipped?

The structure responsible

Cost-based ordering and a bounded heap

In this lab: Flip the join order, then compare exhaustive scoring against WAND on the same query.

building the index…