@quereus/quereus 2.8.0 → 3.0.0

package/dist/src/planner/rules/join/equi-pair-extractor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"equi-pair-extractor.d.ts","sourceRoot":"","sources":["../../../../../src/planner/rules/join/equi-pair-extractor.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,kBAAkB,EAAE,MAAM,0BAA0B,CAAC;AACnF,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAM9D,MAAM,WAAW,kBAAkB;IAClC,SAAS,EAAE,YAAY,EAAE,CAAC;IAC1B,QAAQ,EAAE,cAAc,GAAG,SAAS,CAAC;IACrC;;;;;;;OAOG;IACH,aAAa,EAAE,KAAK,CAAC,cAAc,GAAG,SAAS,CAAC,CAAC;CACjD;AAED;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CACnC,MAAM,EAAE,kBAAkB,EAC1B,SAAS,EAAE,SAAS,YAAY,EAAE,EAClC,IAAI,EAAE,MAAM,GAAG,OAAO,GACpB,OAAO,CAaT;AAED;;;;GAIG;AACH,wBAAgB,wBAAwB,CACvC,SAAS,EAAE,SAAS,YAAY,EAAE,EAClC,IAAI,EAAE,kBAAkB,EACxB,KAAK,EAAE,kBAAkB,GACvB,YAAY,EAAE,GAAG,IAAI,CAqBvB;AAED;;;;;;GAMG;AACH,wBAAgB,sBAAsB,CACrC,IAAI,EAAE,kBAAkB,EACxB,KAAK,EAAE,kBAAkB,EACzB,SAAS,EAAE,SAAS,YAAY,EAAE,GAChC,OAAO,CAQT;AAED,gGAAgG;AAChG,wBAAgB,eAAe,CAC9B,IAAI,EAAE,cAAc,GAAG,SAAS,EAChC,MAAM,EAAE,aAAa,CAAC,cAAc,CAAC,GACnC,cAAc,GAAG,SAAS,CAc5B;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAC/B,SAAS,EAAE,cAAc,GAAG,SAAS,EACrC,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,EACxB,YAAY,EAAE,GAAG,CAAC,MAAM,CAAC,GACvB,kBAAkB,GAAG,IAAI,CA4C3B;AAED;;;GAGG;AACH,wBAAgB,yBAAyB,CACxC,YAAY,EAAE,SAAS,MAAM,EAAE,GAAG,SAAS,EAC3C,SAAS,EAAE,aAAa,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,EACtD,UAAU,EAAE,aAAa,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,GACrD,kBAAkB,GAAG,IAAI,CAa3B"}

package/dist/src/planner/rules/join/equi-pair-extractor.js

@@ -0,0 +1,155 @@
+/**
+ * Shared helper: extract equi-join pairs and residual predicate from an ON
+ * condition. Used by both `rule-join-physical-selection` (ordering-based) and
+ * `rule-monotonic-merge-join` (MonotonicOn-based).
+ */
+import { BinaryOpNode } from '../../nodes/scalar.js';
+import { ColumnReferenceNode } from '../../nodes/reference.js';
+import { normalizePredicate } from '../../analysis/predicate-normalizer.js';
+import { PlanNodeCharacteristics } from '../../framework/characteristics.js';
+/**
+ * Check whether `source`'s `physical.ordering` covers the given equi-pair
+ * columns positionally for the chosen `side` (the merge-join emitter compares
+ * keys in equi-pair order, so the source must be ASC-sorted on each
+ * equi-pair attribute at exactly that position). Returns false on the first
+ * mismatch.
+ */
+export function isOrderedOnEquiPairs(source, equiPairs, side) {
+    const ordering = PlanNodeCharacteristics.getOrdering(source);
+    if (!ordering || ordering.length === 0)
+        return false;
+    if (equiPairs.length > ordering.length)
+        return false;
+    const attrs = source.getAttributes();
+    for (let i = 0; i < equiPairs.length; i++) {
+        const attrId = side === 'left' ? equiPairs[i].leftAttrId : equiPairs[i].rightAttrId;
+        const idx = attrs.findIndex(a => a.id === attrId);
+        if (idx === -1)
+            return false;
+        if (ordering[i].column !== idx || ordering[i].desc)
+            return false;
+    }
+    return true;
+}
+/**
+ * Reorder equi-pairs so they line up with the left source's ordering prefix,
+ * and verify the right source agrees on the same reordered key sequence.
+ * Returns null when no reordering can satisfy both sides simultaneously.
+ */
+export function reorderEquiPairsForMerge(equiPairs, left, right) {
+    const leftOrdering = PlanNodeCharacteristics.getOrdering(left);
+    if (!leftOrdering || leftOrdering.length < equiPairs.length)
+        return null;
+    const leftAttrs = left.getAttributes();
+    const colToEqIdx = new Map();
+    for (let i = 0; i < equiPairs.length; i++) {
+        const attrIdx = leftAttrs.findIndex(a => a.id === equiPairs[i].leftAttrId);
+        if (attrIdx === -1)
+            return null;
+        colToEqIdx.set(attrIdx, i);
+    }
+    const reordered = [];
+    for (let i = 0; i < equiPairs.length; i++) {
+        const eqIdx = colToEqIdx.get(leftOrdering[i].column);
+        if (eqIdx === undefined || leftOrdering[i].desc)
+            return null;
+        reordered.push(equiPairs[eqIdx]);
+    }
+    if (!isOrderedOnEquiPairs(right, reordered, 'right'))
+        return null;
+    return reordered;
+}
+/**
+ * True when both sides' physical ordering covers ALL equi-pairs in the
+ * exact (or reorderable) order required by the merge-join emitter. When this
+ * holds the ordering-based rule will produce a multi-key merge join with
+ * proper unique-key propagation; rules that demote pairs to residual should
+ * defer to that path instead of taking a single-pair merge.
+ */
+export function isMergeReadyOnAllPairs(left, right, equiPairs) {
+    if (isOrderedOnEquiPairs(left, equiPairs, 'left') && isOrderedOnEquiPairs(right, equiPairs, 'right')) {
+        return true;
+    }
+    if (equiPairs.length > 1) {
+        return reorderEquiPairsForMerge(equiPairs, left, right) !== null;
+    }
+    return false;
+}
+/** Combine an existing residual and a list of extra scalar conjuncts into a single AND-tree. */
+export function combineResidual(base, extras) {
+    const all = [];
+    if (base)
+        all.push(base);
+    for (const e of extras)
+        all.push(e);
+    if (all.length === 0)
+        return undefined;
+    if (all.length === 1)
+        return all[0];
+    return all.reduce((acc, cur) => new BinaryOpNode(cur.scope, { type: 'binary', operator: 'AND', left: acc.expression, right: cur.expression }, acc, cur));
+}
+/**
+ * Extract equi-join pairs and residual predicates from an ON condition.
+ * Returns null if no equi-pairs are found.
+ */
+export function extractEquiPairs(condition, leftAttrIds, rightAttrIds) {
+    if (!condition)
+        return null;
+    const norm = normalizePredicate(condition);
+    const equiPairs = [];
+    const equiPairNodes = [];
+    const residuals = [];
+    const stack = [norm];
+    while (stack.length) {
+        const n = stack.pop();
+        if (n instanceof BinaryOpNode && n.expression.operator === 'AND') {
+            stack.push(n.left, n.right);
+            continue;
+        }
+        let isEqui = false;
+        if (n instanceof BinaryOpNode && n.expression.operator === '=') {
+            if (n.left instanceof ColumnReferenceNode && n.right instanceof ColumnReferenceNode) {
+                const lId = n.left.attributeId;
+                const rId = n.right.attributeId;
+                if (leftAttrIds.has(lId) && rightAttrIds.has(rId)) {
+                    equiPairs.push({ leftAttrId: lId, rightAttrId: rId });
+                    equiPairNodes.push(n);
+                    isEqui = true;
+                }
+                else if (leftAttrIds.has(rId) && rightAttrIds.has(lId)) {
+                    equiPairs.push({ leftAttrId: rId, rightAttrId: lId });
+                    equiPairNodes.push(n);
+                    isEqui = true;
+                }
+            }
+        }
+        if (!isEqui) {
+            residuals.push(n);
+        }
+    }
+    if (equiPairs.length === 0)
+        return null;
+    const residual = combineResidual(undefined, residuals);
+    return { equiPairs, residual, equiPairNodes };
+}
+/**
+ * Convert USING-column names into equi-pairs given the left/right attributes.
+ * Returns null if no pairs could be matched.
+ */
+export function extractEquiPairsFromUsing(usingColumns, leftAttrs, rightAttrs) {
+    if (!usingColumns || usingColumns.length === 0)
+        return null;
+    const equiPairs = [];
+    for (const colName of usingColumns) {
+        const lower = colName.toLowerCase();
+        const leftAttr = leftAttrs.find(a => a.name.toLowerCase() === lower);
+        const rightAttr = rightAttrs.find(a => a.name.toLowerCase() === lower);
+        if (leftAttr && rightAttr) {
+            equiPairs.push({ leftAttrId: leftAttr.id, rightAttrId: rightAttr.id });
+        }
+    }
+    if (equiPairs.length === 0)
+        return null;
+    return { equiPairs, residual: undefined, equiPairNodes: equiPairs.map(() => undefined) };
+}
+//# sourceMappingURL=equi-pair-extractor.js.map

package/dist/src/planner/rules/join/equi-pair-extractor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"equi-pair-extractor.js","sourceRoot":"","sources":["../../../../../src/planner/rules/join/equi-pair-extractor.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,OAAO,EAAE,kBAAkB,EAAE,MAAM,wCAAwC,CAAC;AAC5E,OAAO,EAAE,uBAAuB,EAAE,MAAM,oCAAoC,CAAC;AAgB7E;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB,CACnC,MAA0B,EAC1B,SAAkC,EAClC,IAAsB;IAEtB,MAAM,QAAQ,GAAG,uBAAuB,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IAC7D,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACrD,IAAI,SAAS,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IAErD,MAAM,KAAK,GAAG,MAAM,CAAC,aAAa,EAAE,CAAC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,MAAM,GAAG,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;QACpF,MAAM,GAAG,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;QAClD,IAAI,GAAG,KAAK,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QAC7B,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,GAAG,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;IAClE,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,wBAAwB,CACvC,SAAkC,EAClC,IAAwB,EACxB,KAAyB;IAEzB,MAAM,YAAY,GAAG,uBAAuB,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;IAC/D,IAAI,CAAC,YAAY,IAAI,YAAY,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAEzE,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;IACvC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,OAAO,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;QAC3E,IAAI,OAAO,KAAK,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;QAChC,UAAU,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IAC5B,CAAC;IAED,MAAM,SAAS,GAAmB,EAAE,CAAC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACrD,IAAI,KAAK,KAAK,SAAS,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC;QAC7D,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;IAClC,CAAC;IAED,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,SAAS,EAAE,OAAO,CAAC;QAAE,OAAO,IAAI,CAAC;IAClE,OAAO,SAAS,CAAC;AAClB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,sBAAsB,CACrC,IAAwB,EACxB,KAAyB,EACzB,SAAkC;IAElC,IAAI,oBAAoB,CAAC,IAAI,EAAE,SAAS,EAAE,MAAM,CAAC,IAAI,oBAAoB,CAAC,KAAK,EAAE,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC;QACtG,OAAO,IAAI,CAAC;IACb,CAAC;IACD,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,OAAO,wBAAwB,CAAC,SAAS,EAAE,IAAI,EAAE,KAAK,CAAC,KAAK,IAAI,CAAC;IAClE,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,gGAAgG;AAChG,MAAM,UAAU,eAAe,CAC9B,IAAgC,EAChC,MAAqC;IAErC,MAAM,GAAG,GAAqB,EAAE,CAAC;IACjC,IAAI,IAAI;QAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,MAAM;QAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IACvC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC;IACpC,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAC9B,IAAI,YAAY,CACf,GAAG,CAAC,KAAK,EACT,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,UAAU,EAAE,KAAK,EAAE,GAAG,CAAC,UAAU,EAAE,EAChF,GAAG,EACH,GAAG,CACH,CACD,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAC/B,SAAqC,EACrC,WAAwB,EACxB,YAAyB;IAEzB,IAAI,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IAE5B,MAAM,IAAI,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAC;IAC3C,MAAM,SAAS,GAAmB,EAAE,CAAC;IACrC,MAAM,aAAa,GAAsC,EAAE,CAAC;IAC5D,MAAM,SAAS,GAAqB,EAAE,CAAC;IAEvC,MAAM,KAAK,GAAqB,CAAC,IAAI,CAAC,CAAC;IACvC,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACrB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACvB,IAAI,CAAC,YAAY,YAAY,IAAI,CAAC,CAAC,UAAU,CAAC,QAAQ,KAAK,KAAK,EAAE,CAAC;YAClE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;YAC5B,SAAS;QACV,CAAC;QAED,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,YAAY,YAAY,IAAI,CAAC,CAAC,UAAU,CAAC,QAAQ,KAAK,GAAG,EAAE,CAAC;YAChE,IAAI,CAAC,CAAC,IAAI,YAAY,mBAAmB,IAAI,CAAC,CAAC,KAAK,YAAY,mBAAmB,EAAE,CAAC;gBACrF,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC;gBAC/B,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC;gBAEhC,IAAI,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACnD,SAAS,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,WAAW,EAAE,GAAG,EAAE,CAAC,CAAC;oBACtD,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACtB,MAAM,GAAG,IAAI,CAAC;gBACf,CAAC;qBAAM,IAAI,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC1D,SAAS,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,WAAW,EAAE,GAAG,EAAE,CAAC,CAAC;oBACtD,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACtB,MAAM,GAAG,IAAI,CAAC;gBACf,CAAC;YACF,CAAC;QACF,CAAC;QAED,IAAI,CAAC,MAAM,EAAE,CAAC;YACb,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,CAAC;IACF,CAAC;IAED,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAExC,MAAM,QAAQ,GAAG,eAAe,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;IAEvD,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,aAAa,EAAE,CAAC;AAC/C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,yBAAyB,CACxC,YAA2C,EAC3C,SAAsD,EACtD,UAAuD;IAEvD,IAAI,CAAC,YAAY,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC5D,MAAM,SAAS,GAAmB,EAAE,CAAC;IACrC,KAAK,MAAM,OAAO,IAAI,YAAY,EAAE,CAAC;QACpC,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,KAAK,CAAC,CAAC;QACrE,MAAM,SAAS,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,KAAK,CAAC,CAAC;QACvE,IAAI,QAAQ,IAAI,SAAS,EAAE,CAAC;YAC3B,SAAS,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,QAAQ,CAAC,EAAE,EAAE,WAAW,EAAE,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC;QACxE,CAAC;IACF,CAAC;IACD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACxC,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,aAAa,EAAE,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC;AAC1F,CAAC"}

package/dist/src/planner/rules/join/rule-join-elimination.d.ts

@@ -0,0 +1,56 @@
+/**
+ * Rule: Join Elimination (FK→PK)
+ *
+ * Eliminates a join whose non-preserved side is never referenced above the join
+ * and is guaranteed at-most-one-matching per FK→PK alignment.
+ *
+ * The rule fires on ProjectNode and walks down through a whitelist of
+ * pass-through nodes (Filter, Sort, LimitOffset, Distinct, Alias) collecting
+ * the set of attribute IDs that any caller above the join still demands. When
+ * the walk reaches a JoinNode, the demanded set is final for that chain:
+ *
+ *   - If the demanded set only references the preserved side and the equi-join
+ *     condition aligns FK columns on the preserved side with the PK on the
+ *     other side, the join is rewritten away.
+ *   - For LEFT/RIGHT outer joins, only the non-preserved side may be eliminated
+ *     (the preserved side is required by SQL semantics).
+ *   - For INNER joins, either side may be eliminated, but additionally the FK
+ *     columns must be NOT NULL — otherwise NULL FK rows that wouldn't have
+ *     matched on the join would now survive.
+ *
+ * Non-equi residual conjuncts in the ON-clause disqualify the rewrite (they
+ * may alter cardinality beyond the FK→PK guarantee).
+ */
+import type { PlanNode, ScalarPlanNode } from '../../nodes/plan-node.js';
+import type { OptContext } from '../../framework/context.js';
+export declare function ruleJoinElimination(node: PlanNode, _context: OptContext): PlanNode | null;
+/**
+ * AND-of-equalities check: every conjunct must be `colRef = colRef`. Any other
+ * predicate shape (range comparison, non-equality, OR, function calls, …)
+ * disqualifies the rewrite — those residuals can change row counts beyond what
+ * the FK→PK guarantee covers.
+ */
+export declare function isAndOfColumnEqualities(expr: ScalarPlanNode): boolean;
+/**
+ * Aggregate counterpart of `ruleJoinElimination`: when an Aggregate sits over
+ * a chain ending in an FK-covered inner join and the aggregate's payload only
+ * depends on the FK (left) side, drop the join.
+ *
+ * Why correct for `count(*)` and similar cardinality-only aggregates: a
+ * non-null FK with the IND `L.fk ⊆ R.pk` and an unfiltered R guarantees
+ * `|L ⋈ R| == |L|`, so `count(*)` over the join equals `count(*)` over L.
+ * More generally, when no aggregate argument or group key references R, the
+ * inner join's only effect is to gate L by `fk IS NOT NULL`, which the
+ * NOT-NULL precondition already rules out.
+ *
+ * Implementation mirrors the Project entrypoint: collect attribute IDs the
+ * Aggregate demands (group-key expressions + every aggregate expression),
+ * walk the wrapper chain to find the Join, run the same FK-PK alignment +
+ * row-preserving checks as the inner-join case, then rebuild the chain on
+ * the preserved side.
+ *
+ * Only `inner` joins are eligible here — outer joins reduce to inner in this
+ * context only when both sides demand attrs, which we'd have rejected already.
+ */
+export declare function ruleJoinEliminationUnderAggregate(node: PlanNode, _context: OptContext): PlanNode | null;
+//# sourceMappingURL=rule-join-elimination.d.ts.map

package/dist/src/planner/rules/join/rule-join-elimination.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rule-join-elimination.d.ts","sourceRoot":"","sources":["../../../../../src/planner/rules/join/rule-join-elimination.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAsB,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAE7F,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AA6B7D,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,GAAG,QAAQ,GAAG,IAAI,CAuDzF;AA+DD;;;;;GAKG;AACH,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,cAAc,GAAG,OAAO,CAgBrE;AA8ED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,iCAAiC,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,GAAG,QAAQ,GAAG,IAAI,CAwDvG"}

package/dist/src/planner/rules/join/rule-join-elimination.js

@@ -0,0 +1,326 @@
+/**
+ * Rule: Join Elimination (FK→PK)
+ *
+ * Eliminates a join whose non-preserved side is never referenced above the join
+ * and is guaranteed at-most-one-matching per FK→PK alignment.
+ *
+ * The rule fires on ProjectNode and walks down through a whitelist of
+ * pass-through nodes (Filter, Sort, LimitOffset, Distinct, Alias) collecting
+ * the set of attribute IDs that any caller above the join still demands. When
+ * the walk reaches a JoinNode, the demanded set is final for that chain:
+ *
+ *   - If the demanded set only references the preserved side and the equi-join
+ *     condition aligns FK columns on the preserved side with the PK on the
+ *     other side, the join is rewritten away.
+ *   - For LEFT/RIGHT outer joins, only the non-preserved side may be eliminated
+ *     (the preserved side is required by SQL semantics).
+ *   - For INNER joins, either side may be eliminated, but additionally the FK
+ *     columns must be NOT NULL — otherwise NULL FK rows that wouldn't have
+ *     matched on the join would now survive.
+ *
+ * Non-equi residual conjuncts in the ON-clause disqualify the rewrite (they
+ * may alter cardinality beyond the FK→PK guarantee).
+ */
+import { createLogger } from '../../../common/logger.js';
+import { isRelationalNode } from '../../nodes/plan-node.js';
+import { ProjectNode } from '../../nodes/project-node.js';
+import { FilterNode } from '../../nodes/filter.js';
+import { SortNode } from '../../nodes/sort.js';
+import { LimitOffsetNode } from '../../nodes/limit-offset.js';
+import { DistinctNode } from '../../nodes/distinct-node.js';
+import { AliasNode } from '../../nodes/alias-node.js';
+import { AggregateNode } from '../../nodes/aggregate-node.js';
+import { JoinNode, extractEquiPairsFromCondition } from '../../nodes/join-node.js';
+import { ColumnReferenceNode } from '../../nodes/reference.js';
+import { BinaryOpNode } from '../../nodes/scalar.js';
+import { normalizePredicate } from '../../analysis/predicate-normalizer.js';
+import { checkFkPkAlignment, extractTableSchema } from '../../util/key-utils.js';
+import { lookupCoveringFK, isRowPreservingPathToTable } from '../../util/ind-utils.js';
+const log = createLogger('optimizer:rule:join-elimination');
+export function ruleJoinElimination(node, _context) {
+    if (!(node instanceof ProjectNode))
+        return null;
+    const demanded = new Set();
+    for (const proj of node.projections) {
+        collectAttrIds(proj.node, demanded);
+    }
+    const walk = walkChain(node.source, demanded);
+    if (!walk)
+        return null;
+    const { join, chain } = walk;
+    if (join.joinType !== 'left' && join.joinType !== 'right' && join.joinType !== 'inner')
+        return null;
+    if (!join.condition)
+        return null;
+    const leftAttrs = join.left.getAttributes();
+    const rightAttrs = join.right.getAttributes();
+    const pairs = extractEquiPairsFromCondition(join.condition, leftAttrs, rightAttrs);
+    if (pairs.length === 0)
+        return null;
+    const normalized = normalizePredicate(join.condition);
+    if (!isAndOfColumnEqualities(normalized))
+        return null;
+    const leftIds = new Set(leftAttrs.map(a => a.id));
+    const rightIds = new Set(rightAttrs.map(a => a.id));
+    const usesLeft = setsIntersect(demanded, leftIds);
+    const usesRight = setsIntersect(demanded, rightIds);
+    let preserved = null;
+    switch (join.joinType) {
+        case 'left':
+            if (usesRight)
+                return null;
+            preserved = tryEliminate(join, 'right', pairs);
+            break;
+        case 'right':
+            if (usesLeft)
+                return null;
+            preserved = tryEliminate(join, 'left', pairs);
+            break;
+        case 'inner':
+            if (!usesRight) {
+                preserved = tryEliminate(join, 'right', pairs);
+            }
+            if (!preserved && !usesLeft) {
+                preserved = tryEliminate(join, 'left', pairs);
+            }
+            break;
+    }
+    if (!preserved)
+        return null;
+    log('Eliminating %s join under Project; preserved side has %d attrs', join.joinType, preserved.getAttributes().length);
+    const newSource = rebuildChain(chain, preserved);
+    return rebuildProject(node, newSource);
+}
+function collectAttrIds(expr, out) {
+    if (expr instanceof ColumnReferenceNode) {
+        out.add(expr.attributeId);
+        return;
+    }
+    for (const child of expr.getChildren()) {
+        collectAttrIds(child, out);
+    }
+}
+function walkChain(root, demanded) {
+    const chain = [];
+    let current = root;
+    while (true) {
+        if (current instanceof JoinNode) {
+            return { join: current, chain };
+        }
+        if (current instanceof FilterNode) {
+            collectAttrIds(current.predicate, demanded);
+            chain.push({ kind: 'filter', node: current });
+            current = current.source;
+            continue;
+        }
+        if (current instanceof SortNode) {
+            for (const k of current.sortKeys) {
+                collectAttrIds(k.expression, demanded);
+            }
+            chain.push({ kind: 'sort', node: current });
+            current = current.source;
+            continue;
+        }
+        if (current instanceof LimitOffsetNode) {
+            chain.push({ kind: 'limit', node: current });
+            current = current.source;
+            continue;
+        }
+        if (current instanceof DistinctNode) {
+            // DISTINCT collapses duplicates that the join (with at-most-one matching)
+            // would never have produced anyway; safe to walk through.
+            chain.push({ kind: 'distinct', node: current });
+            current = current.source;
+            continue;
+        }
+        if (current instanceof AliasNode) {
+            chain.push({ kind: 'alias', node: current });
+            current = current.source;
+            continue;
+        }
+        return null;
+    }
+}
+function setsIntersect(a, b) {
+    const [small, large] = a.size <= b.size ? [a, b] : [b, a];
+    for (const v of small) {
+        if (large.has(v))
+            return true;
+    }
+    return false;
+}
+/**
+ * AND-of-equalities check: every conjunct must be `colRef = colRef`. Any other
+ * predicate shape (range comparison, non-equality, OR, function calls, …)
+ * disqualifies the rewrite — those residuals can change row counts beyond what
+ * the FK→PK guarantee covers.
+ */
+export function isAndOfColumnEqualities(expr) {
+    if (!(expr instanceof BinaryOpNode))
+        return false;
+    const stack = [expr];
+    while (stack.length > 0) {
+        const n = stack.pop();
+        if (!(n instanceof BinaryOpNode))
+            return false;
+        const op = n.expression.operator;
+        if (op === 'AND') {
+            stack.push(n.left, n.right);
+            continue;
+        }
+        if (op !== '=')
+            return false;
+        if (!(n.left instanceof ColumnReferenceNode))
+            return false;
+        if (!(n.right instanceof ColumnReferenceNode))
+            return false;
+    }
+    return true;
+}
+/**
+ * Validate FK→PK alignment for eliminating `sideToRemove` and return the
+ * preserved side relational node when safe.
+ */
+function tryEliminate(join, sideToRemove, pairs) {
+    const leftSchema = extractTableSchema(join.left);
+    const rightSchema = extractTableSchema(join.right);
+    if (!leftSchema || !rightSchema)
+        return null;
+    // FK side is the preserved side; PK side is the side being removed.
+    const fkSchema = sideToRemove === 'right' ? leftSchema : rightSchema;
+    const pkSchema = sideToRemove === 'right' ? rightSchema : leftSchema;
+    const fkEquiCols = pairs.map(p => sideToRemove === 'right' ? p.left : p.right);
+    const pkEquiCols = pairs.map(p => sideToRemove === 'right' ? p.right : p.left);
+    if (!checkFkPkAlignment(fkSchema, pkSchema, fkEquiCols, pkEquiCols))
+        return null;
+    // INNER joins additionally require:
+    //  1. NOT NULL on every FK column — with nullable FK, rows with NULL FKs
+    //     wouldn't survive the inner join but would survive elimination.
+    //  2. The eliminable side must produce the underlying PK table's full row
+    //     set — any row-reducing wrapper (Filter, LimitOffset, Distinct,
+    //     RetrieveNode with a non-trivial pipeline) between the join and the
+    //     base table would have dropped rows that the FK→PK guarantee assumes
+    //     are present, so eliminating would silently survive orphaned FK rows.
+    if (join.joinType === 'inner') {
+        const match = lookupCoveringFK(fkSchema, pkSchema, fkEquiCols, pkEquiCols);
+        if (!match)
+            return null;
+        if (match.nullable)
+            return null;
+        const eliminableSide = sideToRemove === 'right' ? join.right : join.left;
+        if (!isRowPreservingPathToTable(eliminableSide))
+            return null;
+    }
+    return (sideToRemove === 'right' ? join.left : join.right);
+}
+function rebuildChain(chain, bottom) {
+    let current = bottom;
+    // Chain was collected top→bottom (root pushed first); rebuild bottom→top.
+    for (let i = chain.length - 1; i >= 0; i--) {
+        const entry = chain[i];
+        switch (entry.kind) {
+            case 'filter': {
+                current = new FilterNode(entry.node.scope, current, entry.node.predicate);
+                break;
+            }
+            case 'sort': {
+                current = new SortNode(entry.node.scope, current, entry.node.sortKeys);
+                break;
+            }
+            case 'limit': {
+                current = new LimitOffsetNode(entry.node.scope, current, entry.node.limit, entry.node.offset);
+                break;
+            }
+            case 'distinct': {
+                current = new DistinctNode(entry.node.scope, current);
+                break;
+            }
+            case 'alias': {
+                current = new AliasNode(entry.node.scope, current, entry.node.alias);
+                break;
+            }
+        }
+    }
+    return current;
+}
+/**
+ * Aggregate counterpart of `ruleJoinElimination`: when an Aggregate sits over
+ * a chain ending in an FK-covered inner join and the aggregate's payload only
+ * depends on the FK (left) side, drop the join.
+ *
+ * Why correct for `count(*)` and similar cardinality-only aggregates: a
+ * non-null FK with the IND `L.fk ⊆ R.pk` and an unfiltered R guarantees
+ * `|L ⋈ R| == |L|`, so `count(*)` over the join equals `count(*)` over L.
+ * More generally, when no aggregate argument or group key references R, the
+ * inner join's only effect is to gate L by `fk IS NOT NULL`, which the
+ * NOT-NULL precondition already rules out.
+ *
+ * Implementation mirrors the Project entrypoint: collect attribute IDs the
+ * Aggregate demands (group-key expressions + every aggregate expression),
+ * walk the wrapper chain to find the Join, run the same FK-PK alignment +
+ * row-preserving checks as the inner-join case, then rebuild the chain on
+ * the preserved side.
+ *
+ * Only `inner` joins are eligible here — outer joins reduce to inner in this
+ * context only when both sides demand attrs, which we'd have rejected already.
+ */
+export function ruleJoinEliminationUnderAggregate(node, _context) {
+    if (!(node instanceof AggregateNode))
+        return null;
+    const demanded = new Set();
+    for (const groupExpr of node.groupBy) {
+        collectAttrIds(groupExpr, demanded);
+    }
+    for (const agg of node.aggregates) {
+        collectAttrIds(agg.expression, demanded);
+    }
+    const walk = walkChain(node.source, demanded);
+    if (!walk)
+        return null;
+    const { join, chain } = walk;
+    // Only inner-eliminable shapes — see `ruleJoinElimination` notes.
+    if (join.joinType !== 'inner')
+        return null;
+    if (!join.condition)
+        return null;
+    const leftAttrs = join.left.getAttributes();
+    const rightAttrs = join.right.getAttributes();
+    const pairs = extractEquiPairsFromCondition(join.condition, leftAttrs, rightAttrs);
+    if (pairs.length === 0)
+        return null;
+    const normalized = normalizePredicate(join.condition);
+    if (!isAndOfColumnEqualities(normalized))
+        return null;
+    const leftIds = new Set(leftAttrs.map(a => a.id));
+    const rightIds = new Set(rightAttrs.map(a => a.id));
+    const usesLeft = setsIntersect(demanded, leftIds);
+    const usesRight = setsIntersect(demanded, rightIds);
+    let preserved = null;
+    if (!usesRight) {
+        preserved = tryEliminate(join, 'right', pairs);
+    }
+    if (!preserved && !usesLeft) {
+        preserved = tryEliminate(join, 'left', pairs);
+    }
+    if (!preserved)
+        return null;
+    log('Eliminating inner join under Aggregate; preserved side has %d attrs', preserved.getAttributes().length);
+    const newSource = rebuildChain(chain, preserved);
+    if (!isRelationalNode(newSource)) {
+        throw new Error('rule-join-elimination-aggregate: rebuilt source must be relational');
+    }
+    return new AggregateNode(node.scope, newSource, node.groupBy, node.aggregates, undefined, node.getAttributes());
+}
+function rebuildProject(project, newSource) {
+    const attributes = project.getAttributes();
+    const newProjections = project.projections.map((p, i) => ({
+        node: p.node,
+        alias: p.alias,
+        attributeId: attributes[i].id,
+    }));
+    if (!isRelationalNode(newSource)) {
+        throw new Error('rule-join-elimination: rebuilt source must be relational');
+    }
+    return new ProjectNode(project.scope, newSource, newProjections, undefined, attributes, project.preserveInputColumns);
+}
+//# sourceMappingURL=rule-join-elimination.js.map

package/dist/src/planner/rules/join/rule-join-elimination.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rule-join-elimination.js","sourceRoot":"","sources":["../../../../../src/planner/rules/join/rule-join-elimination.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAEzD,OAAO,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAE5D,OAAO,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAC1D,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAC/C,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAC9D,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAC5D,OAAO,EAAE,SAAS,EAAE,MAAM,2BAA2B,CAAC;AACtD,OAAO,EAAE,aAAa,EAAE,MAAM,+BAA+B,CAAC;AAC9D,OAAO,EAAE,QAAQ,EAAE,6BAA6B,EAAE,MAAM,0BAA0B,CAAC;AACnF,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,kBAAkB,EAAE,MAAM,wCAAwC,CAAC;AAC5E,OAAO,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AACjF,OAAO,EAAE,gBAAgB,EAAE,0BAA0B,EAAE,MAAM,yBAAyB,CAAC;AAEvF,MAAM,GAAG,GAAG,YAAY,CAAC,iCAAiC,CAAC,CAAC;AAc5D,MAAM,UAAU,mBAAmB,CAAC,IAAc,EAAE,QAAoB;IACvE,IAAI,CAAC,CAAC,IAAI,YAAY,WAAW,CAAC;QAAE,OAAO,IAAI,CAAC;IAEhD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;QACrC,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IACrC,CAAC;IAED,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IAC9C,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IAEvB,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;IAC7B,IAAI,IAAI,CAAC,QAAQ,KAAK,MAAM,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO;QAAE,OAAO,IAAI,CAAC;IACpG,IAAI,CAAC,IAAI,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IAEjC,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;IAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;IAC9C,MAAM,KAAK,GAAG,6BAA6B,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IACnF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEpC,MAAM,UAAU,GAAG,kBAAkB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACtD,IAAI,CAAC,uBAAuB,CAAC,UAAU,CAAC;QAAE,OAAO,IAAI,CAAC;IAEtD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpD,MAAM,QAAQ,GAAG,aAAa,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAClD,MAAM,SAAS,GAAG,aAAa,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAEpD,IAAI,SAAS,GAA8B,IAAI,CAAC;IAChD,QAAQ,IAAI,CAAC,QAAQ,EAAE,CAAC;QACvB,KAAK,MAAM;YACV,IAAI,SAAS;gBAAE,OAAO,IAAI,CAAC;YAC3B,SAAS,GAAG,YAAY,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;YAC/C,MAAM;QACP,KAAK,OAAO;YACX,IAAI,QAAQ;gBAAE,OAAO,IAAI,CAAC;YAC1B,SAAS,GAAG,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;YAC9C,MAAM;QACP,KAAK,OAAO;YACX,IAAI,CAAC,SAAS,EAAE,CAAC;gBAChB,SAAS,GAAG,YAAY,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;YAChD,CAAC;YACD,IAAI,CAAC,SAAS,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC7B,SAAS,GAAG,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;YAC/C,CAAC;YACD,MAAM;IACR,CAAC;IAED,IAAI,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IAE5B,GAAG,CAAC,gEAAgE,EACnE,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAC,aAAa,EAAE,CAAC,MAAM,CAAC,CAAC;IAElD,MAAM,SAAS,GAAG,YAAY,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACjD,OAAO,cAAc,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;AACxC,CAAC;AAED,SAAS,cAAc,CAAC,IAAc,EAAE,GAAgB;IACvD,IAAI,IAAI,YAAY,mBAAmB,EAAE,CAAC;QACzC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC1B,OAAO;IACR,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;QACxC,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAC5B,CAAC;AACF,CAAC;AAED,SAAS,SAAS,CAAC,IAAwB,EAAE,QAAqB;IACjE,MAAM,KAAK,GAAiB,EAAE,CAAC;IAC/B,IAAI,OAAO,GAAuB,IAAI,CAAC;IAEvC,OAAO,IAAI,EAAE,CAAC;QACb,IAAI,OAAO,YAAY,QAAQ,EAAE,CAAC;YACjC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;QACjC,CAAC;QACD,IAAI,OAAO,YAAY,UAAU,EAAE,CAAC;YACnC,cAAc,CAAC,OAAO,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;YAC5C,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;YAC9C,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;YACzB,SAAS;QACV,CAAC;QACD,IAAI,OAAO,YAAY,QAAQ,EAAE,CAAC;YACjC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;gBAClC,cAAc,CAAC,CAAC,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;YACxC,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;YAC5C,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;YACzB,SAAS;QACV,CAAC;QACD,IAAI,OAAO,YAAY,eAAe,EAAE,CAAC;YACxC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;YAC7C,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;YACzB,SAAS;QACV,CAAC;QACD,IAAI,OAAO,YAAY,YAAY,EAAE,CAAC;YACrC,0EAA0E;YAC1E,0DAA0D;YAC1D,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;YAChD,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;YACzB,SAAS;QACV,CAAC;QACD,IAAI,OAAO,YAAY,SAAS,EAAE,CAAC;YAClC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;YAC7C,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;YACzB,SAAS;QACV,CAAC;QACD,OAAO,IAAI,CAAC;IACb,CAAC;AACF,CAAC;AAED,SAAS,aAAa,CAAC,CAAsB,EAAE,CAAsB;IACpE,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1D,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACvB,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;IAC/B,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,uBAAuB,CAAC,IAAoB;IAC3D,IAAI,CAAC,CAAC,IAAI,YAAY,YAAY,CAAC;QAAE,OAAO,KAAK,CAAC;IAClD,MAAM,KAAK,GAAqB,CAAC,IAAI,CAAC,CAAC;IACvC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACvB,IAAI,CAAC,CAAC,CAAC,YAAY,YAAY,CAAC;YAAE,OAAO,KAAK,CAAC;QAC/C,MAAM,EAAE,GAAG,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC;QACjC,IAAI,EAAE,KAAK,KAAK,EAAE,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;YAC5B,SAAS;QACV,CAAC;QACD,IAAI,EAAE,KAAK,GAAG;YAAE,OAAO,KAAK,CAAC;QAC7B,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,YAAY,mBAAmB,CAAC;YAAE,OAAO,KAAK,CAAC;QAC3D,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,YAAY,mBAAmB,CAAC;YAAE,OAAO,KAAK,CAAC;IAC7D,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,SAAS,YAAY,CACpB,IAAc,EACd,YAA8B,EAC9B,KAAqD;IAErD,MAAM,UAAU,GAAG,kBAAkB,CAAC,IAAI,CAAC,IAA0B,CAAC,CAAC;IACvE,MAAM,WAAW,GAAG,kBAAkB,CAAC,IAAI,CAAC,KAA2B,CAAC,CAAC;IACzE,IAAI,CAAC,UAAU,IAAI,CAAC,WAAW;QAAE,OAAO,IAAI,CAAC;IAE7C,oEAAoE;IACpE,MAAM,QAAQ,GAAG,YAAY,KAAK,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW,CAAC;IACrE,MAAM,QAAQ,GAAG,YAAY,KAAK,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC;IACrE,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAC/E,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAE/E,IAAI,CAAC,kBAAkB,CAAC,QAAQ,EAAE,QAAQ,EAAE,UAAU,EAAE,UAAU,CAAC;QAAE,OAAO,IAAI,CAAC;IAEjF,oCAAoC;IACpC,yEAAyE;IACzE,qEAAqE;IACrE,0EAA0E;IAC1E,qEAAqE;IACrE,yEAAyE;IACzE,0EAA0E;IAC1E,2EAA2E;IAC3E,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;QAC3E,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC;QACxB,IAAI,KAAK,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC;QAChC,MAAM,cAAc,GAAG,YAAY,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QACzE,IAAI,CAAC,0BAA0B,CAAC,cAAoC,CAAC;YAAE,OAAO,IAAI,CAAC;IACpF,CAAC;IAED,OAAO,CAAC,YAAY,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAuB,CAAC;AAClF,CAAC;AAED,SAAS,YAAY,CAAC,KAAgC,EAAE,MAA0B;IACjF,IAAI,OAAO,GAAG,MAAM,CAAC;IACrB,0EAA0E;IAC1E,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACvB,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;YACpB,KAAK,QAAQ,CAAC,CAAC,CAAC;gBACf,OAAO,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC1E,MAAM;YACP,CAAC;YACD,KAAK,MAAM,CAAC,CAAC,CAAC;gBACb,OAAO,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACvE,MAAM;YACP,CAAC;YACD,KAAK,OAAO,CAAC,CAAC,CAAC;gBACd,OAAO,GAAG,IAAI,eAAe,CAC5B,KAAK,CAAC,IAAI,CAAC,KAAK,EAChB,OAAO,EACP,KAAK,CAAC,IAAI,CAAC,KAAK,EAChB,KAAK,CAAC,IAAI,CAAC,MAAM,CACjB,CAAC;gBACF,MAAM;YACP,CAAC;YACD,KAAK,UAAU,CAAC,CAAC,CAAC;gBACjB,OAAO,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;gBACtD,MAAM;YACP,CAAC;YACD,KAAK,OAAO,CAAC,CAAC,CAAC;gBACd,OAAO,GAAG,IAAI,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACrE,MAAM;YACP,CAAC;QACF,CAAC;IACF,CAAC;IACD,OAAO,OAAO,CAAC;AAChB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,iCAAiC,CAAC,IAAc,EAAE,QAAoB;IACrF,IAAI,CAAC,CAAC,IAAI,YAAY,aAAa,CAAC;QAAE,OAAO,IAAI,CAAC;IAElD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QACtC,cAAc,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IACrC,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;QACnC,cAAc,CAAC,GAAG,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;IAC1C,CAAC;IAED,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IAC9C,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IAEvB,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;IAC7B,kEAAkE;IAClE,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO;QAAE,OAAO,IAAI,CAAC;IAC3C,IAAI,CAAC,IAAI,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IAEjC,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;IAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;IAC9C,MAAM,KAAK,GAAG,6BAA6B,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IACnF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEpC,MAAM,UAAU,GAAG,kBAAkB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACtD,IAAI,CAAC,uBAAuB,CAAC,UAAU,CAAC;QAAE,OAAO,IAAI,CAAC;IAEtD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpD,MAAM,QAAQ,GAAG,aAAa,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAClD,MAAM,SAAS,GAAG,aAAa,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAEpD,IAAI,SAAS,GAA8B,IAAI,CAAC;IAChD,IAAI,CAAC,SAAS,EAAE,CAAC;QAChB,SAAS,GAAG,YAAY,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;IAChD,CAAC;IACD,IAAI,CAAC,SAAS,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC7B,SAAS,GAAG,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAC/C,CAAC;IACD,IAAI,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IAE5B,GAAG,CAAC,qEAAqE,EACxE,SAAS,CAAC,aAAa,EAAE,CAAC,MAAM,CAAC,CAAC;IAEnC,MAAM,SAAS,GAAG,YAAY,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACjD,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,KAAK,CAAC,oEAAoE,CAAC,CAAC;IACvF,CAAC;IACD,OAAO,IAAI,aAAa,CACvB,IAAI,CAAC,KAAK,EACV,SAA+B,EAC/B,IAAI,CAAC,OAAO,EACZ,IAAI,CAAC,UAAU,EACf,SAAS,EACT,IAAI,CAAC,aAAa,EAAE,CACpB,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CAAC,OAAoB,EAAE,SAA6B;IAC1E,MAAM,UAAU,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAC3C,MAAM,cAAc,GAAG,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACzD,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,WAAW,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE;KAC7B,CAAC,CAAC,CAAC;IACJ,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,KAAK,CAAC,0DAA0D,CAAC,CAAC;IAC7E,CAAC;IACD,OAAO,IAAI,WAAW,CACrB,OAAO,CAAC,KAAK,EACb,SAAS,EACT,cAAc,EACd,SAAS,EACT,UAAU,EACV,OAAO,CAAC,oBAAoB,CAC5B,CAAC;AACH,CAAC"}

package/dist/src/planner/rules/join/rule-join-greedy-commute.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"rule-join-greedy-commute.d.ts","sourceRoot":"","sources":["../../../../../src/planner/rules/join/rule-join-greedy-commute.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,QAAQ,EAAsB,MAAM,0BAA0B,CAAC;AAC7E,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAK7D;;;;;;;;;GASG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,GAAG,QAAQ,GAAG,IAAI,CA4B3F"}
+{"version":3,"file":"rule-join-greedy-commute.d.ts","sourceRoot":"","sources":["../../../../../src/planner/rules/join/rule-join-greedy-commute.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,QAAQ,EAAsB,MAAM,0BAA0B,CAAC;AAC7E,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAa7D;;;;;;;;;GASG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,GAAG,QAAQ,GAAG,IAAI,CA4B3F"}

package/dist/src/planner/rules/join/rule-join-greedy-commute.js

@@ -1,6 +1,14 @@
 import { createLogger } from '../../../common/logger.js';
 import { JoinNode } from '../../nodes/join-node.js';
+import { hasSingletonFd } from '../../util/fd-utils.js';
 const log = createLogger('optimizer:rule:join-greedy-commute');
+/** True when the relation provably emits at most one row. */
+function isSingleton(node) {
+    const colCount = node.getAttributes().length;
+    if (colCount === 0)
+        return node.physical?.estimatedRows === 1;
+    return hasSingletonFd(node.physical?.fds, colCount);
+}
 /**
  * Rule: Join Greedy Commute
  *
@@ -19,8 +27,8 @@ export function ruleJoinGreedyCommute(node, _context) {
     const leftRows = node.getLeftSource().estimatedRows ?? Number.POSITIVE_INFINITY;
     const rightRows = node.getRightSource().estimatedRows ?? Number.POSITIVE_INFINITY;
     // Prefer known finite estimatedRows; also detect <=1 row driver on either side
-    const leftIsSingleton = node.getLeftSource().physical.uniqueKeys?.some(k => k.length === 0) === true;
-    const rightIsSingleton = node.getRightSource().physical.uniqueKeys?.some(k => k.length === 0) === true;
+    const leftIsSingleton = isSingleton(node.getLeftSource());
+    const rightIsSingleton = isSingleton(node.getRightSource());
     // If right is strictly better driver (smaller or singleton), swap
     const shouldSwap = (rightIsSingleton && !leftIsSingleton) || (!rightIsSingleton && !leftIsSingleton && rightRows < leftRows);
     if (!shouldSwap)

package/dist/src/planner/rules/join/rule-join-greedy-commute.js.map

@@ -1 +1 @@
-{"version":3,"file":"rule-join-greedy-commute.js","sourceRoot":"","sources":["../../../../../src/planner/rules/join/rule-join-greedy-commute.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAGzD,OAAO,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAEpD,MAAM,GAAG,GAAG,YAAY,CAAC,oCAAoC,CAAC,CAAC;AAE/D;;;;;;;;;GASG;AACH,MAAM,UAAU,qBAAqB,CAAC,IAAc,EAAE,QAAoB;IACxE,IAAI,CAAC,CAAC,IAAI,YAAY,QAAQ,CAAC;QAAE,OAAO,IAAI,CAAC;IAC7C,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO;QAAE,OAAO,IAAI,CAAC;IAExE,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,aAAa,IAAI,MAAM,CAAC,iBAAiB,CAAC;IAChF,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC,aAAa,IAAI,MAAM,CAAC,iBAAiB,CAAC;IAElF,+EAA+E;IAC/E,MAAM,eAAe,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,QAAQ,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,KAAK,IAAI,CAAC;IACrG,MAAM,gBAAgB,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC,QAAQ,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,KAAK,IAAI,CAAC;IAEvG,kEAAkE;IAClE,MAAM,UAAU,GAAG,CAAC,gBAAgB,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,gBAAgB,IAAI,CAAC,eAAe,IAAI,SAAS,GAAG,QAAQ,CAAC,CAAC;IAC7H,IAAI,CAAC,UAAU;QAAE,OAAO,IAAI,CAAC;IAE7B,GAAG,CAAC,wFAAwF,EAAE,MAAM,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;IAEnI,qEAAqE;IACrE,MAAM,OAAO,GAAG,IAAI,QAAQ,CAC1B,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,cAAc,EAAwB,EAC3C,IAAI,CAAC,aAAa,EAAwB,EAC1C,IAAI,CAAC,WAAW,EAAE,EAClB,IAAI,CAAC,gBAAgB,EAAE,EACvB,IAAI,CAAC,eAAe,EAAE,CACvB,CAAC;IAEF,OAAO,OAAO,CAAC;AACjB,CAAC"}
+{"version":3,"file":"rule-join-greedy-commute.js","sourceRoot":"","sources":["../../../../../src/planner/rules/join/rule-join-greedy-commute.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAGzD,OAAO,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AACpD,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AAExD,MAAM,GAAG,GAAG,YAAY,CAAC,oCAAoC,CAAC,CAAC;AAE/D,6DAA6D;AAC7D,SAAS,WAAW,CAAC,IAAwB;IAC5C,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,MAAM,CAAC;IAC7C,IAAI,QAAQ,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC,QAAQ,EAAE,aAAa,KAAK,CAAC,CAAC;IAC9D,OAAO,cAAc,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;AACrD,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,qBAAqB,CAAC,IAAc,EAAE,QAAoB;IACxE,IAAI,CAAC,CAAC,IAAI,YAAY,QAAQ,CAAC;QAAE,OAAO,IAAI,CAAC;IAC7C,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO;QAAE,OAAO,IAAI,CAAC;IAExE,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,aAAa,IAAI,MAAM,CAAC,iBAAiB,CAAC;IAChF,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC,aAAa,IAAI,MAAM,CAAC,iBAAiB,CAAC;IAElF,+EAA+E;IAC/E,MAAM,eAAe,GAAG,WAAW,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;IAC1D,MAAM,gBAAgB,GAAG,WAAW,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC;IAE5D,kEAAkE;IAClE,MAAM,UAAU,GAAG,CAAC,gBAAgB,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,gBAAgB,IAAI,CAAC,eAAe,IAAI,SAAS,GAAG,QAAQ,CAAC,CAAC;IAC7H,IAAI,CAAC,UAAU;QAAE,OAAO,IAAI,CAAC;IAE7B,GAAG,CAAC,wFAAwF,EAAE,MAAM,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;IAEnI,qEAAqE;IACrE,MAAM,OAAO,GAAG,IAAI,QAAQ,CAC1B,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,cAAc,EAAwB,EAC3C,IAAI,CAAC,aAAa,EAAwB,EAC1C,IAAI,CAAC,WAAW,EAAE,EAClB,IAAI,CAAC,gBAAgB,EAAE,EACvB,IAAI,CAAC,eAAe,EAAE,CACvB,CAAC;IAEF,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/src/planner/rules/join/rule-join-physical-selection.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"rule-join-physical-selection.d.ts","sourceRoot":"","sources":["../../../../../src/planner/rules/join/rule-join-physical-selection.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAiD,MAAM,0BAA0B,CAAC;AACxG,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAkL7D,wBAAgB,yBAAyB,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,GAAG,QAAQ,GAAG,IAAI,CAiJ/F"}
+{"version":3,"file":"rule-join-physical-selection.d.ts","sourceRoot":"","sources":["../../../../../src/planner/rules/join/rule-join-physical-selection.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAiD,MAAM,0BAA0B,CAAC;AACxG,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AA+C7D,wBAAgB,yBAAyB,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,GAAG,QAAQ,GAAG,IAAI,CAqI/F"}