Module planner 

Lightweight cost-based access-path selection.

The planner deliberately keeps the physical plan small: a table scan is always available, and an equality predicate on an indexed column can use an index when its candidate set is cheaper than visiting every row. More join and aggregate planning remains in the executor’s relational pipeline.

Structs

Plan

Enums

AccessPath

Functions

choose

Choose an access path for a single table’s predicate. The returned path is guaranteed to be semantically equivalent to a full scan; it only narrows the rows that still go through normal predicate evaluation.