@quereus/quereus 3.1.1 → 3.2.1

package/dist/src/planner/nodes/eager-prefetch-node.d.ts

@@ -0,0 +1,47 @@
+import { PlanNodeType } from './plan-node-type.js';
+import { PlanNode, type RelationalPlanNode, type UnaryRelationalNode, type Attribute, type PhysicalProperties } from './plan-node.js';
+import type { RelationType } from '../../common/datatype.js';
+import type { Scope } from '../scopes/scope.js';
+/**
+ * Physical pass-through that forks the runtime context and pumps its child
+ * sub-tree into a bounded ring buffer **eagerly on `run()`** (emit / scheduler
+ * arg-assembly), not on the consumer's first demand. Inside a hash join this
+ * lets the probe's first fetch overlap the build phase's materialization.
+ *
+ * Rows, order, attribute IDs, keys, FDs, equivClasses, orderings, monotonicity
+ * all pass through verbatim. The only effect is timing: the source starts
+ * executing the moment the scheduler invokes this node's `run()`, ahead of the
+ * consumer's first demand.
+ *
+ * Iterate-or-close contract: because the fork (and its strict-fork counter) is
+ * live from `run()`, any consumer of an EagerPrefetch MUST either iterate the
+ * returned stream to completion or call its iterator's `return()` — otherwise
+ * the pump leaks (fills the buffer, then blocks on back-pressure forever) and
+ * the fork counter stays bumped. `emitBloomJoin` honors this by closing the
+ * left iterator in a `finally` that wraps both the build and probe phases.
+ *
+ * The relational pass-through claims (ordering/fds/equivClasses/
+ * constantBindings/domainConstraints/monotonicOn) are propagated explicitly by
+ * `computePhysical` — the default child-merge only carries
+ * deterministic/idempotent/readonly/expectedLatencyMs/concurrencySafe and would
+ * otherwise silently drop them. Access-path-local claims
+ * (accessCapabilities/rangeBoundedOn) are NOT propagated: this is a
+ * single-input pass-through node, and those live only on the physical leaf
+ * where the access plan resolved.
+ */
+export declare class EagerPrefetchNode extends PlanNode implements UnaryRelationalNode {
+    readonly source: RelationalPlanNode;
+    readonly bufferSize: number;
+    readonly nodeType = PlanNodeType.EagerPrefetch;
+    constructor(scope: Scope, source: RelationalPlanNode, bufferSize?: number, estimatedCostOverride?: number);
+    getAttributes(): readonly Attribute[];
+    getType(): RelationType;
+    getChildren(): readonly [RelationalPlanNode];
+    getRelations(): readonly [RelationalPlanNode];
+    withChildren(newChildren: readonly PlanNode[]): PlanNode;
+    get estimatedRows(): number | undefined;
+    computePhysical(childrenPhysical: PhysicalProperties[]): Partial<PhysicalProperties>;
+    toString(): string;
+    getLogicalAttributes(): Record<string, unknown>;
+}
+//# sourceMappingURL=eager-prefetch-node.d.ts.map

package/dist/src/planner/nodes/eager-prefetch-node.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"eager-prefetch-node.d.ts","sourceRoot":"","sources":["../../../../src/planner/nodes/eager-prefetch-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,KAAK,kBAAkB,EAAE,KAAK,mBAAmB,EAAE,KAAK,SAAS,EAAoB,KAAK,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AACxJ,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAIhD;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,qBAAa,iBAAkB,SAAQ,QAAS,YAAW,mBAAmB;aAK5D,MAAM,EAAE,kBAAkB;aAC1B,UAAU,EAAE,MAAM;IALnC,SAAkB,QAAQ,8BAA8B;gBAGvD,KAAK,EAAE,KAAK,EACI,MAAM,EAAE,kBAAkB,EAC1B,UAAU,GAAE,MAAW,EACvC,qBAAqB,CAAC,EAAE,MAAM;IAK/B,aAAa,IAAI,SAAS,SAAS,EAAE;IAIrC,OAAO,IAAI,YAAY;IAIvB,WAAW,IAAI,SAAS,CAAC,kBAAkB,CAAC;IAI5C,YAAY,IAAI,SAAS,CAAC,kBAAkB,CAAC;IAI7C,YAAY,CAAC,WAAW,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ;IAsBxD,IAAI,aAAa,IAAI,MAAM,GAAG,SAAS,CAEtC;IAED,eAAe,CAAC,gBAAgB,EAAE,kBAAkB,EAAE,GAAG,OAAO,CAAC,kBAAkB,CAAC;IAkB3E,QAAQ,IAAI,MAAM;IAIlB,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAMxD"}

package/dist/src/planner/nodes/eager-prefetch-node.js

@@ -0,0 +1,96 @@
+import { PlanNodeType } from './plan-node-type.js';
+import { PlanNode, isRelationalNode } from './plan-node.js';
+import { StatusCode } from '../../common/types.js';
+import { quereusError } from '../../common/errors.js';
+/**
+ * Physical pass-through that forks the runtime context and pumps its child
+ * sub-tree into a bounded ring buffer **eagerly on `run()`** (emit / scheduler
+ * arg-assembly), not on the consumer's first demand. Inside a hash join this
+ * lets the probe's first fetch overlap the build phase's materialization.
+ *
+ * Rows, order, attribute IDs, keys, FDs, equivClasses, orderings, monotonicity
+ * all pass through verbatim. The only effect is timing: the source starts
+ * executing the moment the scheduler invokes this node's `run()`, ahead of the
+ * consumer's first demand.
+ *
+ * Iterate-or-close contract: because the fork (and its strict-fork counter) is
+ * live from `run()`, any consumer of an EagerPrefetch MUST either iterate the
+ * returned stream to completion or call its iterator's `return()` — otherwise
+ * the pump leaks (fills the buffer, then blocks on back-pressure forever) and
+ * the fork counter stays bumped. `emitBloomJoin` honors this by closing the
+ * left iterator in a `finally` that wraps both the build and probe phases.
+ *
+ * The relational pass-through claims (ordering/fds/equivClasses/
+ * constantBindings/domainConstraints/monotonicOn) are propagated explicitly by
+ * `computePhysical` — the default child-merge only carries
+ * deterministic/idempotent/readonly/expectedLatencyMs/concurrencySafe and would
+ * otherwise silently drop them. Access-path-local claims
+ * (accessCapabilities/rangeBoundedOn) are NOT propagated: this is a
+ * single-input pass-through node, and those live only on the physical leaf
+ * where the access plan resolved.
+ */
+export class EagerPrefetchNode extends PlanNode {
+    source;
+    bufferSize;
+    nodeType = PlanNodeType.EagerPrefetch;
+    constructor(scope, source, bufferSize = 64, estimatedCostOverride) {
+        super(scope, estimatedCostOverride);
+        this.source = source;
+        this.bufferSize = bufferSize;
+    }
+    getAttributes() {
+        return this.source.getAttributes();
+    }
+    getType() {
+        return this.source.getType();
+    }
+    getChildren() {
+        return [this.source];
+    }
+    getRelations() {
+        return [this.source];
+    }
+    withChildren(newChildren) {
+        if (newChildren.length !== 1) {
+            quereusError(`EagerPrefetchNode expects 1 child, got ${newChildren.length}`, StatusCode.INTERNAL);
+        }
+        const [newSource] = newChildren;
+        if (!isRelationalNode(newSource)) {
+            quereusError('EagerPrefetchNode: child must be a RelationalPlanNode', StatusCode.INTERNAL);
+        }
+        if (newSource === this.source) {
+            return this;
+        }
+        return new EagerPrefetchNode(this.scope, newSource, this.bufferSize);
+    }
+    get estimatedRows() {
+        return this.source.estimatedRows;
+    }
+    computePhysical(childrenPhysical) {
+        const sourcePhysical = childrenPhysical[0];
+        return {
+            estimatedRows: this.estimatedRows,
+            // FIFO ring buffer: rows, order, and attribute IDs are identical at
+            // runtime, so every relational claim passes through verbatim.
+            ordering: sourcePhysical?.ordering,
+            fds: sourcePhysical?.fds,
+            equivClasses: sourcePhysical?.equivClasses,
+            constantBindings: sourcePhysical?.constantBindings,
+            domainConstraints: sourcePhysical?.domainConstraints,
+            monotonicOn: sourcePhysical?.monotonicOn,
+            // accessCapabilities/rangeBoundedOn are access-path-local — a
+            // pass-through node sits between the leaf iterator and the consumer,
+            // so they must NOT be propagated.
+        };
+    }
+    toString() {
+        return `EAGER PREFETCH (buffer=${this.bufferSize})`;
+    }
+    getLogicalAttributes() {
+        return {
+            bufferSize: this.bufferSize,
+            sourceNodeType: this.source.nodeType,
+        };
+    }
+}
+//# sourceMappingURL=eager-prefetch-node.js.map

package/dist/src/planner/nodes/eager-prefetch-node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"eager-prefetch-node.js","sourceRoot":"","sources":["../../../../src/planner/nodes/eager-prefetch-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAqE,gBAAgB,EAA2B,MAAM,gBAAgB,CAAC;AAGxJ,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAEtD;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAM,OAAO,iBAAkB,SAAQ,QAAQ;IAK7B;IACA;IALC,QAAQ,GAAG,YAAY,CAAC,aAAa,CAAC;IAExD,YACC,KAAY,EACI,MAA0B,EAC1B,aAAqB,EAAE,EACvC,qBAA8B;QAE9B,KAAK,CAAC,KAAK,EAAE,qBAAqB,CAAC,CAAC;QAJpB,WAAM,GAAN,MAAM,CAAoB;QAC1B,eAAU,GAAV,UAAU,CAAa;IAIxC,CAAC;IAED,aAAa;QACZ,OAAO,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC;IACpC,CAAC;IAED,OAAO;QACN,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;IAC9B,CAAC;IAED,WAAW;QACV,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtB,CAAC;IAED,YAAY;QACX,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtB,CAAC;IAED,YAAY,CAAC,WAAgC;QAC5C,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9B,YAAY,CAAC,0CAA0C,WAAW,CAAC,MAAM,EAAE,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QACnG,CAAC;QAED,MAAM,CAAC,SAAS,CAAC,GAAG,WAAW,CAAC;QAEhC,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,EAAE,CAAC;YAClC,YAAY,CAAC,uDAAuD,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QAC5F,CAAC;QAED,IAAI,SAAS,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YAC/B,OAAO,IAAI,CAAC;QACb,CAAC;QAED,OAAO,IAAI,iBAAiB,CAC3B,IAAI,CAAC,KAAK,EACV,SAA+B,EAC/B,IAAI,CAAC,UAAU,CACf,CAAC;IACH,CAAC;IAED,IAAI,aAAa;QAChB,OAAO,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC;IAClC,CAAC;IAED,eAAe,CAAC,gBAAsC;QACrD,MAAM,cAAc,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAC3C,OAAO;YACN,aAAa,EAAE,IAAI,CAAC,aAAa;YACjC,oEAAoE;YACpE,8DAA8D;YAC9D,QAAQ,EAAE,cAAc,EAAE,QAAQ;YAClC,GAAG,EAAE,cAAc,EAAE,GAAG;YACxB,YAAY,EAAE,cAAc,EAAE,YAAY;YAC1C,gBAAgB,EAAE,cAAc,EAAE,gBAAgB;YAClD,iBAAiB,EAAE,cAAc,EAAE,iBAAiB;YACpD,WAAW,EAAE,cAAc,EAAE,WAAW;YACxC,8DAA8D;YAC9D,qEAAqE;YACrE,kCAAkC;SAClC,CAAC;IACH,CAAC;IAEQ,QAAQ;QAChB,OAAO,0BAA0B,IAAI,CAAC,UAAU,GAAG,CAAC;IACrD,CAAC;IAEQ,oBAAoB;QAC5B,OAAO;YACN,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,cAAc,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ;SACpC,CAAC;IACH,CAAC;CACD"}

package/dist/src/planner/nodes/fanout-lookup-join-node.d.ts

@@ -0,0 +1,150 @@
+import { PlanNodeType } from './plan-node-type.js';
+import { PlanNode, type RelationalPlanNode, type Attribute, type PhysicalProperties } from './plan-node.js';
+import type { RelationType } from '../../common/datatype.js';
+import type { Scope } from '../scopes/scope.js';
+/**
+ * The mode a FanOutLookupJoin branch contributes for one outer row:
+ *
+ * - `atMostOne-left` — like LEFT JOIN: branch yields zero or one row; a zero-row
+ *   match emits NULLs for the branch's output columns and keeps the outer row.
+ * - `atMostOne-inner` — like INNER JOIN: branch yields zero or one row; a
+ *   zero-row match drops the outer row entirely.
+ * - `cross` — like an inner nested-loop join: the branch yields *n* rows per
+ *   outer row (data-driven cardinality) and the node emits one wide row per
+ *   `(outer, branch-row)` combination — the Cartesian product. A zero-row
+ *   branch drops the outer row entirely (inner-drop semantics), matching the
+ *   chain of inner nested-loop joins it replaces.
+ * - `cross-left` — like a LEFT nested-loop join with a data-driven 1:n match:
+ *   a non-empty branch contributes every row (Cartesian product, like `cross`),
+ *   but a zero-row branch emits one NULL-padded factor row so the outer row is
+ *   preserved (LEFT semantics). Its output attributes are nullable-widened, like
+ *   `atMostOne-left`.
+ *
+ * The `array` mode is deferred to a follow-up backlog ticket.
+ */
+export type FanOutBranchMode = 'atMostOne-left' | 'atMostOne-inner' | 'cross' | 'cross-left';
+/**
+ * True when the branch preserves the outer row on an empty match (LEFT
+ * semantics) and therefore nullable-widens its output attributes. Shared by the
+ * node's attribute/type widening, the recognition rule's `preserveAttrs`
+ * widening, and the emit composer's empty-buffer NULL-pad path.
+ */
+export declare function isLeftBranchMode(mode: FanOutBranchMode): boolean;
+/**
+ * True when the branch contributes a data-driven 1:n Cartesian factor (`cross`
+ * or `cross-left`). Used by the memory guard and the cardinality estimate.
+ */
+export declare function isCrossBranchMode(mode: FanOutBranchMode): boolean;
+/**
+ * How the node drives the outer side:
+ *
+ * - `serial` — drive one outer row at a time: fork its branches, run them
+ *   concurrently (bounded by `concurrencyCap`), compose, yield, then read the
+ *   next outer row. The N branches of one row overlap; the next row's lookups
+ *   do not begin until the current row is fully resolved. **Default.**
+ * - `batched` — pipeline lookups *across* outer rows: admit multiple outer
+ *   rows ahead of the emit frontier (bounded read-ahead with backpressure),
+ *   share a single global in-flight budget across all of them, and re-order
+ *   completed rows back into outer order before emitting. Saturates block I/O
+ *   when there are many outer rows but few branches per row.
+ *
+ * Output order is identical for both modes (outer order); only the internal
+ * scheduling differs. The recognition rule that *chooses* `batched` is a
+ * separate concern — nothing in the optimizer constructs a batched node yet,
+ * so `serial` keeps existing plans byte-for-byte unchanged.
+ */
+export type FanOutOuterMode = 'serial' | 'batched';
+/**
+ * Per-branch specification for {@link FanOutLookupJoinNode}.
+ *
+ * `child` is a parameterized sub-plan that, for one outer row, produces the
+ * lookup-row stream for this branch. The sub-plan reads its outer-binding
+ * dependencies via the surrounding `RuntimeContext.context` map; the emitter
+ * sets the outer row's slot on the parent context *before* forking so the
+ * fork's snapshot already carries the binding.
+ *
+ * `outputAttrs` carries the output-side attribute identities the branch
+ * contributes to the FanOutLookupJoin's wide output row, in `child` output
+ * order. They are tracked separately from `child.getAttributes()` so a
+ * recognition rule can preserve a surrounding Project's attribute IDs across
+ * the rewrite (mirroring `BloomJoinNode.preserveAttributeIds`).
+ *
+ * `concurrencySafe` is computed by the constructor (rule layer, or test) from
+ * `getModuleConcurrencyMode` on the child's underlying table reference plus a
+ * read-only-subtree check. The emitter consults it to decide whether to drive
+ * the branch raw or wrap it in `acquireConnectionLock` against the active
+ * connection.
+ *
+ * `connectionKey` is an optional identity hint used to choose the lock target:
+ * when two branches reference distinct connections, both can run unsynchronized
+ * even if both modules declare `'serial'`. When unset, the emitter falls back
+ * to `rctx.activeConnection` as the lock target.
+ */
+export interface FanOutBranchSpec {
+    readonly child: RelationalPlanNode;
+    readonly mode: FanOutBranchMode;
+    readonly outputAttrs: readonly Attribute[];
+    readonly concurrencySafe: boolean;
+    readonly connectionKey?: object;
+}
+/**
+ * Physical relational node that, for one outer row, forks N parameterized
+ * child sub-plans concurrently, collects `atMostOne` row per branch, and
+ * assembles a wide result row.
+ *
+ * Replaces a chain of N nested-loop LEFT/INNER joins where each branch is a
+ * key-aligned (FK→PK) lookup against an independent table, or — for `cross`
+ * branches — an unconstrained 1:n inner nested-loop join. The runtime drives
+ * the N branch factories through {@link ParallelDriver.drive}, bounded by
+ * `concurrencyCap`.
+ *
+ * Attribute layout: outer's attributes first, then each branch's
+ * `outputAttrs` in declared order. `preserveAttributeIds`, when supplied,
+ * fixes the entire layout verbatim so rewrites can preserve a surrounding
+ * Project's attribute IDs.
+ *
+ * **Key/FD propagation is conservative.** v1 folds the branches in left-to-
+ * right per-branch `propagateJoinFds` calls with **empty equi-pair lists** —
+ * the node does not carry per-branch FK→PK alignment, so the propagation
+ * cannot derive the cross-branch FDs the optimizer rule (4.5) would otherwise
+ * see. The result is correct, just less precise than what the rule layer
+ * could produce after recognizing FK alignment. Once the rule lands and a
+ * per-branch equi-pair surface is added to {@link FanOutBranchSpec}, this can
+ * tighten without changing the emitter.
+ *
+ * Outer ordering passes through; v1 emits rows in outer order (for `cross`
+ * branches, all product rows of one outer row are emitted contiguously before
+ * the next outer row). The `array` branch mode is deferred to a follow-up.
+ */
+export declare class FanOutLookupJoinNode extends PlanNode implements RelationalPlanNode {
+    readonly outer: RelationalPlanNode;
+    readonly branches: readonly FanOutBranchSpec[];
+    readonly concurrencyCap: number;
+    readonly preserveAttributeIds?: readonly Attribute[] | undefined;
+    readonly outerMode: FanOutOuterMode;
+    readonly nodeType = PlanNodeType.FanOutLookupJoin;
+    private readonly attributesCache;
+    constructor(scope: Scope, outer: RelationalPlanNode, branches: readonly FanOutBranchSpec[], concurrencyCap: number, preserveAttributeIds?: readonly Attribute[] | undefined, outerMode?: FanOutOuterMode);
+    private static validateConstruction;
+    private buildAttributes;
+    getAttributes(): readonly Attribute[];
+    getType(): RelationType;
+    computePhysical(childrenPhysical: readonly PhysicalProperties[]): Partial<PhysicalProperties>;
+    /**
+     * Outer cardinality multiplied by each cross branch's per-outer-row fan-out
+     * (`cross` and `cross-left`; at-most-one branches contribute a ×1 factor). A
+     * cross branch whose child has no estimate falls back to ×1 for that branch
+     * rather than poisoning the whole estimate to `undefined`. (A `cross-left`
+     * branch preserves the outer row when empty, so its true factor is at least 1;
+     * the child-estimate product is an upper-leaning approximation either way.)
+     * Returns `undefined` only when the outer side itself has no estimate.
+     */
+    private computeEstimatedRows;
+    get estimatedRows(): number | undefined;
+    getChildren(): readonly PlanNode[];
+    getRelations(): readonly RelationalPlanNode[];
+    withChildren(newChildren: readonly PlanNode[]): PlanNode;
+    toString(): string;
+    getLogicalAttributes(): Record<string, unknown>;
+}
+//# sourceMappingURL=fanout-lookup-join-node.d.ts.map

package/dist/src/planner/nodes/fanout-lookup-join-node.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fanout-lookup-join-node.d.ts","sourceRoot":"","sources":["../../../../src/planner/nodes/fanout-lookup-join-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EACN,QAAQ,EAER,KAAK,kBAAkB,EACvB,KAAK,SAAS,EACd,KAAK,kBAAkB,EAIvB,MAAM,gBAAgB,CAAC;AACxB,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAMhD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,MAAM,gBAAgB,GAAG,gBAAgB,GAAG,iBAAiB,GAAG,OAAO,GAAG,YAAY,CAAC;AAE7F;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,gBAAgB,GAAG,OAAO,CAEhE;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,gBAAgB,GAAG,OAAO,CAEjE;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,MAAM,eAAe,GAAG,QAAQ,GAAG,SAAS,CAAC;AAEnD;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,WAAW,gBAAgB;IAChC,QAAQ,CAAC,KAAK,EAAE,kBAAkB,CAAC;IACnC,QAAQ,CAAC,IAAI,EAAE,gBAAgB,CAAC;IAChC,QAAQ,CAAC,WAAW,EAAE,SAAS,SAAS,EAAE,CAAC;IAC3C,QAAQ,CAAC,eAAe,EAAE,OAAO,CAAC;IAClC,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;CAChC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,qBAAa,oBAAqB,SAAQ,QAAS,YAAW,kBAAkB;aAM9D,KAAK,EAAE,kBAAkB;aACzB,QAAQ,EAAE,SAAS,gBAAgB,EAAE;aACrC,cAAc,EAAE,MAAM;aACtB,oBAAoB,CAAC,EAAE,SAAS,SAAS,EAAE;aAC3C,SAAS,EAAE,eAAe;IAT3C,SAAkB,QAAQ,iCAAiC;IAC3D,OAAO,CAAC,QAAQ,CAAC,eAAe,CAA+B;gBAG9D,KAAK,EAAE,KAAK,EACI,KAAK,EAAE,kBAAkB,EACzB,QAAQ,EAAE,SAAS,gBAAgB,EAAE,EACrC,cAAc,EAAE,MAAM,EACtB,oBAAoB,CAAC,EAAE,SAAS,SAAS,EAAE,YAAA,EAC3C,SAAS,GAAE,eAA0B;IAQtD,OAAO,CAAC,MAAM,CAAC,oBAAoB;IA+CnC,OAAO,CAAC,eAAe;IAmBvB,aAAa,IAAI,SAAS,SAAS,EAAE;IAIrC,OAAO,IAAI,YAAY;IA+BvB,eAAe,CAAC,gBAAgB,EAAE,SAAS,kBAAkB,EAAE,GAAG,OAAO,CAAC,kBAAkB,CAAC;IAiD7F;;;;;;;;OAQG;IACH,OAAO,CAAC,oBAAoB;IAa5B,IAAI,aAAa,IAAI,MAAM,GAAG,SAAS,CAEtC;IAED,WAAW,IAAI,SAAS,QAAQ,EAAE;IAIlC,YAAY,IAAI,SAAS,kBAAkB,EAAE;IAI7C,YAAY,CAAC,WAAW,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ;IA2C/C,QAAQ,IAAI,MAAM;IAQlB,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAYxD"}

package/dist/src/planner/nodes/fanout-lookup-join-node.js

@@ -0,0 +1,265 @@
+import { PlanNodeType } from './plan-node-type.js';
+import { PlanNode, isRelationalNode, } from './plan-node.js';
+import { Cached } from '../../util/cached.js';
+import { StatusCode } from '../../common/types.js';
+import { quereusError } from '../../common/errors.js';
+import { propagateJoinFds } from './join-utils.js';
+/**
+ * True when the branch preserves the outer row on an empty match (LEFT
+ * semantics) and therefore nullable-widens its output attributes. Shared by the
+ * node's attribute/type widening, the recognition rule's `preserveAttrs`
+ * widening, and the emit composer's empty-buffer NULL-pad path.
+ */
+export function isLeftBranchMode(mode) {
+    return mode === 'atMostOne-left' || mode === 'cross-left';
+}
+/**
+ * True when the branch contributes a data-driven 1:n Cartesian factor (`cross`
+ * or `cross-left`). Used by the memory guard and the cardinality estimate.
+ */
+export function isCrossBranchMode(mode) {
+    return mode === 'cross' || mode === 'cross-left';
+}
+/**
+ * Physical relational node that, for one outer row, forks N parameterized
+ * child sub-plans concurrently, collects `atMostOne` row per branch, and
+ * assembles a wide result row.
+ *
+ * Replaces a chain of N nested-loop LEFT/INNER joins where each branch is a
+ * key-aligned (FK→PK) lookup against an independent table, or — for `cross`
+ * branches — an unconstrained 1:n inner nested-loop join. The runtime drives
+ * the N branch factories through {@link ParallelDriver.drive}, bounded by
+ * `concurrencyCap`.
+ *
+ * Attribute layout: outer's attributes first, then each branch's
+ * `outputAttrs` in declared order. `preserveAttributeIds`, when supplied,
+ * fixes the entire layout verbatim so rewrites can preserve a surrounding
+ * Project's attribute IDs.
+ *
+ * **Key/FD propagation is conservative.** v1 folds the branches in left-to-
+ * right per-branch `propagateJoinFds` calls with **empty equi-pair lists** —
+ * the node does not carry per-branch FK→PK alignment, so the propagation
+ * cannot derive the cross-branch FDs the optimizer rule (4.5) would otherwise
+ * see. The result is correct, just less precise than what the rule layer
+ * could produce after recognizing FK alignment. Once the rule lands and a
+ * per-branch equi-pair surface is added to {@link FanOutBranchSpec}, this can
+ * tighten without changing the emitter.
+ *
+ * Outer ordering passes through; v1 emits rows in outer order (for `cross`
+ * branches, all product rows of one outer row are emitted contiguously before
+ * the next outer row). The `array` branch mode is deferred to a follow-up.
+ */
+export class FanOutLookupJoinNode extends PlanNode {
+    outer;
+    branches;
+    concurrencyCap;
+    preserveAttributeIds;
+    outerMode;
+    nodeType = PlanNodeType.FanOutLookupJoin;
+    attributesCache;
+    constructor(scope, outer, branches, concurrencyCap, preserveAttributeIds, outerMode = 'serial') {
+        FanOutLookupJoinNode.validateConstruction(outer, branches, concurrencyCap, preserveAttributeIds, outerMode);
+        const branchCost = branches.reduce((acc, b) => acc + b.child.getTotalCost(), 0);
+        super(scope, outer.getTotalCost() + branchCost);
+        this.outer = outer;
+        this.branches = branches;
+        this.concurrencyCap = concurrencyCap;
+        this.preserveAttributeIds = preserveAttributeIds;
+        this.outerMode = outerMode;
+        this.attributesCache = new Cached(() => this.buildAttributes());
+    }
+    static validateConstruction(outer, branches, concurrencyCap, preserveAttributeIds, outerMode) {
+        if (outerMode !== 'serial' && outerMode !== 'batched') {
+            quereusError(`FanOutLookupJoinNode: unknown outerMode '${String(outerMode)}'`, StatusCode.INTERNAL);
+        }
+        if (branches.length < 1) {
+            quereusError(`FanOutLookupJoinNode requires >= 1 branch, got ${branches.length}`, StatusCode.INTERNAL);
+        }
+        if (!Number.isInteger(concurrencyCap) || concurrencyCap < 1) {
+            quereusError(`FanOutLookupJoinNode concurrencyCap must be a positive integer, got ${concurrencyCap}`, StatusCode.INTERNAL);
+        }
+        for (let i = 0; i < branches.length; i++) {
+            const b = branches[i];
+            const childAttrCount = b.child.getAttributes().length;
+            if (b.outputAttrs.length !== childAttrCount) {
+                quereusError(`FanOutLookupJoinNode: branch ${i} outputAttrs length (${b.outputAttrs.length}) does not match child attributes (${childAttrCount})`, StatusCode.INTERNAL);
+            }
+        }
+        if (preserveAttributeIds !== undefined) {
+            let expected = outer.getAttributes().length;
+            for (const b of branches)
+                expected += b.outputAttrs.length;
+            if (preserveAttributeIds.length !== expected) {
+                quereusError(`FanOutLookupJoinNode: preserveAttributeIds length (${preserveAttributeIds.length}) does not match outer+branches attribute count (${expected})`, StatusCode.INTERNAL);
+            }
+        }
+    }
+    buildAttributes() {
+        if (this.preserveAttributeIds) {
+            return this.preserveAttributeIds.slice();
+        }
+        const out = [];
+        for (const a of this.outer.getAttributes())
+            out.push(a);
+        for (const b of this.branches) {
+            const nullable = isLeftBranchMode(b.mode);
+            for (const a of b.outputAttrs) {
+                if (nullable && !a.type.nullable) {
+                    out.push({ ...a, type: { ...a.type, nullable: true } });
+                }
+                else {
+                    out.push(a);
+                }
+            }
+        }
+        return out;
+    }
+    getAttributes() {
+        return this.attributesCache.value;
+    }
+    getType() {
+        const outerType = this.outer.getType();
+        let isReadOnly = outerType.isReadOnly;
+        const columns = [
+            ...outerType.columns.map(col => col),
+            ...this.branches.flatMap(b => {
+                const nullable = isLeftBranchMode(b.mode);
+                return b.child.getType().columns.map(col => nullable && !col.type.nullable
+                    ? { ...col, type: { ...col.type, nullable: true } }
+                    : col);
+            }),
+        ];
+        const rowConstraints = [
+            ...outerType.rowConstraints.map(rc => rc),
+            ...this.branches.flatMap(b => b.child.getType().rowConstraints.map(rc => rc)),
+        ];
+        for (const b of this.branches) {
+            isReadOnly = isReadOnly && b.child.getType().isReadOnly;
+        }
+        return {
+            typeClass: 'relation',
+            columns,
+            isSet: false,
+            isReadOnly,
+            keys: [],
+            rowConstraints,
+        };
+    }
+    computePhysical(childrenPhysical) {
+        const outerPhys = childrenPhysical[0];
+        let fds = outerPhys.fds ?? [];
+        let equiv = outerPhys.equivClasses ?? [];
+        let bindings = outerPhys.constantBindings ?? [];
+        let domains = outerPhys.domainConstraints ?? [];
+        let leftColCount = this.outer.getAttributes().length;
+        for (let i = 0; i < this.branches.length; i++) {
+            const b = this.branches[i];
+            const rightPhys = childrenPhysical[i + 1];
+            const branchCols = b.outputAttrs.length;
+            const totalCols = leftColCount + branchCols;
+            const joinType = isLeftBranchMode(b.mode) ? 'left' : 'inner';
+            const leftPhys = {
+                fds,
+                equivClasses: equiv,
+                constantBindings: bindings,
+                domainConstraints: domains,
+            };
+            const merged = propagateJoinFds(joinType, leftPhys, rightPhys, [], leftColCount, totalCols, []);
+            fds = merged.fds ?? [];
+            equiv = merged.equivClasses ?? [];
+            bindings = merged.constantBindings ?? [];
+            domains = merged.domainConstraints ?? [];
+            leftColCount = totalCols;
+        }
+        return {
+            ordering: outerPhys.ordering,
+            monotonicOn: outerPhys.monotonicOn,
+            fds: fds.length > 0 ? fds : undefined,
+            equivClasses: equiv.length > 0 ? equiv : undefined,
+            constantBindings: bindings.length > 0 ? bindings : undefined,
+            domainConstraints: domains.length > 0 ? domains : undefined,
+            estimatedRows: this.computeEstimatedRows(),
+        };
+    }
+    /**
+     * Outer cardinality multiplied by each cross branch's per-outer-row fan-out
+     * (`cross` and `cross-left`; at-most-one branches contribute a ×1 factor). A
+     * cross branch whose child has no estimate falls back to ×1 for that branch
+     * rather than poisoning the whole estimate to `undefined`. (A `cross-left`
+     * branch preserves the outer row when empty, so its true factor is at least 1;
+     * the child-estimate product is an upper-leaning approximation either way.)
+     * Returns `undefined` only when the outer side itself has no estimate.
+     */
+    computeEstimatedRows() {
+        const outerEst = this.outer.estimatedRows;
+        if (outerEst === undefined)
+            return undefined;
+        let est = outerEst;
+        for (const b of this.branches) {
+            if (isCrossBranchMode(b.mode)) {
+                const childEst = b.child.estimatedRows;
+                if (childEst !== undefined)
+                    est *= childEst;
+            }
+        }
+        return est;
+    }
+    get estimatedRows() {
+        return this.computeEstimatedRows();
+    }
+    getChildren() {
+        return [this.outer, ...this.branches.map(b => b.child)];
+    }
+    getRelations() {
+        return [this.outer, ...this.branches.map(b => b.child)];
+    }
+    withChildren(newChildren) {
+        const expected = 1 + this.branches.length;
+        if (newChildren.length !== expected) {
+            quereusError(`FanOutLookupJoinNode expects ${expected} children, got ${newChildren.length}`, StatusCode.INTERNAL);
+        }
+        const [newOuter, ...newBranchChildren] = newChildren;
+        if (!isRelationalNode(newOuter)) {
+            quereusError('FanOutLookupJoinNode: outer child must be a RelationalPlanNode', StatusCode.INTERNAL);
+        }
+        let changed = newOuter !== this.outer;
+        for (let i = 0; i < newBranchChildren.length; i++) {
+            const child = newBranchChildren[i];
+            if (!isRelationalNode(child)) {
+                quereusError(`FanOutLookupJoinNode: branch ${i} child must be a RelationalPlanNode`, StatusCode.INTERNAL);
+            }
+            if (child !== this.branches[i].child)
+                changed = true;
+        }
+        if (!changed)
+            return this;
+        const newBranches = this.branches.map((b, i) => ({
+            child: newBranchChildren[i],
+            mode: b.mode,
+            outputAttrs: b.outputAttrs,
+            concurrencySafe: b.concurrencySafe,
+            connectionKey: b.connectionKey,
+        }));
+        return new FanOutLookupJoinNode(this.scope, newOuter, newBranches, this.concurrencyCap, this.preserveAttributeIds, this.outerMode);
+    }
+    toString() {
+        const branchSummary = this.branches
+            .map((b, i) => `b${i}:${b.mode}${b.concurrencySafe ? '' : '/locked'}`)
+            .join(', ');
+        const modeSuffix = this.outerMode === 'batched' ? ', batched' : '';
+        return `FANOUT_LOOKUP_JOIN(N=${this.branches.length}, cap=${this.concurrencyCap}${modeSuffix}) [${branchSummary}]`;
+    }
+    getLogicalAttributes() {
+        return {
+            branchCount: this.branches.length,
+            concurrencyCap: this.concurrencyCap,
+            outerMode: this.outerMode,
+            branches: this.branches.map(b => ({
+                mode: b.mode,
+                concurrencySafe: b.concurrencySafe,
+                outputColCount: b.outputAttrs.length,
+            })),
+        };
+    }
+}
+//# sourceMappingURL=fanout-lookup-join-node.js.map

package/dist/src/planner/nodes/fanout-lookup-join-node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fanout-lookup-join-node.js","sourceRoot":"","sources":["../../../../src/planner/nodes/fanout-lookup-join-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EACN,QAAQ,EACR,gBAAgB,GAOhB,MAAM,gBAAgB,CAAC;AAGxB,OAAO,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AAwBnD;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAsB;IACtD,OAAO,IAAI,KAAK,gBAAgB,IAAI,IAAI,KAAK,YAAY,CAAC;AAC3D,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAsB;IACvD,OAAO,IAAI,KAAK,OAAO,IAAI,IAAI,KAAK,YAAY,CAAC;AAClD,CAAC;AAwDD;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,MAAM,OAAO,oBAAqB,SAAQ,QAAQ;IAMhC;IACA;IACA;IACA;IACA;IATC,QAAQ,GAAG,YAAY,CAAC,gBAAgB,CAAC;IAC1C,eAAe,CAA+B;IAE/D,YACC,KAAY,EACI,KAAyB,EACzB,QAAqC,EACrC,cAAsB,EACtB,oBAA2C,EAC3C,YAA6B,QAAQ;QAErD,oBAAoB,CAAC,oBAAoB,CAAC,KAAK,EAAE,QAAQ,EAAE,cAAc,EAAE,oBAAoB,EAAE,SAAS,CAAC,CAAC;QAC5G,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC,CAAC;QAChF,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,YAAY,EAAE,GAAG,UAAU,CAAC,CAAC;QARhC,UAAK,GAAL,KAAK,CAAoB;QACzB,aAAQ,GAAR,QAAQ,CAA6B;QACrC,mBAAc,GAAd,cAAc,CAAQ;QACtB,yBAAoB,GAApB,oBAAoB,CAAuB;QAC3C,cAAS,GAAT,SAAS,CAA4B;QAKrD,IAAI,CAAC,eAAe,GAAG,IAAI,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC;IACjE,CAAC;IAEO,MAAM,CAAC,oBAAoB,CAClC,KAAyB,EACzB,QAAqC,EACrC,cAAsB,EACtB,oBAAsD,EACtD,SAA0B;QAE1B,IAAI,SAAS,KAAK,QAAQ,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YACvD,YAAY,CACX,4CAA4C,MAAM,CAAC,SAAS,CAAC,GAAG,EAChE,UAAU,CAAC,QAAQ,CACnB,CAAC;QACH,CAAC;QACD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,YAAY,CACX,kDAAkD,QAAQ,CAAC,MAAM,EAAE,EACnE,UAAU,CAAC,QAAQ,CACnB,CAAC;QACH,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,cAAc,GAAG,CAAC,EAAE,CAAC;YAC7D,YAAY,CACX,uEAAuE,cAAc,EAAE,EACvF,UAAU,CAAC,QAAQ,CACnB,CAAC;QACH,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,cAAc,GAAG,CAAC,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC,MAAM,CAAC;YACtD,IAAI,CAAC,CAAC,WAAW,CAAC,MAAM,KAAK,cAAc,EAAE,CAAC;gBAC7C,YAAY,CACX,gCAAgC,CAAC,wBAAwB,CAAC,CAAC,WAAW,CAAC,MAAM,sCAAsC,cAAc,GAAG,EACpI,UAAU,CAAC,QAAQ,CACnB,CAAC;YACH,CAAC;QACF,CAAC;QACD,IAAI,oBAAoB,KAAK,SAAS,EAAE,CAAC;YACxC,IAAI,QAAQ,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC,MAAM,CAAC;YAC5C,KAAK,MAAM,CAAC,IAAI,QAAQ;gBAAE,QAAQ,IAAI,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC;YAC3D,IAAI,oBAAoB,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;gBAC9C,YAAY,CACX,sDAAsD,oBAAoB,CAAC,MAAM,oDAAoD,QAAQ,GAAG,EAChJ,UAAU,CAAC,QAAQ,CACnB,CAAC;YACH,CAAC;QACF,CAAC;IACF,CAAC;IAEO,eAAe;QACtB,IAAI,IAAI,CAAC,oBAAoB,EAAE,CAAC;YAC/B,OAAO,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,CAAC;QAC1C,CAAC;QACD,MAAM,GAAG,GAAgB,EAAE,CAAC;QAC5B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC/B,MAAM,QAAQ,GAAG,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC1C,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;gBAC/B,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;oBAClC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;gBACzD,CAAC;qBAAM,CAAC;oBACP,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACb,CAAC;YACF,CAAC;QACF,CAAC;QACD,OAAO,GAAG,CAAC;IACZ,CAAC;IAED,aAAa;QACZ,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC;IACnC,CAAC;IAED,OAAO;QACN,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;QACvC,IAAI,UAAU,GAAG,SAAS,CAAC,UAAU,CAAC;QACtC,MAAM,OAAO,GAAG;YACf,GAAG,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC;YACpC,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;gBAC5B,MAAM,QAAQ,GAAG,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAC1C,OAAO,CAAC,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAC1C,QAAQ,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ;oBAC7B,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,IAAI,EAAE,EAAE,GAAG,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,EAAE;oBACnD,CAAC,CAAC,GAAG,CACN,CAAC;YACH,CAAC,CAAC;SACF,CAAC;QACF,MAAM,cAAc,GAAG;YACtB,GAAG,SAAS,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;YACzC,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SAC7E,CAAC;QACF,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC/B,UAAU,GAAG,UAAU,IAAI,CAAC,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,UAAU,CAAC;QACzD,CAAC;QACD,OAAO;YACN,SAAS,EAAE,UAAU;YACrB,OAAO;YACP,KAAK,EAAE,KAAK;YACZ,UAAU;YACV,IAAI,EAAE,EAAE;YACR,cAAc;SACE,CAAC;IACnB,CAAC;IAED,eAAe,CAAC,gBAA+C;QAC9D,MAAM,SAAS,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,GAAG,GAAwC,SAAS,CAAC,GAAG,IAAI,EAAE,CAAC;QACnE,IAAI,KAAK,GAAyC,SAAS,CAAC,YAAY,IAAI,EAAE,CAAC;QAC/E,IAAI,QAAQ,GAAmC,SAAS,CAAC,gBAAgB,IAAI,EAAE,CAAC;QAChF,IAAI,OAAO,GAAoC,SAAS,CAAC,iBAAiB,IAAI,EAAE,CAAC;QACjF,IAAI,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC,MAAM,CAAC;QAErD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,SAAS,GAAG,gBAAgB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1C,MAAM,UAAU,GAAG,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC;YACxC,MAAM,SAAS,GAAG,YAAY,GAAG,UAAU,CAAC;YAC5C,MAAM,QAAQ,GAAG,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC;YAE7D,MAAM,QAAQ,GAAuB;gBACpC,GAAG;gBACH,YAAY,EAAE,KAAK;gBACnB,gBAAgB,EAAE,QAAQ;gBAC1B,iBAAiB,EAAE,OAAO;aAC1B,CAAC;YACF,MAAM,MAAM,GAAG,gBAAgB,CAC9B,QAAQ,EACR,QAAQ,EACR,SAAS,EACT,EAAE,EACF,YAAY,EACZ,SAAS,EACT,EAAE,CACF,CAAC;YAEF,GAAG,GAAG,MAAM,CAAC,GAAG,IAAI,EAAE,CAAC;YACvB,KAAK,GAAG,MAAM,CAAC,YAAY,IAAI,EAAE,CAAC;YAClC,QAAQ,GAAG,MAAM,CAAC,gBAAgB,IAAI,EAAE,CAAC;YACzC,OAAO,GAAG,MAAM,CAAC,iBAAiB,IAAI,EAAE,CAAC;YACzC,YAAY,GAAG,SAAS,CAAC;QAC1B,CAAC;QAED,OAAO;YACN,QAAQ,EAAE,SAAS,CAAC,QAAQ;YAC5B,WAAW,EAAE,SAAS,CAAC,WAAW;YAClC,GAAG,EAAE,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS;YACrC,YAAY,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS;YAClD,gBAAgB,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS;YAC5D,iBAAiB,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;YAC3D,aAAa,EAAE,IAAI,CAAC,oBAAoB,EAAE;SAC1C,CAAC;IACH,CAAC;IAED;;;;;;;;OAQG;IACK,oBAAoB;QAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC;QAC1C,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC7C,IAAI,GAAG,GAAG,QAAQ,CAAC;QACnB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC/B,IAAI,iBAAiB,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC/B,MAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC;gBACvC,IAAI,QAAQ,KAAK,SAAS;oBAAE,GAAG,IAAI,QAAQ,CAAC;YAC7C,CAAC;QACF,CAAC;QACD,OAAO,GAAG,CAAC;IACZ,CAAC;IAED,IAAI,aAAa;QAChB,OAAO,IAAI,CAAC,oBAAoB,EAAE,CAAC;IACpC,CAAC;IAED,WAAW;QACV,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACzD,CAAC;IAED,YAAY;QACX,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACzD,CAAC;IAED,YAAY,CAAC,WAAgC;QAC5C,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC1C,IAAI,WAAW,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;YACrC,YAAY,CACX,gCAAgC,QAAQ,kBAAkB,WAAW,CAAC,MAAM,EAAE,EAC9E,UAAU,CAAC,QAAQ,CACnB,CAAC;QACH,CAAC;QACD,MAAM,CAAC,QAAQ,EAAE,GAAG,iBAAiB,CAAC,GAAG,WAAW,CAAC;QACrD,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,CAAC;YACjC,YAAY,CAAC,gEAAgE,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QACrG,CAAC;QACD,IAAI,OAAO,GAAG,QAAQ,KAAK,IAAI,CAAC,KAAK,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACnD,MAAM,KAAK,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;YACnC,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9B,YAAY,CACX,gCAAgC,CAAC,qCAAqC,EACtE,UAAU,CAAC,QAAQ,CACnB,CAAC;YACH,CAAC;YACD,IAAI,KAAK,KAAK,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK;gBAAE,OAAO,GAAG,IAAI,CAAC;QACtD,CAAC;QACD,IAAI,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC;QAE1B,MAAM,WAAW,GAAuB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YACpE,KAAK,EAAE,iBAAiB,CAAC,CAAC,CAAuB;YACjD,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,WAAW,EAAE,CAAC,CAAC,WAAW;YAC1B,eAAe,EAAE,CAAC,CAAC,eAAe;YAClC,aAAa,EAAE,CAAC,CAAC,aAAa;SAC9B,CAAC,CAAC,CAAC;QAEJ,OAAO,IAAI,oBAAoB,CAC9B,IAAI,CAAC,KAAK,EACV,QAA8B,EAC9B,WAAW,EACX,IAAI,CAAC,cAAc,EACnB,IAAI,CAAC,oBAAoB,EACzB,IAAI,CAAC,SAAS,CACd,CAAC;IACH,CAAC;IAEQ,QAAQ;QAChB,MAAM,aAAa,GAAG,IAAI,CAAC,QAAQ;aACjC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;aACrE,IAAI,CAAC,IAAI,CAAC,CAAC;QACb,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;QACnE,OAAO,wBAAwB,IAAI,CAAC,QAAQ,CAAC,MAAM,SAAS,IAAI,CAAC,cAAc,GAAG,UAAU,MAAM,aAAa,GAAG,CAAC;IACpH,CAAC;IAEQ,oBAAoB;QAC5B,OAAO;YACN,WAAW,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM;YACjC,cAAc,EAAE,IAAI,CAAC,cAAc;YACnC,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACjC,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,eAAe,EAAE,CAAC,CAAC,eAAe;gBAClC,cAAc,EAAE,CAAC,CAAC,WAAW,CAAC,MAAM;aACpC,CAAC,CAAC;SACH,CAAC;IACH,CAAC;CACD"}

package/dist/src/planner/nodes/merge-join-node.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"merge-join-node.d.ts","sourceRoot":"","sources":["../../../../src/planner/nodes/merge-join-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,KAAK,kBAAkB,EAAE,KAAK,oBAAoB,EAAE,KAAK,cAAc,EAAE,KAAK,kBAAkB,EAAE,KAAK,SAAS,EAAoB,MAAM,gBAAgB,CAAC;AAC9K,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAIhD,OAAO,KAAK,EAAE,WAAW,EAAE,sBAAsB,EAAE,MAAM,iCAAiC,CAAC;AAE3F,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC/C,OAAO,EAA4G,KAAK,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAG9J;;;;;;;;;GASG;AACH,qBAAa,aAAc,SAAQ,QAAS,YAAW,oBAAoB,EAAE,WAAW,EAAE,sBAAsB;IAM9G,sCAAsC;aACtB,IAAI,EAAE,kBAAkB;IACxC,uCAAuC;aACvB,KAAK,EAAE,kBAAkB;aACzB,QAAQ,EAAE,QAAQ;IAClC,2DAA2D;aAC3C,SAAS,EAAE,SAAS,YAAY,EAAE;IAClD,qDAAqD;aACrC,iBAAiB,CAAC,EAAE,cAAc;IAClD,wDAAwD;aACxC,oBAAoB,CAAC,EAAE,SAAS,SAAS,EAAE;IAf5D,SAAkB,QAAQ,0BAA0B;IACpD,OAAO,CAAC,eAAe,CAAsB;gBAG5C,KAAK,EAAE,KAAK;IACZ,sCAAsC;IACtB,IAAI,EAAE,kBAAkB;IACxC,uCAAuC;IACvB,KAAK,EAAE,kBAAkB,EACzB,QAAQ,EAAE,QAAQ;IAClC,2DAA2D;IAC3C,SAAS,EAAE,SAAS,YAAY,EAAE;IAClD,qDAAqD;IACrC,iBAAiB,CAAC,EAAE,cAAc,YAAA;IAClD,wDAAwD;IACxC,oBAAoB,CAAC,EAAE,SAAS,SAAS,EAAE,YAAA;IAW5D,OAAO,CAAC,eAAe;IAOvB,aAAa,IAAI,SAAS,EAAE;IAI5B,OAAO,IAAI,YAAY;IAavB,eAAe,CAAC,gBAAgB,EAAE,kBAAkB,EAAE,GAAG,OAAO,CAAC,kBAAkB,CAAC;IA2CpF,IAAI,aAAa,IAAI,MAAM,GAAG,SAAS,CAEtC;IAED,WAAW,IAAI,SAAS,QAAQ,EAAE;IAMlC,YAAY,IAAI,SAAS,CAAC,kBAAkB,EAAE,kBAAkB,CAAC;IAIjE,YAAY,CAAC,WAAW,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ;IAgCxD,WAAW,IAAI,QAAQ;IACvB,gBAAgB,IAAI,cAAc,GAAG,SAAS;IAC9C,aAAa,IAAI,kBAAkB;IACnC,cAAc,IAAI,kBAAkB;IACpC,eAAe,IAAI,SAAS,MAAM,EAAE,GAAG,SAAS;IAGhD,aAAa,IAAI,SAAS,cAAc,EAAE;IAIjC,QAAQ,IAAI,MAAM;IAKlB,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAUxD"}
+{"version":3,"file":"merge-join-node.d.ts","sourceRoot":"","sources":["../../../../src/planner/nodes/merge-join-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,KAAK,kBAAkB,EAAE,KAAK,oBAAoB,EAAE,KAAK,cAAc,EAAE,KAAK,kBAAkB,EAAE,KAAK,SAAS,EAAoB,MAAM,gBAAgB,CAAC;AAC9K,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAIhD,OAAO,KAAK,EAAE,WAAW,EAAE,sBAAsB,EAAE,MAAM,iCAAiC,CAAC;AAE3F,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC/C,OAAO,EAA4G,KAAK,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAG9J;;;;;;;;;GASG;AACH,qBAAa,aAAc,SAAQ,QAAS,YAAW,oBAAoB,EAAE,WAAW,EAAE,sBAAsB;IAM9G,sCAAsC;aACtB,IAAI,EAAE,kBAAkB;IACxC,uCAAuC;aACvB,KAAK,EAAE,kBAAkB;aACzB,QAAQ,EAAE,QAAQ;IAClC,2DAA2D;aAC3C,SAAS,EAAE,SAAS,YAAY,EAAE;IAClD,qDAAqD;aACrC,iBAAiB,CAAC,EAAE,cAAc;IAClD,wDAAwD;aACxC,oBAAoB,CAAC,EAAE,SAAS,SAAS,EAAE;IAf5D,SAAkB,QAAQ,0BAA0B;IACpD,OAAO,CAAC,eAAe,CAAsB;gBAG5C,KAAK,EAAE,KAAK;IACZ,sCAAsC;IACtB,IAAI,EAAE,kBAAkB;IACxC,uCAAuC;IACvB,KAAK,EAAE,kBAAkB,EACzB,QAAQ,EAAE,QAAQ;IAClC,2DAA2D;IAC3C,SAAS,EAAE,SAAS,YAAY,EAAE;IAClD,qDAAqD;IACrC,iBAAiB,CAAC,EAAE,cAAc,YAAA;IAClD,wDAAwD;IACxC,oBAAoB,CAAC,EAAE,SAAS,SAAS,EAAE,YAAA;IAW5D,OAAO,CAAC,eAAe;IAOvB,aAAa,IAAI,SAAS,EAAE;IAI5B,OAAO,IAAI,YAAY;IAavB,eAAe,CAAC,gBAAgB,EAAE,kBAAkB,EAAE,GAAG,OAAO,CAAC,kBAAkB,CAAC;IA4CpF,IAAI,aAAa,IAAI,MAAM,GAAG,SAAS,CAEtC;IAED,WAAW,IAAI,SAAS,QAAQ,EAAE;IAMlC,YAAY,IAAI,SAAS,CAAC,kBAAkB,EAAE,kBAAkB,CAAC;IAIjE,YAAY,CAAC,WAAW,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ;IAgCxD,WAAW,IAAI,QAAQ;IACvB,gBAAgB,IAAI,cAAc,GAAG,SAAS;IAC9C,aAAa,IAAI,kBAAkB;IACnC,cAAc,IAAI,kBAAkB;IACpC,eAAe,IAAI,SAAS,MAAM,EAAE,GAAG,SAAS;IAGhD,aAAa,IAAI,SAAS,cAAc,EAAE;IAIjC,QAAQ,IAAI,MAAM;IAKlB,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAUxD"}

package/dist/src/planner/nodes/merge-join-node.js

@@ -58,11 +58,11 @@ export class MergeJoinNode extends PlanNode {
     getType() {
         const leftType = this.left.getType();
         const rightType = this.right.getType();
-        const leftAttrs = this.left.getAttributes();
-        const rightAttrs = this.right.getAttributes();
+        const leftIndex = this.left.getAttributeIndex();
+        const rightIndex = this.right.getAttributeIndex();
         const indexPairs = this.equiPairs.map(p => ({
-            left: leftAttrs.findIndex(a => a.id === p.leftAttrId),
-            right: rightAttrs.findIndex(a => a.id === p.rightAttrId),
+            left: leftIndex.get(p.leftAttrId) ?? -1,
+            right: rightIndex.get(p.rightAttrId) ?? -1,
         })).filter(p => p.left >= 0 && p.right >= 0);
         const keys = combineJoinKeys(leftType.keys, rightType.keys, this.joinType, leftType.columns.length, indexPairs);
         return buildJoinRelationType(leftType, rightType, this.joinType, keys);
@@ -71,11 +71,12 @@ export class MergeJoinNode extends PlanNode {
         const leftPhys = childrenPhysical[0];
         const rightPhys = childrenPhysical[1];
         const leftAttrs = this.left.getAttributes();
-        const rightAttrs = this.right.getAttributes();
+        const leftIndex = this.left.getAttributeIndex();
+        const rightIndex = this.right.getAttributeIndex();
         // Map attribute-ID-based equi-pairs to column-index-based pairs
         const indexPairs = this.equiPairs.map(p => ({
-            left: leftAttrs.findIndex(a => a.id === p.leftAttrId),
-            right: rightAttrs.findIndex(a => a.id === p.rightAttrId),
+            left: leftIndex.get(p.leftAttrId) ?? -1,
+            right: rightIndex.get(p.rightAttrId) ?? -1,
         }));
         const result = analyzeJoinKeyCoverage(this.joinType, leftPhys, rightPhys, this.left.getType(), this.right.getType(), indexPairs, this.left.estimatedRows, this.right.estimatedRows, leftAttrs.length);
         // Merge join preserves left-side ordering