27 · Query Planning

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

How much of this work can be skipped? Answered by Cost-based ordering and a bounded heap.

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

loading mind map…

building the index…