@quereus/quereus 3.1.2 → 3.3.0

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

@@ -1,6 +1,6 @@
 import { createLogger } from '../../../common/logger.js';
 import { DistinctNode } from '../../nodes/distinct-node.js';
-import { hasAnyKey, hasSingletonFd } from '../../util/fd-utils.js';
+import { keysOf } from '../../util/fd-utils.js';
 const log = createLogger('optimizer:rule:distinct-elimination');
 /**
  * Rule: DISTINCT Elimination
@@ -8,30 +8,23 @@ const log = createLogger('optimizer:rule:distinct-elimination');
  * When a DistinctNode's source already guarantees unique rows, the DISTINCT is
  * redundant and can be removed.
  *
- * Sources of uniqueness proof:
- * 1. Logical keys (`RelationType.keys`) — schema-declared, available at any time.
- * 2. Physical FD set — encodes derived keys as `K → all_other_cols` FDs, plus
- *    the singleton `∅ → all_cols` for at-most-one-row claims.
- *
- * A non-empty key proof on the source proves it already produces unique rows —
- * DISTINCT is a no-op.
+ * Uniqueness is read through the single `keysOf` surface, which reconciles all
+ * three places a uniqueness fact can live (declared `RelationType.keys`, the
+ * physical FD set, and `RelationType.isSet`): a non-empty key set ⟺ the source
+ * is already a set ⟺ DISTINCT is a no-op. This closes the gap where a
+ * `select distinct x, y` (which proves only the all-columns/`isSet` key, not a
+ * smaller FD/declared key) was invisible to the FD-only checks — so an outer
+ * `select distinct x, y from (select distinct x, y …)` now drops the redundant
+ * outer DISTINCT.
  */
 export function ruleDistinctElimination(node, _context) {
     if (!(node instanceof DistinctNode))
         return null;
-    // Logical keys (RelationType.keys) are the schema-level claim.
-    const sourceType = node.source.getType();
-    if (sourceType.keys && sourceType.keys.length > 0) {
-        log('Eliminating redundant DISTINCT: source has logical keys %j', sourceType.keys);
-        return node.source;
-    }
-    // Physical FDs: an FD whose determinants form a non-trivial superkey of the
-    // source columns proves uniqueness; the singleton `∅ → all_cols` proves
-    // at-most-one-row (also unique).
-    const sourcePhys = node.source.physical;
-    const colCount = node.source.getAttributes().length;
-    if (hasAnyKey(sourcePhys?.fds, colCount) || hasSingletonFd(sourcePhys?.fds, colCount)) {
-        log('Eliminating redundant DISTINCT: source FDs imply unique rows');
+    // A non-empty key set proves the source already produces unique rows. This
+    // covers logical keys, FD-derived keys, the at-most-one-row empty key, and
+    // the all-columns/`isSet` key — all via the unified surface.
+    if (keysOf(node.source).length > 0) {
+        log('Eliminating redundant DISTINCT: source has a proven unique key');
         return node.source;
     }
     return null;

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

@@ -1 +1 @@
-{"version":3,"file":"rule-distinct-elimination.js","sourceRoot":"","sources":["../../../../../src/planner/rules/distinct/rule-distinct-elimination.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAGzD,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAC5D,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AAEnE,MAAM,GAAG,GAAG,YAAY,CAAC,qCAAqC,CAAC,CAAC;AAEhE;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,uBAAuB,CAAC,IAAc,EAAE,QAAoB;IAC3E,IAAI,CAAC,CAAC,IAAI,YAAY,YAAY,CAAC;QAAE,OAAO,IAAI,CAAC;IAEjD,+DAA+D;IAC/D,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;IACzC,IAAI,UAAU,CAAC,IAAI,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACnD,GAAG,CAAC,4DAA4D,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC;QACnF,OAAO,IAAI,CAAC,MAAM,CAAC;IACpB,CAAC;IAED,4EAA4E;IAC5E,wEAAwE;IACxE,iCAAiC;IACjC,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;IACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC,MAAM,CAAC;IACpD,IAAI,SAAS,CAAC,UAAU,EAAE,GAAG,EAAE,QAAQ,CAAC,IAAI,cAAc,CAAC,UAAU,EAAE,GAAG,EAAE,QAAQ,CAAC,EAAE,CAAC;QACvF,GAAG,CAAC,8DAA8D,CAAC,CAAC;QACpE,OAAO,IAAI,CAAC,MAAM,CAAC;IACpB,CAAC;IAED,OAAO,IAAI,CAAC;AACb,CAAC"}
+{"version":3,"file":"rule-distinct-elimination.js","sourceRoot":"","sources":["../../../../../src/planner/rules/distinct/rule-distinct-elimination.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAGzD,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAC5D,OAAO,EAAE,MAAM,EAAE,MAAM,wBAAwB,CAAC;AAEhD,MAAM,GAAG,GAAG,YAAY,CAAC,qCAAqC,CAAC,CAAC;AAEhE;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,uBAAuB,CAAC,IAAc,EAAE,QAAoB;IAC3E,IAAI,CAAC,CAAC,IAAI,YAAY,YAAY,CAAC;QAAE,OAAO,IAAI,CAAC;IAEjD,2EAA2E;IAC3E,2EAA2E;IAC3E,6DAA6D;IAC7D,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpC,GAAG,CAAC,gEAAgE,CAAC,CAAC;QACtE,OAAO,IAAI,CAAC,MAAM,CAAC;IACpB,CAAC;IAED,OAAO,IAAI,CAAC;AACb,CAAC"}

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

@@ -20,10 +20,10 @@ export function isOrderedOnEquiPairs(source, equiPairs, side) {
         return false;
     if (equiPairs.length > ordering.length)
         return false;
-    const attrs = source.getAttributes();
+    const attrIndex = source.getAttributeIndex();
     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);
+        const idx = attrIndex.get(attrId) ?? -1;
         if (idx === -1)
             return false;
         if (ordering[i].column !== idx || ordering[i].desc)
@@ -40,10 +40,10 @@ export function reorderEquiPairsForMerge(equiPairs, left, right) {
     const leftOrdering = PlanNodeCharacteristics.getOrdering(left);
     if (!leftOrdering || leftOrdering.length < equiPairs.length)
         return null;
-    const leftAttrs = left.getAttributes();
+    const leftAttrIndex = left.getAttributeIndex();
     const colToEqIdx = new Map();
     for (let i = 0; i < equiPairs.length; i++) {
-        const attrIdx = leftAttrs.findIndex(a => a.id === equiPairs[i].leftAttrId);
+        const attrIdx = leftAttrIndex.get(equiPairs[i].leftAttrId) ?? -1;
         if (attrIdx === -1)
             return null;
         colToEqIdx.set(attrIdx, i);

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

@@ -1 +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"}
+{"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,SAAS,GAAG,MAAM,CAAC,iBAAiB,EAAE,CAAC;IAC7C,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,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;QACxC,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,aAAa,GAAG,IAAI,CAAC,iBAAiB,EAAE,CAAC;IAC/C,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,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;QACjE,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-fanout-batched-outer.d.ts

@@ -0,0 +1,74 @@
+/**
+ * Rule: Fan-out Batched Outer
+ *
+ * Flips an already-formed `FanOutLookupJoinNode` from the default `serial` outer
+ * mode to `batched` (cross-row pipelined) when the cost model says overlapping
+ * lookups *across* outer rows pays off. This is the recognition rule that
+ * *chooses* the batched runtime (`runFanOutLookupJoinBatched`); the runtime
+ * itself landed in `parallel-fanout-lookup-join-batched-outer`.
+ *
+ * **Why a post-pass, not a formation-time decision.** `rule-fanout-lookup-join`
+ * forms the node in `PassId.Structural`; this rule runs in `PassId.Post-
+ * Optimization` (priority 16, in the `eager-prefetch-probe` / `async-gather`
+ * neighborhood) after physical-pass selection has finalized leaf
+ * `expectedLatencyMs` / `estimatedRows` / `concurrencySafe`. Matching the
+ * already-built `FanOutLookupJoinNode` keeps the batched decision a single,
+ * isolated rewrite rather than another recognition path.
+ *
+ * **When batched wins.** Batched mode helps when there are *many outer rows but
+ * few branches per row* — the per-row branch count under-saturates the global
+ * in-flight budget, so admitting more outer rows ahead of the emit frontier is
+ * the only way to fill it. All of the following must hold:
+ *
+ *   - **Budget under-saturated per row:** `branchCount < outerBatchConcurrency`.
+ *     When a single row's branches already meet/exceed the global budget,
+ *     cross-row admission buys nothing (the budget is full from one row).
+ *   - **High-latency branches:** the slowest branch's `expectedLatencyMs` clears
+ *     `tuning.parallel.batchedOuterThresholdMs`. This is 0 on every memory-vtab
+ *     leaf, so the rule is **inert by design on local-only plans** — the golden
+ *     sweep is unaffected, same discipline as `gatherThresholdMs` /
+ *     `prefetchProbeThresholdMs`.
+ *   - **Large outer cardinality:** `outer.estimatedRows >= batchedOuterMinRows`,
+ *     so cross-row overlap dominates the reorder-buffer + per-row-fork overhead.
+ *     An unknown estimate fails the gate (never flip on a missing statistic).
+ *
+ * **Cross branches are out of scope.** A cross (1:n) branch's batched outer
+ * mode is owned by `parallel-fanout-lookup-join-cross-mode`; this rule only
+ * flips clusters whose branches are all `atMostOne-*`. A node carrying any
+ * `cross` or `cross-left` branch is left serial (both are 1:n cross factors).
+ *
+ * **Outer-source isolation (load-bearing correctness).** The batched driver
+ * pumps the outer source *concurrently* with in-flight per-row branch forks —
+ * unlike serial mode, which fully resolves one outer row before pulling the
+ * next. The scheduler runs every instruction against one shared
+ * `RuntimeContext`, so a raw outer sub-plan that mutates `rctx.context` during
+ * the pump (installing a row slot, etc.) would (a) risk a torn read for any
+ * branch reading that entry and (b) throw a strict-fork violation when the
+ * fan-out is nested under another fork (so `rctx.context` is strict-wrapped) and
+ * the live row forks hold the bump counter. To neutralize both, this rule wraps
+ * the outer in an `EagerPrefetchNode` when it flips to batched: the prefetch
+ * pump runs the outer sub-plan against its *own* forked context (mutations land
+ * on the fork, never on the shared `rctx.context` the row forks bump), and the
+ * batched pump merely drains the prefetch buffer — a pure buffer read that never
+ * touches `rctx.context`. So **batched implies prefetch** (the reverse does not
+ * hold; `eager-prefetch-probe` uses the node independently). The prefetch buffer
+ * also feeds the read-ahead window the batched driver consumes across rows, so
+ * the two compose rather than duplicate work. The branch correlations are
+ * already safe by construction: `rule-fanout-lookup-join` only clusters branches
+ * (spine + correlated scalar-aggregate subqueries) that reference the *outer
+ * row's* attributes, which the batched driver isolates per row in its own boxed
+ * slot.
+ *
+ * **Outer concurrency gate.** Because the prefetch pump iterates the outer
+ * concurrently with branch lookups, the outer must advertise
+ * `physical.concurrencySafe === true` (mirroring `eager-prefetch-probe` /
+ * `async-gather`). Serial mode never overlapped these, so this gate is
+ * batched-specific.
+ *
+ * **Idempotence.** After the rewrite `outerMode === 'batched'`, so a second
+ * firing returns null immediately.
+ */
+import type { OptContext } from '../../framework/context.js';
+import type { PlanNode } from '../../nodes/plan-node.js';
+export declare function ruleFanOutBatchedOuter(node: PlanNode, context: OptContext): PlanNode | null;
+//# sourceMappingURL=rule-fanout-batched-outer.d.ts.map

package/dist/src/planner/rules/join/rule-fanout-batched-outer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rule-fanout-batched-outer.d.ts","sourceRoot":"","sources":["../../../../../src/planner/rules/join/rule-fanout-batched-outer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqEG;AAGH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAC7D,OAAO,KAAK,EAAE,QAAQ,EAAsB,MAAM,0BAA0B,CAAC;AAyB7E,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,UAAU,GAAG,QAAQ,GAAG,IAAI,CAsD3F"}

package/dist/src/planner/rules/join/rule-fanout-batched-outer.js

@@ -0,0 +1,139 @@
+/**
+ * Rule: Fan-out Batched Outer
+ *
+ * Flips an already-formed `FanOutLookupJoinNode` from the default `serial` outer
+ * mode to `batched` (cross-row pipelined) when the cost model says overlapping
+ * lookups *across* outer rows pays off. This is the recognition rule that
+ * *chooses* the batched runtime (`runFanOutLookupJoinBatched`); the runtime
+ * itself landed in `parallel-fanout-lookup-join-batched-outer`.
+ *
+ * **Why a post-pass, not a formation-time decision.** `rule-fanout-lookup-join`
+ * forms the node in `PassId.Structural`; this rule runs in `PassId.Post-
+ * Optimization` (priority 16, in the `eager-prefetch-probe` / `async-gather`
+ * neighborhood) after physical-pass selection has finalized leaf
+ * `expectedLatencyMs` / `estimatedRows` / `concurrencySafe`. Matching the
+ * already-built `FanOutLookupJoinNode` keeps the batched decision a single,
+ * isolated rewrite rather than another recognition path.
+ *
+ * **When batched wins.** Batched mode helps when there are *many outer rows but
+ * few branches per row* — the per-row branch count under-saturates the global
+ * in-flight budget, so admitting more outer rows ahead of the emit frontier is
+ * the only way to fill it. All of the following must hold:
+ *
+ *   - **Budget under-saturated per row:** `branchCount < outerBatchConcurrency`.
+ *     When a single row's branches already meet/exceed the global budget,
+ *     cross-row admission buys nothing (the budget is full from one row).
+ *   - **High-latency branches:** the slowest branch's `expectedLatencyMs` clears
+ *     `tuning.parallel.batchedOuterThresholdMs`. This is 0 on every memory-vtab
+ *     leaf, so the rule is **inert by design on local-only plans** — the golden
+ *     sweep is unaffected, same discipline as `gatherThresholdMs` /
+ *     `prefetchProbeThresholdMs`.
+ *   - **Large outer cardinality:** `outer.estimatedRows >= batchedOuterMinRows`,
+ *     so cross-row overlap dominates the reorder-buffer + per-row-fork overhead.
+ *     An unknown estimate fails the gate (never flip on a missing statistic).
+ *
+ * **Cross branches are out of scope.** A cross (1:n) branch's batched outer
+ * mode is owned by `parallel-fanout-lookup-join-cross-mode`; this rule only
+ * flips clusters whose branches are all `atMostOne-*`. A node carrying any
+ * `cross` or `cross-left` branch is left serial (both are 1:n cross factors).
+ *
+ * **Outer-source isolation (load-bearing correctness).** The batched driver
+ * pumps the outer source *concurrently* with in-flight per-row branch forks —
+ * unlike serial mode, which fully resolves one outer row before pulling the
+ * next. The scheduler runs every instruction against one shared
+ * `RuntimeContext`, so a raw outer sub-plan that mutates `rctx.context` during
+ * the pump (installing a row slot, etc.) would (a) risk a torn read for any
+ * branch reading that entry and (b) throw a strict-fork violation when the
+ * fan-out is nested under another fork (so `rctx.context` is strict-wrapped) and
+ * the live row forks hold the bump counter. To neutralize both, this rule wraps
+ * the outer in an `EagerPrefetchNode` when it flips to batched: the prefetch
+ * pump runs the outer sub-plan against its *own* forked context (mutations land
+ * on the fork, never on the shared `rctx.context` the row forks bump), and the
+ * batched pump merely drains the prefetch buffer — a pure buffer read that never
+ * touches `rctx.context`. So **batched implies prefetch** (the reverse does not
+ * hold; `eager-prefetch-probe` uses the node independently). The prefetch buffer
+ * also feeds the read-ahead window the batched driver consumes across rows, so
+ * the two compose rather than duplicate work. The branch correlations are
+ * already safe by construction: `rule-fanout-lookup-join` only clusters branches
+ * (spine + correlated scalar-aggregate subqueries) that reference the *outer
+ * row's* attributes, which the batched driver isolates per row in its own boxed
+ * slot.
+ *
+ * **Outer concurrency gate.** Because the prefetch pump iterates the outer
+ * concurrently with branch lookups, the outer must advertise
+ * `physical.concurrencySafe === true` (mirroring `eager-prefetch-probe` /
+ * `async-gather`). Serial mode never overlapped these, so this gate is
+ * batched-specific.
+ *
+ * **Idempotence.** After the rewrite `outerMode === 'batched'`, so a second
+ * firing returns null immediately.
+ */
+import { createLogger } from '../../../common/logger.js';
+import { PlanNodeType } from '../../nodes/plan-node-type.js';
+import { FanOutLookupJoinNode, isCrossBranchMode } from '../../nodes/fanout-lookup-join-node.js';
+import { EagerPrefetchNode } from '../../nodes/eager-prefetch-node.js';
+const log = createLogger('optimizer:rule:fanout-batched-outer');
+/**
+ * Best-available row estimate for the fan-out's outer. The leaf access node
+ * carries `physical.estimatedRows` but several pass-through wrappers (notably
+ * `AliasNode`) propagate it via the `.estimatedRows` getter, which the leaves do
+ * not all populate — so a value can be present on the leaf's `physical` yet
+ * undefined on the wrapper above it. Read the node's own estimate first, then
+ * descend single-relation pass-throughs (alias/filter/sort/…) to recover the
+ * leaf's estimate. A multi-relation node (a join outer in a subquery cluster)
+ * returns `undefined`, which the caller treats as failing the cardinality gate.
+ */
+function outerRowEstimate(node) {
+    const direct = node.physical?.estimatedRows ?? node.estimatedRows;
+    if (direct !== undefined)
+        return direct;
+    const relations = node.getRelations();
+    if (relations.length === 1)
+        return outerRowEstimate(relations[0]);
+    return undefined;
+}
+export function ruleFanOutBatchedOuter(node, context) {
+    if (!(node instanceof FanOutLookupJoinNode))
+        return null;
+    if (node.outerMode === 'batched')
+        return null; // idempotence
+    const tuning = context.tuning.parallel;
+    const branchCount = node.branches.length;
+    // Cross-branch batched outer is owned by the cross-mode ticket; only flip
+    // clusters whose branches are all at-most-one. `cross-left` is a 1:n cross
+    // factor too, so it is excluded on the same grounds as `cross`.
+    if (node.branches.some(b => isCrossBranchMode(b.mode)))
+        return null;
+    // Budget under-saturation: batched only helps when one row's branches leave
+    // global-budget headroom for *more* outer rows to fill.
+    if (branchCount >= tuning.outerBatchConcurrency)
+        return null;
+    // Latency gate: the slowest branch must clear the threshold. Inert on
+    // memory-vtab plans (expectedLatencyMs = 0 throughout).
+    let maxLatency = 0;
+    for (const b of node.branches) {
+        const l = b.child.physical.expectedLatencyMs ?? 0;
+        if (l > maxLatency)
+            maxLatency = l;
+    }
+    if (maxLatency < tuning.batchedOuterThresholdMs)
+        return null;
+    // Cardinality gate: enough outer rows for cross-row overlap to amortize the
+    // reorder-buffer / per-row-fork overhead. Unknown estimate fails the gate.
+    const outerRows = outerRowEstimate(node.outer);
+    if (outerRows === undefined || outerRows < tuning.batchedOuterMinRows)
+        return null;
+    // Concurrency gate: the prefetch pump iterates the outer concurrently with
+    // branch lookups, so the outer must be proven concurrency-safe.
+    if (node.outer.physical.concurrencySafe !== true)
+        return null;
+    // Wrap the outer in EagerPrefetch (isolation + read-ahead feed) unless it is
+    // already prefetched. Sized to `maxOuterReadAhead` — the outer-read-ahead
+    // bound this node's batched driver works against.
+    const outer = node.outer.nodeType === PlanNodeType.EagerPrefetch
+        ? node.outer
+        : new EagerPrefetchNode(node.scope, node.outer, tuning.maxOuterReadAhead);
+    log('Flipping FanOutLookupJoin %s to batched outer mode (branches=%d, maxLatency=%d ms, outerRows=%s, globalCap=%d)', node.id, branchCount, maxLatency, String(outerRows), tuning.outerBatchConcurrency);
+    return new FanOutLookupJoinNode(node.scope, outer, node.branches, node.concurrencyCap, node.preserveAttributeIds, 'batched');
+}
+//# sourceMappingURL=rule-fanout-batched-outer.js.map

package/dist/src/planner/rules/join/rule-fanout-batched-outer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rule-fanout-batched-outer.js","sourceRoot":"","sources":["../../../../../src/planner/rules/join/rule-fanout-batched-outer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqEG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAGzD,OAAO,EAAE,YAAY,EAAE,MAAM,+BAA+B,CAAC;AAC7D,OAAO,EAAE,oBAAoB,EAAE,iBAAiB,EAAE,MAAM,wCAAwC,CAAC;AACjG,OAAO,EAAE,iBAAiB,EAAE,MAAM,oCAAoC,CAAC;AAEvE,MAAM,GAAG,GAAG,YAAY,CAAC,qCAAqC,CAAC,CAAC;AAEhE;;;;;;;;;GASG;AACH,SAAS,gBAAgB,CAAC,IAAwB;IACjD,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC;IAClE,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IACxC,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;IACtC,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,gBAAgB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,IAAc,EAAE,OAAmB;IACzE,IAAI,CAAC,CAAC,IAAI,YAAY,oBAAoB,CAAC;QAAE,OAAO,IAAI,CAAC;IACzD,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC,CAAC,cAAc;IAE7D,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC;IACvC,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;IAEzC,0EAA0E;IAC1E,2EAA2E;IAC3E,gEAAgE;IAChE,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAEpE,4EAA4E;IAC5E,wDAAwD;IACxD,IAAI,WAAW,IAAI,MAAM,CAAC,qBAAqB;QAAE,OAAO,IAAI,CAAC;IAE7D,sEAAsE;IACtE,wDAAwD;IACxD,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,iBAAiB,IAAI,CAAC,CAAC;QAClD,IAAI,CAAC,GAAG,UAAU;YAAE,UAAU,GAAG,CAAC,CAAC;IACpC,CAAC;IACD,IAAI,UAAU,GAAG,MAAM,CAAC,uBAAuB;QAAE,OAAO,IAAI,CAAC;IAE7D,4EAA4E;IAC5E,2EAA2E;IAC3E,MAAM,SAAS,GAAG,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/C,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,GAAG,MAAM,CAAC,mBAAmB;QAAE,OAAO,IAAI,CAAC;IAEnF,2EAA2E;IAC3E,gEAAgE;IAChE,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,eAAe,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAE9D,6EAA6E;IAC7E,0EAA0E;IAC1E,kDAAkD;IAClD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,KAAK,YAAY,CAAC,aAAa;QAC/D,CAAC,CAAC,IAAI,CAAC,KAAK;QACZ,CAAC,CAAC,IAAI,iBAAiB,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,iBAAiB,CAAC,CAAC;IAE3E,GAAG,CACF,gHAAgH,EAChH,IAAI,CAAC,EAAE,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC,qBAAqB,CACjF,CAAC;IAEF,OAAO,IAAI,oBAAoB,CAC9B,IAAI,CAAC,KAAK,EACV,KAAK,EACL,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,cAAc,EACnB,IAAI,CAAC,oBAAoB,EACzB,SAAS,CACT,CAAC;AACH,CAAC"}

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

@@ -0,0 +1,58 @@
+/**
+ * Rule: Fan-out Lookup Join (FK→PK + 1:n cross + correlated scalar-aggregate
+ * subqueries)
+ *
+ * Clusters per-outer-row branches into one `FanOutLookupJoinNode` that drives
+ * them concurrently per outer row. A branch is either *at-most-one* (≤1 row per
+ * outer row) or *cross* (data-driven 1:n, Cartesian product per outer row):
+ *
+ *   1. **Join-spine branches.** A chain of N LEFT/INNER/CROSS nested-loop joins
+ *      from a common outer where every join's non-preserved side is a
+ *      parameterized equi-lookup. FK→PK-aligned lookups become at-most-one
+ *      branches (matching the alignment `ruleJoinElimination` trusts); lookups
+ *      that are *not* provably at-most-one (no FK, or FK→non-unique) become
+ *      `cross` branches whose 1:n product is bounded by the row/product guards
+ *      (`tuning.parallel.maxCrossBranchRows` / `maxCrossProduct`). A chain may
+ *      legitimately mix both modes.
+ *
+ *   2. **Subquery branches.** Correlated scalar-aggregate `ScalarSubqueryNode`s
+ *      found anywhere in the SELECT projection list — bare (`(select count(*)
+ *      from c where c.fk = o.k)`) or wrapped inside a scalar expression
+ *      (`coalesce((select sum(...) ...), 0)`, `json((select json_group_array(
+ *      ...) ...))`). A scalar aggregate with no GROUP BY emits exactly one row
+ *      per outer row regardless of how many child rows match — relationally an
+ *      `atMostOne-left` branch driven per outer row, exactly what the fan-out
+ *      node already does. The subquery's relational root is used verbatim as
+ *      the branch child (its correlation predicate is internal and resolves
+ *      through `rctx.context`); only the *inner* `ScalarSubqueryNode` is
+ *      rewritten to a column reference into the fan-out's wide row, leaving any
+ *      wrapping expression (`coalesce(<colref>, 0)`) intact.
+ *
+ * When the *combined* branch count clears `tuning.parallel.minBranches` AND the
+ * projected latency win covers the per-branch setup overhead, the cluster
+ * forms.
+ *
+ * Cost gate is anchored on `physical.expectedLatencyMs` — populated 0 for
+ * in-process / memory-vtab paths, non-zero for remote vtabs whose access plan
+ * declares per-call latency. As a consequence, with no remote-vtab plugin in
+ * tree the rule is inert by design (memory-vtab golden plans don't change).
+ *
+ * Join-spine branch eligibility mirrors `ruleJoinElimination`:
+ *   - AND-of-column-equalities ON-clause (any residual disqualifies the
+ *     branch — leave it as a normal nested-loop join),
+ *   - FK→PK alignment validated via `lookupCoveringFK` + `checkFkPkAlignment`,
+ *   - INNER branches additionally require NOT-NULL FK + row-preserving path
+ *     to the PK table.
+ *
+ * Subquery branch eligibility:
+ *   - a `ScalarSubqueryNode` reached anywhere in a projection's scalar
+ *     expression tree (bare or wrapped — `collectScalarSubqueries` finds it),
+ *   - the subquery is correlated,
+ *   - beneath pass-through wrappers the relational root is aggregate-shaped
+ *     with zero grouping keys (⇒ exactly one row per outer),
+ *   - the subquery exposes exactly one output attribute.
+ */
+import type { OptContext } from '../../framework/context.js';
+import { type PlanNode } from '../../nodes/plan-node.js';
+export declare function ruleFanOutLookupJoin(node: PlanNode, context: OptContext): PlanNode | null;
+//# sourceMappingURL=rule-fanout-lookup-join.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"rule-fanout-lookup-join.d.ts","sourceRoot":"","sources":["../../../../../src/planner/rules/join/rule-fanout-lookup-join.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqDG;AAGH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAC7D,OAAO,EAGN,KAAK,QAAQ,EAGb,MAAM,0BAA0B,CAAC;AA4DlC,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,UAAU,GAAG,QAAQ,GAAG,IAAI,CAgOzF"}