@quereus/quereus 0.1.0 → 0.2.1

package/dist/src/planner/cache/materialization-advisory.js

@@ -3,9 +3,11 @@
  * Decides when and how to inject caching based on reference graph analysis
  */
 import { createLogger } from '../../common/logger.js';
+import { isRelationalNode } from '../nodes/plan-node.js';
 import { CacheNode } from '../nodes/cache-node.js';
 import { PlanNodeType } from '../nodes/plan-node-type.js';
 import { ReferenceGraphBuilder } from './reference-graph.js';
+import { isCorrelatedSubquery } from './correlation-detector.js';
 const log = createLogger('optimizer:cache:materialization');
 /**
  * Materialization advisory that analyzes plan trees and recommends caching
@@ -18,29 +20,32 @@ export class MaterializationAdvisory {
         this.referenceBuilder = new ReferenceGraphBuilder(tuning);
     }
     /**
-     * Analyze a plan tree and return caching recommendations
+     * Analyze a plan tree and inject caching where beneficial
+     * Returns the transformed tree or the original if no caching was added
      */
-    analyzeTree(root) {
+    analyzeAndTransform(root) {
+        // Build reference graph
         const refGraph = this.referenceBuilder.buildReferenceGraph(root);
+        // Build recommendations
         const recommendations = new Map();
         for (const [node, stats] of refGraph) {
             // Only consider relational nodes for caching
-            if (!this.isRelationalNode(node)) {
+            if (!isRelationalNode(node)) {
                 continue;
             }
             const recommendation = this.adviseCaching(node, stats);
-            recommendations.set(node, recommendation);
             if (recommendation.shouldCache) {
+                recommendations.set(node, recommendation);
                 log('Recommending cache for %s: %s', node.nodeType, recommendation.reason);
             }
         }
-        return recommendations;
-    }
-    /**
-     * Apply caching recommendations to a plan tree
-     */
-    applyCaching(root, recommendations) {
-        return this.transformNode(root, recommendations);
+        if (recommendations.size === 0) {
+            log('No caching opportunities identified');
+            return root;
+        }
+        log('Found %d caching opportunities', recommendations.size);
+        // Transform the tree by wrapping recommended nodes with CacheNode
+        return this.transformTree(root, recommendations);
     }
     /**
      * Core advisory algorithm
@@ -64,7 +69,17 @@ export class MaterializationAdvisory {
                 reason: 'Already cached'
             };
         }
-        // Rule 3: Single-parent nodes that don't appear in loops typically don't benefit from caching
+        // Rule 3: Correlated subqueries should not be cached
+        // Check if this node is part of a subquery context and if it's correlated
+        if (isRelationalNode(node) && this.isCorrelatedNode(node)) {
+            return {
+                shouldCache: false,
+                strategy: 'memory',
+                threshold: 0,
+                reason: 'Correlated subquery - must re-execute for each outer row'
+            };
+        }
+        // Rule 4: Single-parent nodes that don't appear in loops typically don't benefit from caching
         if (stats.parentCount <= 1 && !stats.appearsInLoop) {
             return {
                 shouldCache: false,
@@ -73,7 +88,7 @@ export class MaterializationAdvisory {
                 reason: 'Single parent, not in loop'
             };
         }
-        // Rule 4: Multi-parent nodes benefit from caching
+        // Rule 5: Multi-parent nodes benefit from caching
         if (stats.parentCount > 1) {
             const strategy = this.selectStrategy(stats.estimatedRows);
             const threshold = this.calculateThreshold(stats.estimatedRows, strategy);
@@ -84,7 +99,7 @@ export class MaterializationAdvisory {
                 reason: `Multiple parents (${stats.parentCount})`
             };
         }
-        // Rule 5: Nodes in loop contexts benefit from caching even with single parent
+        // Rule 6: Nodes in loop contexts benefit from caching even with single parent
         if (stats.appearsInLoop) {
             // Check if the estimated size is reasonable for caching
             if (stats.estimatedRows > this.tuning.join.maxRightRowsForCaching) {
@@ -113,8 +128,8 @@ export class MaterializationAdvisory {
         };
     }
     /**
- * Select appropriate cache strategy based on estimated size
- */
+     * Select appropriate cache strategy based on estimated size
+     */
     selectStrategy(estimatedRows) {
         // Use tuning configuration for strategy selection
         if (this.tuning.cache.spillEnabled && estimatedRows > this.tuning.cache.spillThreshold) {
@@ -134,20 +149,25 @@ export class MaterializationAdvisory {
         maxThreshold);
     }
     /**
-     * Check if a node is relational (can be cached)
+     * Check if a node is part of a correlated subquery
      */
-    isRelationalNode(node) {
-        return 'getAttributes' in node && typeof node.getAttributes === 'function';
+    isCorrelatedNode(node) {
+        // Check if this is a relational node that could be correlated
+        if (isRelationalNode(node)) {
+            return isCorrelatedSubquery(node);
+        }
+        return false;
     }
     /**
-     * Transform a node tree by applying cache recommendations
+     * Transform a tree by wrapping recommended nodes with CacheNode
+     * Uses a bottom-up approach to ensure proper transformation
      */
-    transformNode(node, recommendations) {
-        // First, recursively transform children
+    transformTree(node, recommendations) {
+        // First, transform all children recursively
         const transformedNode = this.transformChildren(node, recommendations);
-        // Check if this node should be cached
+        // Then check if this node itself should be cached
         const recommendation = recommendations.get(node);
-        if (recommendation?.shouldCache && this.isRelationalNode(transformedNode)) {
+        if (recommendation?.shouldCache && isRelationalNode(transformedNode)) {
             log('Injecting %s cache for %s (threshold: %d)', recommendation.strategy, transformedNode.nodeType, recommendation.threshold);
             return new CacheNode(transformedNode.scope, transformedNode, recommendation.strategy, recommendation.threshold);
         }
@@ -155,32 +175,31 @@ export class MaterializationAdvisory {
     }
     /**
      * Transform children of a node
+     * This handles both scalar and relational children using a simpler approach
      */
     transformChildren(node, recommendations) {
-        // Handle different node types that have children
-        // For nodes with relational children, we need to transform them
-        if ('getRelations' in node) {
-            const relations = node.getRelations();
-            const transformedRelations = relations.map((rel) => this.transformNode(rel, recommendations));
-            // Check if any relations were transformed
-            if (transformedRelations.some((rel, idx) => rel !== relations[idx])) {
-                // Need to create a new node with transformed relations
-                return this.recreateNodeWithNewRelations(node, transformedRelations);
+        // For nodes that we know how to handle, transform their children
+        // For others, return the node as-is (the optimizer will handle it)
+        // First, try to transform scalar children using withChildren
+        const scalarChildren = node.getChildren();
+        const transformedScalarChildren = scalarChildren.map(child => this.transformTree(child, recommendations));
+        const scalarChanged = transformedScalarChildren.some((child, idx) => child !== scalarChildren[idx]);
+        if (scalarChanged) {
+            // Let withChildren handle the transformation
+            // This will maintain proper attribute IDs and node structure
+            try {
+                return node.withChildren(transformedScalarChildren);
+            }
+            catch (e) {
+                // If withChildren fails, log and return original
+                log('Warning: withChildren failed for %s: %s', node.nodeType, e);
+                return node;
             }
         }
-        // If no transformations needed, return original node
-        return node;
-    }
-    /**
-     * Recreate a node with new relational children
-     * This is a simplified version - in practice, would need comprehensive node cloning
-     */
-    recreateNodeWithNewRelations(node, _newRelations) {
-        // TODO: This is a simplified implementation
-        // In practice, would need to handle all node types properly
-        // For now, just return the original node
-        // This would need to be expanded to handle all node types
-        log('Node recreation not yet implemented for %s', node.nodeType);
+        // If no scalar children changed, check if this node has relational children
+        // that might need caching. For now, we'll return the node as-is and let
+        // individual optimization rules handle relational transformations.
+        // This is safer than trying to recreate complex nodes.
         return node;
     }
 }

package/dist/src/planner/cache/materialization-advisory.js.map

@@ -1 +1 @@
-{"version":3,"file":"materialization-advisory.js","sourceRoot":"","sources":["../../../../src/planner/cache/materialization-advisory.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAEtD,OAAO,EAAE,SAAS,EAAsB,MAAM,wBAAwB,CAAC;AACvE,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAE1D,OAAO,EAAE,qBAAqB,EAAiB,MAAM,sBAAsB,CAAC;AAE5E,MAAM,GAAG,GAAG,YAAY,CAAC,iCAAiC,CAAC,CAAC;AAgB5D;;GAEG;AACH,MAAM,OAAO,uBAAuB;IAGf;IAFZ,gBAAgB,CAAwB;IAEhD,YAAoB,MAAuB;QAAvB,WAAM,GAAN,MAAM,CAAiB;QAC1C,IAAI,CAAC,gBAAgB,GAAG,IAAI,qBAAqB,CAAC,MAAM,CAAC,CAAC;IAC3D,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,IAAc;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;QACjE,MAAM,eAAe,GAAG,IAAI,GAAG,EAAiC,CAAC;QAEjE,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE,CAAC;YACtC,6CAA6C;YAC7C,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC;gBAClC,SAAS;YACV,CAAC;YAED,MAAM,cAAc,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACvD,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;YAE1C,IAAI,cAAc,CAAC,WAAW,EAAE,CAAC;gBAChC,GAAG,CAAC,+BAA+B,EAAE,IAAI,CAAC,QAAQ,EAAE,cAAc,CAAC,MAAM,CAAC,CAAC;YAC5E,CAAC;QACF,CAAC;QAED,OAAO,eAAe,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,IAAc,EAAE,eAAmD;QAC/E,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;IAClD,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,IAAc,EAAE,KAAe;QACpD,uDAAuD;QACvD,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;YAC1B,OAAO;gBACN,WAAW,EAAE,KAAK;gBAClB,QAAQ,EAAE,QAAQ;gBAClB,SAAS,EAAE,CAAC;gBACZ,MAAM,EAAE,wBAAwB;aAChC,CAAC;QACH,CAAC;QAED,sEAAsE;QACtE,IAAI,IAAI,CAAC,QAAQ,KAAK,YAAY,CAAC,KAAK,EAAE,CAAC;YAC1C,OAAO;gBACN,WAAW,EAAE,KAAK;gBAClB,QAAQ,EAAE,QAAQ;gBAClB,SAAS,EAAE,CAAC;gBACZ,MAAM,EAAE,gBAAgB;aACxB,CAAC;QACH,CAAC;QAED,8FAA8F;QAC9F,IAAI,KAAK,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;YACpD,OAAO;gBACN,WAAW,EAAE,KAAK;gBAClB,QAAQ,EAAE,QAAQ;gBAClB,SAAS,EAAE,CAAC;gBACZ,MAAM,EAAE,4BAA4B;aACpC,CAAC;QACH,CAAC;QAED,kDAAkD;QAClD,IAAI,KAAK,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YAC1D,MAAM,SAAS,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;YAEzE,OAAO;gBACN,WAAW,EAAE,IAAI;gBACjB,QAAQ;gBACR,SAAS;gBACT,MAAM,EAAE,qBAAqB,KAAK,CAAC,WAAW,GAAG;aACjD,CAAC;QACH,CAAC;QAED,8EAA8E;QAC9E,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;YACzB,wDAAwD;YACxD,IAAI,KAAK,CAAC,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,sBAAsB,EAAE,CAAC;gBACnE,OAAO;oBACN,WAAW,EAAE,KAAK;oBAClB,QAAQ,EAAE,QAAQ;oBAClB,SAAS,EAAE,CAAC;oBACZ,MAAM,EAAE,0BAA0B,KAAK,CAAC,aAAa,QAAQ;iBAC7D,CAAC;YACH,CAAC;YAED,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YAC1D,MAAM,SAAS,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;YAEzE,OAAO;gBACN,WAAW,EAAE,IAAI;gBACjB,QAAQ;gBACR,SAAS;gBACT,MAAM,EAAE,yBAAyB;aACjC,CAAC;QACH,CAAC;QAED,sBAAsB;QACtB,OAAO;YACN,WAAW,EAAE,KAAK;YAClB,QAAQ,EAAE,QAAQ;YAClB,SAAS,EAAE,CAAC;YACZ,MAAM,EAAE,yBAAyB;SACjC,CAAC;IACH,CAAC;IAEA;;GAEE;IACK,cAAc,CAAC,aAAqB;QAC3C,kDAAkD;QAClD,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,YAAY,IAAI,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,cAAc,EAAE,CAAC;YACxF,OAAO,OAAO,CAAC;QAChB,CAAC;QAED,OAAO,QAAQ,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,kBAAkB,CAAC,aAAqB,EAAE,QAAuB;QACxE,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,wBAAwB,CAAC;QAC7D,MAAM,YAAY,GAAG,QAAQ,KAAK,OAAO,CAAC,CAAC;YAC1C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,iBAAiB,GAAG,CAAC,CAAC,CAAC,CAAC,oCAAoC;YAC7E,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC;QAEpC,OAAO,IAAI,CAAC,GAAG,CACd,IAAI,CAAC,GAAG,CAAC,aAAa,GAAG,UAAU,EAAE,IAAI,CAAC,EAAE,oBAAoB;QAChE,YAAY,CACZ,CAAC;IACH,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,IAAc;QACtC,OAAO,eAAe,IAAI,IAAI,IAAI,OAAQ,IAAY,CAAC,aAAa,KAAK,UAAU,CAAC;IACrF,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,IAAc,EAAE,eAAmD;QACxF,wCAAwC;QACxC,MAAM,eAAe,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;QAEtE,sCAAsC;QACtC,MAAM,cAAc,GAAG,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjD,IAAI,cAAc,EAAE,WAAW,IAAI,IAAI,CAAC,gBAAgB,CAAC,eAAe,CAAC,EAAE,CAAC;YAC3E,GAAG,CAAC,2CAA2C,EAC9C,cAAc,CAAC,QAAQ,EAAE,eAAe,CAAC,QAAQ,EAAE,cAAc,CAAC,SAAS,CAAC,CAAC;YAE9E,OAAO,IAAI,SAAS,CACnB,eAAe,CAAC,KAAK,EACrB,eAAqC,EACrC,cAAc,CAAC,QAAQ,EACvB,cAAc,CAAC,SAAS,CACxB,CAAC;QACH,CAAC;QAED,OAAO,eAAe,CAAC;IACxB,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,IAAc,EAAE,eAAmD;QAC5F,iDAAiD;QAEjD,gEAAgE;QAChE,IAAI,cAAc,IAAI,IAAI,EAAE,CAAC;YAC5B,MAAM,SAAS,GAAI,IAAY,CAAC,YAAY,EAAE,CAAC;YAC/C,MAAM,oBAAoB,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,GAAa,EAAE,EAAE,CAC5D,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,eAAe,CAAC,CACxC,CAAC;YAEF,0CAA0C;YAC1C,IAAI,oBAAoB,CAAC,IAAI,CAAC,CAAC,GAAa,EAAE,GAAW,EAAE,EAAE,CAAC,GAAG,KAAK,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBACvF,uDAAuD;gBACvD,OAAO,IAAI,CAAC,4BAA4B,CAAC,IAAI,EAAE,oBAAoB,CAAC,CAAC;YACtE,CAAC;QACF,CAAC;QAED,qDAAqD;QACrD,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;OAGG;IACK,4BAA4B,CAAC,IAAc,EAAE,aAAmC;QACvF,4CAA4C;QAC5C,4DAA4D;QAE5D,yCAAyC;QACzC,0DAA0D;QAC1D,GAAG,CAAC,4CAA4C,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACjE,OAAO,IAAI,CAAC;IACb,CAAC;CACD"}
+{"version":3,"file":"materialization-advisory.js","sourceRoot":"","sources":["../../../../src/planner/cache/materialization-advisory.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,gBAAgB,EAA0C,MAAM,uBAAuB,CAAC;AACjG,OAAO,EAAE,SAAS,EAAsB,MAAM,wBAAwB,CAAC;AACvE,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAE1D,OAAO,EAAE,qBAAqB,EAAiB,MAAM,sBAAsB,CAAC;AAC5E,OAAO,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AAEjE,MAAM,GAAG,GAAG,YAAY,CAAC,iCAAiC,CAAC,CAAC;AAgB5D;;GAEG;AACH,MAAM,OAAO,uBAAuB;IAGf;IAFZ,gBAAgB,CAAwB;IAEhD,YAAoB,MAAuB;QAAvB,WAAM,GAAN,MAAM,CAAiB;QAC1C,IAAI,CAAC,gBAAgB,GAAG,IAAI,qBAAqB,CAAC,MAAM,CAAC,CAAC;IAC3D,CAAC;IAED;;;OAGG;IACH,mBAAmB,CAAC,IAAc;QACjC,wBAAwB;QACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;QAEjE,wBAAwB;QACxB,MAAM,eAAe,GAAG,IAAI,GAAG,EAAiC,CAAC;QAEjE,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE,CAAC;YACtC,6CAA6C;YAC7C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC7B,SAAS;YACV,CAAC;YAED,MAAM,cAAc,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACvD,IAAI,cAAc,CAAC,WAAW,EAAE,CAAC;gBAChC,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;gBAC1C,GAAG,CAAC,+BAA+B,EAAE,IAAI,CAAC,QAAQ,EAAE,cAAc,CAAC,MAAM,CAAC,CAAC;YAC5E,CAAC;QACF,CAAC;QAED,IAAI,eAAe,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAChC,GAAG,CAAC,qCAAqC,CAAC,CAAC;YAC3C,OAAO,IAAI,CAAC;QACb,CAAC;QAED,GAAG,CAAC,gCAAgC,EAAE,eAAe,CAAC,IAAI,CAAC,CAAC;QAE5D,kEAAkE;QAClE,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;IAClD,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,IAAc,EAAE,KAAe;QACpD,uDAAuD;QACvD,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;YAC1B,OAAO;gBACN,WAAW,EAAE,KAAK;gBAClB,QAAQ,EAAE,QAAQ;gBAClB,SAAS,EAAE,CAAC;gBACZ,MAAM,EAAE,wBAAwB;aAChC,CAAC;QACH,CAAC;QAED,sEAAsE;QACtE,IAAI,IAAI,CAAC,QAAQ,KAAK,YAAY,CAAC,KAAK,EAAE,CAAC;YAC1C,OAAO;gBACN,WAAW,EAAE,KAAK;gBAClB,QAAQ,EAAE,QAAQ;gBAClB,SAAS,EAAE,CAAC;gBACZ,MAAM,EAAE,gBAAgB;aACxB,CAAC;QACH,CAAC;QAED,qDAAqD;QACrD,0EAA0E;QAC1E,IAAI,gBAAgB,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3D,OAAO;gBACN,WAAW,EAAE,KAAK;gBAClB,QAAQ,EAAE,QAAQ;gBAClB,SAAS,EAAE,CAAC;gBACZ,MAAM,EAAE,0DAA0D;aAClE,CAAC;QACH,CAAC;QAED,8FAA8F;QAC9F,IAAI,KAAK,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;YACpD,OAAO;gBACN,WAAW,EAAE,KAAK;gBAClB,QAAQ,EAAE,QAAQ;gBAClB,SAAS,EAAE,CAAC;gBACZ,MAAM,EAAE,4BAA4B;aACpC,CAAC;QACH,CAAC;QAED,kDAAkD;QAClD,IAAI,KAAK,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YAC1D,MAAM,SAAS,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;YAEzE,OAAO;gBACN,WAAW,EAAE,IAAI;gBACjB,QAAQ;gBACR,SAAS;gBACT,MAAM,EAAE,qBAAqB,KAAK,CAAC,WAAW,GAAG;aACjD,CAAC;QACH,CAAC;QAED,8EAA8E;QAC9E,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;YACzB,wDAAwD;YACxD,IAAI,KAAK,CAAC,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,sBAAsB,EAAE,CAAC;gBACnE,OAAO;oBACN,WAAW,EAAE,KAAK;oBAClB,QAAQ,EAAE,QAAQ;oBAClB,SAAS,EAAE,CAAC;oBACZ,MAAM,EAAE,0BAA0B,KAAK,CAAC,aAAa,QAAQ;iBAC7D,CAAC;YACH,CAAC;YAED,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YAC1D,MAAM,SAAS,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;YAEzE,OAAO;gBACN,WAAW,EAAE,IAAI;gBACjB,QAAQ;gBACR,SAAS;gBACT,MAAM,EAAE,yBAAyB;aACjC,CAAC;QACH,CAAC;QAED,sBAAsB;QACtB,OAAO;YACN,WAAW,EAAE,KAAK;YAClB,QAAQ,EAAE,QAAQ;YAClB,SAAS,EAAE,CAAC;YACZ,MAAM,EAAE,yBAAyB;SACjC,CAAC;IACH,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,aAAqB;QAC3C,kDAAkD;QAClD,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,YAAY,IAAI,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,cAAc,EAAE,CAAC;YACxF,OAAO,OAAO,CAAC;QAChB,CAAC;QAED,OAAO,QAAQ,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,kBAAkB,CAAC,aAAqB,EAAE,QAAuB;QACxE,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,wBAAwB,CAAC;QAC7D,MAAM,YAAY,GAAG,QAAQ,KAAK,OAAO,CAAC,CAAC;YAC1C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,iBAAiB,GAAG,CAAC,CAAC,CAAC,CAAC,oCAAoC;YAC7E,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC;QAEpC,OAAO,IAAI,CAAC,GAAG,CACd,IAAI,CAAC,GAAG,CAAC,aAAa,GAAG,UAAU,EAAE,IAAI,CAAC,EAAE,oBAAoB;QAChE,YAAY,CACZ,CAAC;IACH,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,IAAc;QACtC,8DAA8D;QAC9D,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5B,OAAO,oBAAoB,CAAC,IAA0B,CAAC,CAAC;QACzD,CAAC;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAED;;;OAGG;IACK,aAAa,CAAC,IAAc,EAAE,eAAmD;QACxF,4CAA4C;QAC5C,MAAM,eAAe,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;QAEtE,kDAAkD;QAClD,MAAM,cAAc,GAAG,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjD,IAAI,cAAc,EAAE,WAAW,IAAI,gBAAgB,CAAC,eAAe,CAAC,EAAE,CAAC;YACtE,GAAG,CAAC,2CAA2C,EAC9C,cAAc,CAAC,QAAQ,EAAE,eAAe,CAAC,QAAQ,EAAE,cAAc,CAAC,SAAS,CAAC,CAAC;YAE9E,OAAO,IAAI,SAAS,CACnB,eAAe,CAAC,KAAK,EACrB,eAAqC,EACrC,cAAc,CAAC,QAAQ,EACvB,cAAc,CAAC,SAAS,CACxB,CAAC;QACH,CAAC;QAED,OAAO,eAAe,CAAC;IACxB,CAAC;IAED;;;OAGG;IACK,iBAAiB,CAAC,IAAc,EAAE,eAAmD;QAC5F,iEAAiE;QACjE,mEAAmE;QAEnE,6DAA6D;QAC7D,MAAM,cAAc,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAC1C,MAAM,yBAAyB,GAAG,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAC5D,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,eAAe,CAAC,CAC1C,CAAC;QAEF,MAAM,aAAa,GAAG,yBAAyB,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE,CACnE,KAAK,KAAK,cAAc,CAAC,GAAG,CAAC,CAC7B,CAAC;QAEF,IAAI,aAAa,EAAE,CAAC;YACnB,6CAA6C;YAC7C,6DAA6D;YAC7D,IAAI,CAAC;gBACJ,OAAO,IAAI,CAAC,YAAY,CAAC,yBAAyB,CAAC,CAAC;YACrD,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACZ,iDAAiD;gBACjD,GAAG,CAAC,yCAAyC,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;gBACjE,OAAO,IAAI,CAAC;YACb,CAAC;QACF,CAAC;QAED,4EAA4E;QAC5E,wEAAwE;QACxE,mEAAmE;QACnE,uDAAuD;QAEvD,OAAO,IAAI,CAAC;IACb,CAAC;CACD"}

package/dist/src/planner/cache/reference-graph.d.ts

@@ -1,8 +1,14 @@
 /**
  * Reference graph builder for materialization advisory
  * Analyzes plan tree to identify nodes that would benefit from caching
+ *
+ * Note: This builder works with logical plan nodes and their properties.
+ * It does not make assumptions about execution strategies (e.g., whether
+ * a join will use nested loops vs hash join). Loop detection and execution
+ * multipliers should be determined during physical optimization when
+ * concrete execution strategies are chosen.
  */
-import type { PlanNode } from '../nodes/plan-node.js';
+import { type PlanNode } from '../nodes/plan-node.js';
 import type { OptimizerTuning } from '../optimizer-tuning.js';
 /**
  * Statistics about how a node is referenced in the plan tree
@@ -16,6 +22,10 @@ export interface RefStats {
     estimatedRows: number;
     /** Whether this node is deterministic (same inputs produce same outputs) */
     deterministic: boolean;
+    /** Parent nodes that reference this node (for debugging) */
+    parents: Set<PlanNode>;
+    /** Estimated execution multiplier due to loop contexts */
+    loopMultiplier: number;
 }
 /**
  * Builds a reference graph for materialization decisions
@@ -23,24 +33,19 @@ export interface RefStats {
 export declare class ReferenceGraphBuilder {
     private tuning;
     private refMap;
-    private visited;
     constructor(tuning: OptimizerTuning);
     /**
      * Build reference statistics for all nodes in the plan tree
      */
     buildReferenceGraph(root: PlanNode): Map<PlanNode, RefStats>;
     /**
-     * First pass: count how many parents reference each node
+     * Build reference statistics recursively
      */
-    private countReferences;
-    /**
-     * Second pass: identify nodes that appear in loop contexts
-     */
-    private identifyLoopContexts;
+    private buildReferences;
     /**
      * Visit all children of a node
      */
-    private visitChildren;
+    private visitAllChildren;
     /**
      * Get estimated row count for a node
      */

package/dist/src/planner/cache/reference-graph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"reference-graph.d.ts","sourceRoot":"","sources":["../../../../src/planner/cache/reference-graph.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAGtD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAI9D;;GAEG;AACH,MAAM,WAAW,QAAQ;IACxB,mDAAmD;IACnD,WAAW,EAAE,MAAM,CAAC;IACpB,0FAA0F;IAC1F,aAAa,EAAE,OAAO,CAAC;IACvB,kDAAkD;IAClD,aAAa,EAAE,MAAM,CAAC;IACtB,4EAA4E;IAC5E,aAAa,EAAE,OAAO,CAAC;CACvB;AAED;;GAEG;AACH,qBAAa,qBAAqB;IAIrB,OAAO,CAAC,MAAM;IAH1B,OAAO,CAAC,MAAM,CAAiC;IAC/C,OAAO,CAAC,OAAO,CAAuB;gBAElB,MAAM,EAAE,eAAe;IAE3C;;OAEG;IACH,mBAAmB,CAAC,IAAI,EAAE,QAAQ,GAAG,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAc5D;;OAEG;IACH,OAAO,CAAC,eAAe;IA4BvB;;OAEG;IACH,OAAO,CAAC,oBAAoB;IAwB5B;;OAEG;IACH,OAAO,CAAC,aAAa;IAcrB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAUxB;;OAEG;IACH,OAAO,CAAC,eAAe;CA2BvB"}
+{"version":3,"file":"reference-graph.d.ts","sourceRoot":"","sources":["../../../../src/planner/cache/reference-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,OAAO,EAAoB,KAAK,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AACxE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAI9D;;GAEG;AACH,MAAM,WAAW,QAAQ;IACxB,mDAAmD;IACnD,WAAW,EAAE,MAAM,CAAC;IACpB,0FAA0F;IAC1F,aAAa,EAAE,OAAO,CAAC;IACvB,kDAAkD;IAClD,aAAa,EAAE,MAAM,CAAC;IACtB,4EAA4E;IAC5E,aAAa,EAAE,OAAO,CAAC;IACvB,4DAA4D;IAC5D,OAAO,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC;IACvB,0DAA0D;IAC1D,cAAc,EAAE,MAAM,CAAC;CACvB;AAcD;;GAEG;AACH,qBAAa,qBAAqB;IAGrB,OAAO,CAAC,MAAM;IAF1B,OAAO,CAAC,MAAM,CAAiC;gBAE3B,MAAM,EAAE,eAAe;IAE3C;;OAEG;IACH,mBAAmB,CAAC,IAAI,EAAE,QAAQ,GAAG,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAqB5D;;OAEG;IACH,OAAO,CAAC,eAAe;IA4CvB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAiCxB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAmBxB;;OAEG;IACH,OAAO,CAAC,eAAe;CAQvB"}

package/dist/src/planner/cache/reference-graph.js

@@ -1,10 +1,15 @@
 /**
  * Reference graph builder for materialization advisory
  * Analyzes plan tree to identify nodes that would benefit from caching
+ *
+ * Note: This builder works with logical plan nodes and their properties.
+ * It does not make assumptions about execution strategies (e.g., whether
+ * a join will use nested loops vs hash join). Loop detection and execution
+ * multipliers should be determined during physical optimization when
+ * concrete execution strategies are chosen.
  */
 import { createLogger } from '../../common/logger.js';
-import { PlanNodeType } from '../nodes/plan-node-type.js';
-import { JoinNode } from '../nodes/join-node.js';
+import { isRelationalNode } from '../nodes/plan-node.js';
 const log = createLogger('optimizer:cache:reference-graph');
 /**
  * Builds a reference graph for materialization decisions
@@ -12,7 +17,6 @@ const log = createLogger('optimizer:cache:reference-graph');
 export class ReferenceGraphBuilder {
     tuning;
     refMap = new Map();
-    visited = new Set();
     constructor(tuning) {
         this.tuning = tuning;
     }
@@ -20,79 +24,95 @@ export class ReferenceGraphBuilder {
      * Build reference statistics for all nodes in the plan tree
      */
     buildReferenceGraph(root) {
+        if (!root) {
+            log('Warning: buildReferenceGraph called with null root');
+            return new Map();
+        }
         this.refMap.clear();
-        this.visited.clear();
-        // First pass: count parent references
-        this.countReferences(root, false);
-        // Second pass: identify loop contexts
-        this.identifyLoopContexts(root, false);
+        // Build the reference graph with proper parent tracking
+        const context = {
+            parent: null,
+            inLoop: false,
+            loopIterations: 1
+        };
+        this.buildReferences(root, context);
         log('Built reference graph with %d nodes', this.refMap.size);
         return new Map(this.refMap);
     }
     /**
-     * First pass: count how many parents reference each node
+     * Build reference statistics recursively
      */
-    countReferences(node, inLoop) {
-        if (this.visited.has(node)) {
-            // Node seen again - increment parent count
-            const stats = this.refMap.get(node);
-            if (stats) {
-                stats.parentCount++;
-            }
+    buildReferences(node, context) {
+        if (!node) {
             return;
         }
-        this.visited.add(node);
-        // Initialize stats for this node
-        const stats = {
-            parentCount: 1, // First time seeing this node
-            appearsInLoop: inLoop,
-            estimatedRows: this.getEstimatedRows(node),
-            deterministic: this.isDeterministic(node)
-        };
-        this.refMap.set(node, stats);
-        // Recurse to children
-        this.visitChildren(node, (child) => {
-            this.countReferences(child, inLoop);
-        });
-    }
-    /**
-     * Second pass: identify nodes that appear in loop contexts
-     */
-    identifyLoopContexts(node, inLoop) {
-        const stats = this.refMap.get(node);
-        if (!stats)
-            return;
-        // Update loop status if we're now in a loop context
-        if (inLoop && !stats.appearsInLoop) {
-            stats.appearsInLoop = true;
-            log('Node %s marked as appearing in loop', node.nodeType);
+        // Get or create stats for this node
+        let stats = this.refMap.get(node);
+        if (!stats) {
+            // First time seeing this node
+            stats = {
+                parentCount: 0,
+                appearsInLoop: context.inLoop,
+                estimatedRows: this.getEstimatedRows(node),
+                deterministic: this.isDeterministic(node),
+                parents: new Set(),
+                loopMultiplier: context.loopIterations
+            };
+            this.refMap.set(node, stats);
         }
-        // Determine if children are in loop context
-        if (node instanceof JoinNode && node.joinType === 'inner') {
-            // Right side of nested loop join is in loop context
-            const [left, right] = node.getRelations();
-            this.identifyLoopContexts(left, inLoop);
-            this.identifyLoopContexts(right, true); // Right side is in loop
+        // Update stats based on current traversal
+        if (context.parent && !stats.parents.has(context.parent)) {
+            stats.parents.add(context.parent);
+            stats.parentCount++;
         }
-        else {
-            // Recurse to all children with current loop status
-            this.visitChildren(node, (child) => {
-                this.identifyLoopContexts(child, inLoop);
-            });
+        // Update loop context
+        if (context.inLoop) {
+            stats.appearsInLoop = true;
+            stats.loopMultiplier = Math.max(stats.loopMultiplier, context.loopIterations);
         }
+        // Create child context - for now, we propagate the parent context
+        // In the future, if nodes expose execution strategy hints, we could use those
+        const childContext = {
+            parent: node,
+            inLoop: context.inLoop,
+            loopIterations: context.loopIterations
+        };
+        // Visit all children uniformly
+        this.visitAllChildren(node, childContext);
     }
     /**
      * Visit all children of a node
      */
-    visitChildren(node, visitor) {
-        // Visit scalar expression children
-        for (const child of node.getChildren()) {
-            visitor(child);
+    visitAllChildren(node, childContext) {
+        // 1. Scalar children (expressions)
+        try {
+            const children = node.getChildren();
+            for (const child of children) {
+                if (child) {
+                    this.buildReferences(child, childContext);
+                }
+            }
         }
-        // Visit relational children
-        if ('getRelations' in node) {
-            for (const relation of node.getRelations()) {
-                visitor(relation);
+        catch (e) {
+            log('Warning: Failed to get children for node %s: %s', node.nodeType, e);
+        }
+        // 2. Relational children
+        // Note: getRelations() returns a subset of getChildren() for nodes that have relational children
+        // We need to be careful not to double-count, but since we're using a Set for parents,
+        // and checking if we've already added a parent, this should be fine
+        if (isRelationalNode(node)) {
+            try {
+                const relations = node.getRelations();
+                for (const relation of relations) {
+                    if (relation) {
+                        // For now, treat all relational children the same
+                        // In the future, nodes could provide hints about execution patterns
+                        this.buildReferences(relation, childContext);
+                    }
+                }
+            }
+            catch (e) {
+                log('Warning: Failed to get relations for node %s: %s', node.nodeType, e);
             }
         }
     }
@@ -100,40 +120,29 @@ export class ReferenceGraphBuilder {
      * Get estimated row count for a node
      */
     getEstimatedRows(node) {
-        if ('estimatedRows' in node && typeof node.estimatedRows === 'number') {
-            return node.estimatedRows;
+        if (!node) {
+            return this.tuning.defaultRowEstimate;
         }
-        if (node.physical?.estimatedRows) {
+        // Use physical properties if available
+        if (node.physical?.estimatedRows !== undefined) {
             return node.physical.estimatedRows;
         }
+        // Fall back to node-specific estimates (for relational nodes)
+        if (isRelationalNode(node) && node.estimatedRows !== undefined) {
+            return node.estimatedRows;
+        }
+        // Default estimate
         return this.tuning.defaultRowEstimate;
     }
     /**
      * Determine if a node is deterministic
      */
     isDeterministic(node) {
-        // Check physical properties first
-        if (node.physical?.deterministic !== undefined) {
-            return node.physical.deterministic;
-        }
-        // Node-type specific deterministic analysis
-        switch (node.nodeType) {
-            case PlanNodeType.TableScan:
-            case PlanNodeType.Values:
-            case PlanNodeType.Project:
-            case PlanNodeType.Filter:
-            case PlanNodeType.Sort:
-            case PlanNodeType.Aggregate:
-            case PlanNodeType.StreamAggregate:
-                return true;
-            case PlanNodeType.TableFunctionCall:
-                // Would need to check if the table function is deterministic
-                // For now, assume non-deterministic to be safe
-                return false;
-            default:
-                // Conservative default - assume deterministic unless proven otherwise
-                return true;
+        if (!node) {
+            return true;
         }
+        // Use physical properties to determine determinism
+        return node.physical?.deterministic ?? true;
     }
 }
 //# sourceMappingURL=reference-graph.js.map

package/dist/src/planner/cache/reference-graph.js.map

@@ -1 +1 @@
-{"version":3,"file":"reference-graph.js","sourceRoot":"","sources":["../../../../src/planner/cache/reference-graph.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAEtD,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC1D,OAAO,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAGjD,MAAM,GAAG,GAAG,YAAY,CAAC,iCAAiC,CAAC,CAAC;AAgB5D;;GAEG;AACH,MAAM,OAAO,qBAAqB;IAIb;IAHZ,MAAM,GAAG,IAAI,GAAG,EAAsB,CAAC;IACvC,OAAO,GAAG,IAAI,GAAG,EAAY,CAAC;IAEtC,YAAoB,MAAuB;QAAvB,WAAM,GAAN,MAAM,CAAiB;IAAG,CAAC;IAE/C;;OAEG;IACH,mBAAmB,CAAC,IAAc;QACjC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QAErB,sCAAsC;QACtC,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAElC,sCAAsC;QACtC,IAAI,CAAC,oBAAoB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAEvC,GAAG,CAAC,qCAAqC,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC7D,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,IAAc,EAAE,MAAe;QACtD,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5B,2CAA2C;YAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACpC,IAAI,KAAK,EAAE,CAAC;gBACX,KAAK,CAAC,WAAW,EAAE,CAAC;YACrB,CAAC;YACD,OAAO;QACR,CAAC;QAED,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAEvB,iCAAiC;QACjC,MAAM,KAAK,GAAa;YACvB,WAAW,EAAE,CAAC,EAAE,8BAA8B;YAC9C,aAAa,EAAE,MAAM;YACrB,aAAa,EAAE,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC;YAC1C,aAAa,EAAE,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC;SACzC,CAAC;QAEF,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAE7B,sBAAsB;QACtB,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE;YAClC,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,oBAAoB,CAAC,IAAc,EAAE,MAAe;QAC3D,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,CAAC,KAAK;YAAE,OAAO;QAEnB,oDAAoD;QACpD,IAAI,MAAM,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;YACpC,KAAK,CAAC,aAAa,GAAG,IAAI,CAAC;YAC3B,GAAG,CAAC,qCAAqC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC3D,CAAC;QAED,4CAA4C;QAC5C,IAAI,IAAI,YAAY,QAAQ,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO,EAAE,CAAC;YAC3D,oDAAoD;YACpD,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;YAC1C,IAAI,CAAC,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YACxC,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,wBAAwB;QACjE,CAAC;aAAM,CAAC;YACP,mDAAmD;YACnD,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE;gBAClC,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YAC1C,CAAC,CAAC,CAAC;QACJ,CAAC;IACF,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,IAAc,EAAE,OAAkC;QACvE,mCAAmC;QACnC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;YACxC,OAAO,CAAC,KAAK,CAAC,CAAC;QAChB,CAAC;QAED,4BAA4B;QAC5B,IAAI,cAAc,IAAI,IAAI,EAAE,CAAC;YAC5B,KAAK,MAAM,QAAQ,IAAK,IAAY,CAAC,YAAY,EAAE,EAAE,CAAC;gBACrD,OAAO,CAAC,QAAQ,CAAC,CAAC;YACnB,CAAC;QACF,CAAC;IACF,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,IAAc;QACtC,IAAI,eAAe,IAAI,IAAI,IAAI,OAAO,IAAI,CAAC,aAAa,KAAK,QAAQ,EAAE,CAAC;YACvE,OAAO,IAAI,CAAC,aAAa,CAAC;QAC3B,CAAC;QACD,IAAI,IAAI,CAAC,QAAQ,EAAE,aAAa,EAAE,CAAC;YAClC,OAAO,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC;QACpC,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,kBAAkB,CAAC;IACvC,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,IAAc;QACrC,kCAAkC;QAClC,IAAI,IAAI,CAAC,QAAQ,EAAE,aAAa,KAAK,SAAS,EAAE,CAAC;YAChD,OAAO,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC;QACpC,CAAC;QAED,4CAA4C;QAC5C,QAAQ,IAAI,CAAC,QAAQ,EAAE,CAAC;YACvB,KAAK,YAAY,CAAC,SAAS,CAAC;YAC5B,KAAK,YAAY,CAAC,MAAM,CAAC;YACzB,KAAK,YAAY,CAAC,OAAO,CAAC;YAC1B,KAAK,YAAY,CAAC,MAAM,CAAC;YACzB,KAAK,YAAY,CAAC,IAAI,CAAC;YACvB,KAAK,YAAY,CAAC,SAAS,CAAC;YAC5B,KAAK,YAAY,CAAC,eAAe;gBAChC,OAAO,IAAI,CAAC;YAEb,KAAK,YAAY,CAAC,iBAAiB;gBAClC,6DAA6D;gBAC7D,+CAA+C;gBAC/C,OAAO,KAAK,CAAC;YAEd;gBACC,sEAAsE;gBACtE,OAAO,IAAI,CAAC;QACd,CAAC;IACF,CAAC;CACD"}
+{"version":3,"file":"reference-graph.js","sourceRoot":"","sources":["../../../../src/planner/cache/reference-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,gBAAgB,EAAiB,MAAM,uBAAuB,CAAC;AAGxE,MAAM,GAAG,GAAG,YAAY,CAAC,iCAAiC,CAAC,CAAC;AAgC5D;;GAEG;AACH,MAAM,OAAO,qBAAqB;IAGb;IAFZ,MAAM,GAAG,IAAI,GAAG,EAAsB,CAAC;IAE/C,YAAoB,MAAuB;QAAvB,WAAM,GAAN,MAAM,CAAiB;IAAG,CAAC;IAE/C;;OAEG;IACH,mBAAmB,CAAC,IAAc;QACjC,IAAI,CAAC,IAAI,EAAE,CAAC;YACX,GAAG,CAAC,oDAAoD,CAAC,CAAC;YAC1D,OAAO,IAAI,GAAG,EAAE,CAAC;QAClB,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QAEpB,wDAAwD;QACxD,MAAM,OAAO,GAAqB;YACjC,MAAM,EAAE,IAAI;YACZ,MAAM,EAAE,KAAK;YACb,cAAc,EAAE,CAAC;SACjB,CAAC;QAEF,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAEpC,GAAG,CAAC,qCAAqC,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC7D,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,IAAiC,EAAE,OAAyB;QACnF,IAAI,CAAC,IAAI,EAAE,CAAC;YACX,OAAO;QACR,CAAC;QAED,oCAAoC;QACpC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK,EAAE,CAAC;YACZ,8BAA8B;YAC9B,KAAK,GAAG;gBACP,WAAW,EAAE,CAAC;gBACd,aAAa,EAAE,OAAO,CAAC,MAAM;gBAC7B,aAAa,EAAE,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC;gBAC1C,aAAa,EAAE,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC;gBACzC,OAAO,EAAE,IAAI,GAAG,EAAY;gBAC5B,cAAc,EAAE,OAAO,CAAC,cAAc;aACtC,CAAC;YACF,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC9B,CAAC;QAED,0CAA0C;QAC1C,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1D,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YAClC,KAAK,CAAC,WAAW,EAAE,CAAC;QACrB,CAAC;QAED,sBAAsB;QACtB,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;YACpB,KAAK,CAAC,aAAa,GAAG,IAAI,CAAC;YAC3B,KAAK,CAAC,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,cAAc,EAAE,OAAO,CAAC,cAAc,CAAC,CAAC;QAC/E,CAAC;QAED,kEAAkE;QAClE,8EAA8E;QAC9E,MAAM,YAAY,GAAqB;YACtC,MAAM,EAAE,IAAI;YACZ,MAAM,EAAE,OAAO,CAAC,MAAM;YACtB,cAAc,EAAE,OAAO,CAAC,cAAc;SACtC,CAAC;QAEF,+BAA+B;QAC/B,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;IAC3C,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,IAAc,EAAE,YAA8B;QACtE,mCAAmC;QACnC,IAAI,CAAC;YACJ,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YACpC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;gBAC9B,IAAI,KAAK,EAAE,CAAC;oBACX,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;gBAC3C,CAAC;YACF,CAAC;QACF,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACZ,GAAG,CAAC,iDAAiD,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC1E,CAAC;QAED,yBAAyB;QACzB,iGAAiG;QACjG,sFAAsF;QACtF,oEAAoE;QACpE,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC;gBACJ,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;gBACtC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;oBAClC,IAAI,QAAQ,EAAE,CAAC;wBACd,kDAAkD;wBAClD,oEAAoE;wBACpE,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;oBAC9C,CAAC;gBACF,CAAC;YACF,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACZ,GAAG,CAAC,kDAAkD,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YAC3E,CAAC;QACF,CAAC;IACF,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,IAAiC;QACzD,IAAI,CAAC,IAAI,EAAE,CAAC;YACX,OAAO,IAAI,CAAC,MAAM,CAAC,kBAAkB,CAAC;QACvC,CAAC;QAED,uCAAuC;QACvC,IAAI,IAAI,CAAC,QAAQ,EAAE,aAAa,KAAK,SAAS,EAAE,CAAC;YAChD,OAAO,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC;QACpC,CAAC;QAED,8DAA8D;QAC9D,IAAI,gBAAgB,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS,EAAE,CAAC;YAChE,OAAO,IAAI,CAAC,aAAa,CAAC;QAC3B,CAAC;QAED,mBAAmB;QACnB,OAAO,IAAI,CAAC,MAAM,CAAC,kBAAkB,CAAC;IACvC,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,IAAiC;QACxD,IAAI,CAAC,IAAI,EAAE,CAAC;YACX,OAAO,IAAI,CAAC;QACb,CAAC;QAED,mDAAmD;QACnD,OAAO,IAAI,CAAC,QAAQ,EAAE,aAAa,IAAI,IAAI,CAAC;IAC7C,CAAC;CACD"}

package/dist/src/planner/debug.d.ts

@@ -50,4 +50,29 @@ export declare function getInstructionDebugInfo(instructions: readonly Instructi
  * Generates a comprehensive trace report that includes sub-program execution details.
  */
 export declare function generateTraceReport(tracer: InstructionTracer): string;
+/**
+ * Options for plan formatting
+ */
+export interface PlanDisplayOptions {
+    /** Show concise plan by default (true) or full details (false) */
+    concise?: boolean;
+    /** Node IDs to expand with full details (only applies when concise=true) */
+    expandNodes?: string[];
+    /** Maximum depth to display (default: no limit) */
+    maxDepth?: number;
+    /** Show physical properties if available */
+    showPhysical?: boolean;
+}
+/**
+ * Creates a concise, tree-like representation of the plan
+ */
+export declare function formatPlanTree(rootNode: PlanNode, options?: PlanDisplayOptions): string;
+/**
+ * Generates a compact plan summary showing just the execution path
+ */
+export declare function formatPlanSummary(rootNode: PlanNode): string;
+/**
+ * Enhanced plan serialization with formatting options
+ */
+export declare function serializePlanTreeWithOptions(rootNode: PlanNode, options?: PlanDisplayOptions): string;
 //# sourceMappingURL=debug.d.ts.map

package/dist/src/planner/debug.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"debug.d.ts","sourceRoot":"","sources":["../../../src/planner/debug.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAGrD,OAAO,KAAK,EAAE,WAAW,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AAK1E;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,GAAG,CAAC;IACV,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,iBAAiB,EAAE,CAAC;IAC9B,SAAS,EAAE,iBAAiB,EAAE,CAAC;IAC/B,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;CACjC;AAED;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACnC,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,WAAW,CAAC,EAAE,mBAAmB,EAAE,CAAC;CACrC;AAED;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC,YAAY,EAAE,MAAM,CAAC;IACrB,gBAAgB,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,YAAY,EAAE,oBAAoB,EAAE,CAAC;CACtC;AAqDD;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,GAAG,MAAM,CA+D5D;AAED;;GAEG;AACH,wBAAgB,0BAA0B,CACxC,YAAY,EAAE,SAAS,WAAW,EAAE,EACpC,YAAY,EAAE,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,EAAE,GACvC,MAAM,CAoDR;AAED;;GAEG;AACH,wBAAgB,uBAAuB,CACrC,YAAY,EAAE,SAAS,WAAW,EAAE,EACpC,YAAY,EAAE,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,EAAE,GACvC,oBAAoB,EAAE,CA+BxB;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,iBAAiB,GACxB,MAAM,CA+CR"}
+{"version":3,"file":"debug.d.ts","sourceRoot":"","sources":["../../../src/planner/debug.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAGrD,OAAO,KAAK,EAAE,WAAW,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AAK1E;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,GAAG,CAAC;IACV,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,iBAAiB,EAAE,CAAC;IAC9B,SAAS,EAAE,iBAAiB,EAAE,CAAC;IAC/B,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;CACjC;AAED;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACnC,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,WAAW,CAAC,EAAE,mBAAmB,EAAE,CAAC;CACrC;AAED;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC,YAAY,EAAE,MAAM,CAAC;IACrB,gBAAgB,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,YAAY,EAAE,oBAAoB,EAAE,CAAC;CACtC;AAqDD;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,GAAG,MAAM,CA+D5D;AAED;;GAEG;AACH,wBAAgB,0BAA0B,CACxC,YAAY,EAAE,SAAS,WAAW,EAAE,EACpC,YAAY,EAAE,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,EAAE,GACvC,MAAM,CAoDR;AAED;;GAEG;AACH,wBAAgB,uBAAuB,CACrC,YAAY,EAAE,SAAS,WAAW,EAAE,EACpC,YAAY,EAAE,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,EAAE,GACvC,oBAAoB,EAAE,CA+BxB;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,iBAAiB,GACxB,MAAM,CA+CR;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB;IAClC,kEAAkE;IAClE,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,4EAA4E;IAC5E,WAAW,CAAC,EAAE,MAAM,EAAE,CAAC;IACvB,mDAAmD;IACnD,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,4CAA4C;IAC5C,YAAY,CAAC,EAAE,OAAO,CAAC;CACvB;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,GAAE,kBAAuB,GAAG,MAAM,CAuG3F;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,GAAG,MAAM,CAwB5D;AAED;;GAEG;AACH,wBAAgB,4BAA4B,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,GAAE,kBAAuB,GAAG,MAAM,CAOzG"}