Expand description
WCO intersect probe execution over sorted adjacency lists.
For each probe row, every build side contributes the adjacency list of its bound value; the probe emits one output row per intersect value present in ALL lists, crossed with the matching payload rows. Sorted adjacency plus linear merge intersection keeps the per-probe cost proportional to the adjacency sizes rather than their product.
Execution core: this executor and IntersectBuild
back the streaming WcoIntersectOperator,
which drains chunk inputs into the build tables and probes them per
probe row. Keep the row layout (probe ++ [intersect] ++ builds) in
sync with the operator’s output assembly.
Structs§
- Intersect
Data Info - Per-build-side probe wiring: which probe column holds the bound value.
- WcoIntersect
Executor - N-way intersect executor: one probe side plus N sorted build tables.
Functions§
- multiway_
sorted_ intersect - Incrementally intersect N sorted key lists, smallest first.
- two_
way_ sorted_ intersect - Linear merge intersection of two sorted key slices.