@quereus/quereus 0.7.3 → 0.7.5

package/src/planner/analysis/constraint-extractor.ts

@@ -1,764 +0,0 @@
-/**
- * Constraint extraction utilities for predicate analysis and pushdown optimization
- * Converts scalar expressions into constraints that can be pushed down to virtual tables
- */
-
-import type { ScalarPlanNode, RelationalPlanNode, PlanNode } from '../nodes/plan-node.js';
-import { PlanNodeType } from '../nodes/plan-node-type.js';
-import type { ColumnReferenceNode } from '../nodes/reference.js';
-import { BinaryOpNode, BetweenNode } from '../nodes/scalar.js';
-import type { LiteralNode } from '../nodes/scalar.js';
-import { InNode } from '../nodes/subquery.js';
-import type { Row, SqlValue } from '../../common/types.js';
-import { createLogger } from '../../common/logger.js';
-import type * as AST from '../../parser/ast.js';
-import { getSyncLiteral } from '../../parser/utils.js';
-import type { ConstraintOp, PredicateConstraint as VtabPredicateConstraint } from '../../vtab/best-access-plan.js';
-import { TableReferenceNode, ColumnReferenceNode as _ColumnRef } from '../nodes/reference.js';
-import { CapabilityDetectors } from '../framework/characteristics.js';
-
-const log = createLogger('planner:analysis:constraint-extractor');
-
-// ConstraintOp is imported from vtab/best-access-plan.ts
-
-/**
- * A constraint extracted from a predicate expression
- * Extends the vtab PredicateConstraint with additional metadata for the planner
- */
-export interface PredicateConstraint extends VtabPredicateConstraint {
-	/** Attribute ID of the column reference */
-	attributeId: number;
-	/** Original expression node for debugging */
-	sourceExpression: ScalarPlanNode;
-	/** Target table relation (for multi-table predicates) */
-	targetRelation?: string;
-	/** Dynamic value expression for parameterized/correlated constraints (or IN lists) */
-	valueExpr?: ScalarPlanNode | ScalarPlanNode[];
-	/** Binding kind describing how value is supplied */
-	bindingKind?: 'literal' | 'parameter' | 'correlated' | 'expression' | 'mixed';
-}
-
-/**
- * Result of constraint extraction
- */
-export interface ConstraintExtractionResult {
-	/** Extracted constraints grouped by target table relation */
-	constraintsByTable: Map<string, PredicateConstraint[]>;
-	/** Residual predicate that couldn't be converted to constraints */
-	residualPredicate?: ScalarPlanNode;
-	/** All constraints in a flat list */
-	allConstraints: PredicateConstraint[];
-  /** Predicate comprised only of supported fragments for a specific table (optional) */
-  supportedPredicateByTable?: Map<string, ScalarPlanNode>;
-  /** For each table, which unique key(s) are fully covered by equality constraints (by column indexes). Empty if none. */
-  coveredKeysByTable?: Map<string, number[][]>;
-}
-
-/**
- * Table information for constraint mapping
- */
-export interface TableInfo {
-	relationName: string; // human-readable (e.g., schema.table)
-	relationKey: string;  // instance-unique (e.g., schema.table#<nodeId>)
-	attributes: Array<{ id: number; name: string }>;
-	columnIndexMap: Map<number, number>; // attributeId -> columnIndex
-  /** Logical unique keys for the relation, expressed as output column indexes */
-  uniqueKeys?: number[][];
-}
-
-/**
- * Extract constraints from a scalar predicate expression
- * Handles binary comparisons, boolean logic (AND/OR), and complex expressions
- */
-export function extractConstraints(
-	predicate: ScalarPlanNode,
-	tableInfos: TableInfo[] = []
-): ConstraintExtractionResult {
-	const constraintsByTable = new Map<string, PredicateConstraint[]>();
-	const allConstraints: PredicateConstraint[] = [];
-	const residualExpressions: ScalarPlanNode[] = [];
-
-	log('Extracting constraints from predicate: %s', predicate.toString());
-
-	// Build attribute-to-table mapping for quick lookups
-	const tableByAttribute = new Map<number, TableInfo>();
-	for (const tableInfo of tableInfos) {
-		for (const attr of tableInfo.attributes) {
-			tableByAttribute.set(attr.id, tableInfo);
-		}
-	}
-
-  // Start extraction process & build supported fragments per table
-  const perTableParts = new Map<string, ScalarPlanNode[]>();
-  extractFromExpression(predicate, allConstraints, residualExpressions, tableByAttribute, perTableParts);
-
-	// Group constraints by table instance key
-	for (const constraint of allConstraints) {
-		if (constraint.targetRelation) {
-			if (!constraintsByTable.has(constraint.targetRelation)) {
-				constraintsByTable.set(constraint.targetRelation, []);
-			}
-			constraintsByTable.get(constraint.targetRelation)!.push(constraint);
-		}
-	}
-
-	// Build residual predicate from unmatched expressions (combine with AND)
-	let residualPredicate: ScalarPlanNode | undefined;
-	if (residualExpressions.length === 1) {
-		residualPredicate = residualExpressions[0];
-	} else if (residualExpressions.length > 1) {
-		let acc = residualExpressions[0];
-		for (let i = 1; i < residualExpressions.length; i++) {
-			const right = residualExpressions[i];
-			const ast: AST.BinaryExpr = { type: 'binary', operator: 'AND', left: (acc as any).expression, right: (right as any).expression };
-			acc = new BinaryOpNode((acc as any).scope, ast, acc, right);
-		}
-		residualPredicate = acc;
-	}
-
-	log('Extracted %d constraints across %d tables, %d residual expressions',
-		allConstraints.length, constraintsByTable.size, residualExpressions.length);
-
-  const supportedPredicateByTable = new Map<string, ScalarPlanNode>();
-  for (const [rel, parts] of perTableParts) {
-    const combined = combineParts(parts);
-    if (combined) supportedPredicateByTable.set(rel, combined);
-  }
-
-  // Compute covered keys per table: collect equality constraints and check against table unique keys
-  const coveredKeysByTable = new Map<string, number[][]>();
-  for (const [rel, constraints] of constraintsByTable) {
-    const tInfo = tableInfos.find(t => t.relationKey === rel || t.relationName === rel);
-    if (!tInfo || !tInfo.uniqueKeys || tInfo.uniqueKeys.length === 0) {
-      coveredKeysByTable.set(rel, []);
-      continue;
-    }
-    const eqCols = new Set<number>();
-    for (const c of constraints) {
-      if (c.op === '=') {
-        eqCols.add(c.columnIndex);
-      }
-      // Single-value IN could be treated as equality
-      if (c.op === 'IN' && Array.isArray(c.value) && (c.value as unknown[]).length === 1) {
-        eqCols.add(c.columnIndex);
-      }
-    }
-    const covered: number[][] = [];
-    for (const key of tInfo.uniqueKeys) {
-      if (key.length === 0) {
-        // Zero-length key means at most one row; trivially covered
-        covered.push([]);
-        continue;
-      }
-      const allCovered = key.every(idx => eqCols.has(idx));
-      if (allCovered) covered.push([...key]);
-    }
-    coveredKeysByTable.set(rel, covered);
-  }
-
-  return {
-		constraintsByTable,
-		residualPredicate,
-    allConstraints,
-    supportedPredicateByTable,
-    coveredKeysByTable
-	};
-}
-
-/**
- * Recursively extract constraints from an expression
- */
-function extractFromExpression(
-	expr: ScalarPlanNode,
-	constraints: PredicateConstraint[],
-	residual: ScalarPlanNode[],
-  attributeToTableMap: Map<number, TableInfo>,
-  perTableParts: Map<string, ScalarPlanNode[]>
-): void {
-	// Handle AND expressions - recurse on both sides
-	if (isAndExpression(expr)) {
-		const binaryOp = expr as BinaryOpNode;
-    extractFromExpression(binaryOp.left, constraints, residual, attributeToTableMap, perTableParts);
-    extractFromExpression(binaryOp.right, constraints, residual, attributeToTableMap, perTableParts);
-		return;
-	}
-
-	// Handle OR expressions - for now, treat as residual (could be enhanced later)
-	if (isOrExpression(expr)) {
-		log('OR expression found, treating as residual: %s', expr.toString());
-		residual.push(expr);
-		return;
-	}
-
-  // BETWEEN → range constraints
-  if (expr.nodeType === PlanNodeType.Between) {
-    const c = extractBetweenConstraints(expr as BetweenNode, attributeToTableMap);
-    if (c) {
-      constraints.push(...c);
-      addSupportedPart(expr, attributeToTableMap, perTableParts);
-      return;
-    }
-  }
-
-  // IN list → IN constraint (literals only)
-  if (expr.nodeType === PlanNodeType.In) {
-    const c = extractInConstraint(expr as InNode, attributeToTableMap);
-    if (c) {
-      constraints.push(c);
-      addSupportedPart(expr, attributeToTableMap, perTableParts);
-      return;
-    }
-  }
-
-  // Try to extract constraint from binary comparison
-  const constraint = extractBinaryConstraint(expr, attributeToTableMap);
-	if (constraint) {
-		constraints.push(constraint);
-    addSupportedPart(expr, attributeToTableMap, perTableParts);
-		log('Extracted constraint: %s %s %s (table: %s)',
-			constraint.attributeId, constraint.op, constraint.value, constraint.targetRelation);
-	} else {
-		// Cannot convert to constraint - add to residual
-		log('Cannot extract constraint from expression, adding to residual: %s', expr.toString());
-		residual.push(expr);
-	}
-}
-
-function addSupportedPart(expr: ScalarPlanNode, attributeToTableMap: Map<number, TableInfo>, perTableParts: Map<string, ScalarPlanNode[]>): void {
-  // Determine target table by first column reference in expr; if absent, skip
-  const relKey = findTargetRelationKey(expr, attributeToTableMap);
-  if (!relKey) return;
-  if (!perTableParts.has(relKey)) perTableParts.set(relKey, []);
-  perTableParts.get(relKey)!.push(expr);
-}
-
-function findTargetRelationKey(expr: ScalarPlanNode, attributeToTableMap: Map<number, TableInfo>): string | undefined {
-  let found: string | undefined;
-  const stack: ScalarPlanNode[] = [expr];
-  while (stack.length) {
-    const n = stack.pop()!;
-    if (n.nodeType === PlanNodeType.ColumnReference) {
-      const attrId = (n as unknown as _ColumnRef).attributeId;
-      const info = attributeToTableMap.get(attrId);
-      if (info) return info.relationKey ?? info.relationName;
-    }
-    for (const c of n.getChildren()) {
-      // eslint-disable-next-line @typescript-eslint/no-explicit-any
-      stack.push(c as any);
-    }
-  }
-  return found;
-}
-
-function combineParts(parts: ScalarPlanNode[]): ScalarPlanNode | undefined {
-  if (parts.length === 0) return undefined;
-  if (parts.length === 1) return parts[0];
-  // Combine with AND
-  let acc = parts[0];
-  for (let i = 1; i < parts.length; i++) {
-    const right = parts[i];
-    const ast: AST.BinaryExpr = { type: 'binary', operator: 'AND', left: (acc as any).expression, right: (right as any).expression };
-    acc = new BinaryOpNode((acc as any).scope, ast, acc, right);
-  }
-  return acc;
-}
-
-/**
- * Extract constraint from binary comparison expression
- */
-function extractBinaryConstraint(
-	expr: ScalarPlanNode,
-	attributeToTableMap: Map<number, TableInfo>
-): PredicateConstraint | null {
-	// Must be a binary operation
-	if (expr.nodeType !== PlanNodeType.BinaryOp) {
-		return null;
-	}
-
-	const binaryOp = expr as BinaryOpNode;
-	const { left, right } = binaryOp;
-  const operator = binaryOp.expression.operator;
-
-	// Try column-constant pattern (column op constant)
-	let columnRef: ColumnReferenceNode | null = null;
-	let constant: SqlValue | undefined;
-  let finalOp: ConstraintOp | null = null;
-
-  if (isColumnReference(left) && (isLiteralConstant(right) || isDynamicValue(right))) {
-		columnRef = left;
-		if (isLiteralConstant(right)) {
-			constant = getLiteralValue(right);
-		}
-    finalOp = mapOperatorToConstraint(operator, constant);
-  } else if ((isLiteralConstant(left) || isDynamicValue(left)) && isColumnReference(right)) {
-		// Reverse pattern (constant op column) - flip operator
-		columnRef = right;
-		if (isLiteralConstant(left)) {
-			constant = getLiteralValue(left);
-		}
-    const baseOp = mapOperatorToConstraint(operator, constant);
-    finalOp = baseOp ? flipOperator(baseOp) : null;
-	}
-
-  if (!columnRef || !finalOp) {
-		log('No column-constant pattern found in binary expression');
-		return null;
-	}
-
-	// Map attribute ID to table and column index
-	const tableInfo = attributeToTableMap.get(columnRef.attributeId);
-	if (!tableInfo) {
-		log('No table mapping found for attribute ID %d', columnRef.attributeId);
-		return null;
-	}
-
-	const columnIndex = tableInfo.columnIndexMap.get(columnRef.attributeId);
-	if (columnIndex === undefined) {
-		log('No column index found for attribute ID %d', columnRef.attributeId);
-		return null;
-	}
-
-  const result: PredicateConstraint = {
-		columnIndex,
-		attributeId: columnRef.attributeId,
-		op: finalOp,
-		value: constant,
-		usable: true, // Usable since we found table mapping
-		sourceExpression: expr,
-		targetRelation: tableInfo.relationKey
-  };
-
-  // Attach dynamic binding metadata when RHS/LHS is not a literal
-  const rhs = (expr as BinaryOpNode).right;
-  const lhs = (expr as BinaryOpNode).left;
-  const nonLiteral = !isLiteralConstant(lhs) || !isLiteralConstant(rhs);
-  if (nonLiteral) {
-    // Determine which side is the value side
-    const valueSide = (columnRef === lhs ? rhs : lhs) as ScalarPlanNode;
-    if (!isLiteralConstant(valueSide)) {
-      result.valueExpr = valueSide;
-      if (valueSide.nodeType === PlanNodeType.ParameterReference) {
-        result.bindingKind = 'parameter';
-      } else if (valueSide.nodeType === PlanNodeType.ColumnReference) {
-        const rhsAttrId = (valueSide as unknown as ColumnReferenceNode).attributeId;
-        const sameTable = tableInfo.columnIndexMap.has(rhsAttrId);
-        result.bindingKind = sameTable ? 'expression' : 'correlated';
-      } else {
-        result.bindingKind = 'expression';
-      }
-    } else {
-      result.bindingKind = 'literal';
-    }
-  } else {
-    result.bindingKind = 'literal';
-  }
-
-  return result;
-}
-
-function extractBetweenConstraints(
-  expr: BetweenNode,
-  attributeToTableMap: Map<number, TableInfo>
-): PredicateConstraint[] | null {
-  // Only support column BETWEEN literal AND literal
-  const col = expr.expr;
-  const low = expr.lower;
-  const up = expr.upper;
-  const not = !!expr.expression.not;
-
-  if (col.nodeType !== PlanNodeType.ColumnReference) return null;
-  if (!isLiteralConstant(low) || !isLiteralConstant(up)) return null;
-
-  const columnRef = col as unknown as ColumnReferenceNode;
-  const tableInfo = attributeToTableMap.get(columnRef.attributeId);
-  if (!tableInfo) return null;
-  const columnIndex = tableInfo.columnIndexMap.get(columnRef.attributeId);
-  if (columnIndex === undefined) return null;
-
-  if (not) {
-    // NOT BETWEEN not expressible as single contiguous range; leave as residual
-    return null;
-  }
-
-  const lowVal = getLiteralValue(low);
-  const upVal = getLiteralValue(up);
-  return [
-    {
-      columnIndex,
-      attributeId: columnRef.attributeId,
-      op: '>=',
-      value: lowVal,
-      usable: true,
-      sourceExpression: expr,
-      targetRelation: tableInfo.relationKey
-    },
-    {
-      columnIndex,
-      attributeId: columnRef.attributeId,
-      op: '<=',
-      value: upVal,
-      usable: true,
-      sourceExpression: expr,
-      targetRelation: tableInfo.relationKey
-    }
-  ];
-}
-
-function extractInConstraint(
-  expr: InNode,
-  attributeToTableMap: Map<number, TableInfo>
-): PredicateConstraint | null {
-  // Only support column IN (literal, ...)
-  if (expr.source) return null;
-  if (!expr.values || expr.values.length === 0) return null;
-  const col = expr.condition;
-  if (col.nodeType !== PlanNodeType.ColumnReference) return null;
-
-  // Ensure all are literals
-  if (!expr.values.every(v => isLiteralConstant(v))) return null;
-
-  const columnRef = col as unknown as ColumnReferenceNode;
-  const tableInfo = attributeToTableMap.get(columnRef.attributeId);
-  if (!tableInfo) return null;
-  const columnIndex = tableInfo.columnIndexMap.get(columnRef.attributeId);
-  if (columnIndex === undefined) return null;
-
-  // Virtual table IN constraint can carry a single array value or multiple equality constraints.
-  // Our API supports op 'IN' with value array.
-  const values = expr.values.map(v => getLiteralValue(v));
-  return {
-    columnIndex,
-    attributeId: columnRef.attributeId,
-    op: 'IN',
-    // eslint-disable-next-line @typescript-eslint/no-explicit-any
-    value: values as any,
-    usable: true,
-    sourceExpression: expr,
-    targetRelation: tableInfo.relationKey
-  };
-}
-
-/**
- * Map AST operators to constraint operators
- */
-function mapOperatorToConstraint(operator: string, rightValue?: SqlValue): ConstraintOp | null {
-  switch (operator) {
-    case '=': return '=';
-    case '>': return '>';
-    case '>=': return '>=';
-    case '<': return '<';
-    case '<=': return '<=';
-    case 'LIKE': return 'LIKE';
-    case 'GLOB': return 'GLOB';
-    case 'MATCH': return 'MATCH';
-    case 'IN': return 'IN';
-    case 'NOT IN': return 'NOT IN';
-    case 'IS':
-      return rightValue === null ? 'IS NULL' : null;
-    case 'IS NOT':
-      return rightValue === null ? 'IS NOT NULL' : null;
-    default: return null;
-  }
-}
-
-/**
- * Check if expression is an AND operation
- */
-function isAndExpression(expr: ScalarPlanNode): boolean {
-	return expr.nodeType === PlanNodeType.BinaryOp &&
-		   (expr as BinaryOpNode).expression.operator === 'AND';
-}
-
-/**
- * Check if expression is an OR operation
- */
-function isOrExpression(expr: ScalarPlanNode): boolean {
-	return expr.nodeType === PlanNodeType.BinaryOp &&
-		   (expr as BinaryOpNode).expression.operator === 'OR';
-}
-
-/**
- * Check if node is a column reference
- */
-function isColumnReference(node: ScalarPlanNode): node is ColumnReferenceNode {
-	return CapabilityDetectors.isColumnReference(node);
-}
-
-/**
- * Check if node is a literal constant
- */
-function isLiteralConstant(node: ScalarPlanNode): node is LiteralNode {
-	return node.nodeType === PlanNodeType.Literal;
-}
-
-function isDynamicValue(node: ScalarPlanNode): boolean {
-  // Parameter or column reference from any table (correlation handled later)
-  return node.nodeType === PlanNodeType.ParameterReference || node.nodeType === PlanNodeType.ColumnReference;
-}
-
-/**
- * Get literal value from literal node
- */
-function getLiteralValue(node: ScalarPlanNode): SqlValue {
-	const literalNode = node as LiteralNode;
-	return getSyncLiteral(literalNode.expression);
-}
-
-/**
- * Flip comparison operator for reversed operand order
- */
-function flipOperator(op: ConstraintOp): ConstraintOp {
-	switch (op) {
-		case '<': return '>';
-		case '<=': return '>=';
-		case '>': return '<';
-		case '>=': return '<=';
-		case '=': return '=';
-		case 'LIKE': return 'LIKE'; // Not flippable
-		case 'GLOB': return 'GLOB'; // Not flippable
-		case 'MATCH': return 'MATCH'; // Not flippable
-		case 'IN': return 'IN'; // Not flippable in this context
-		case 'NOT IN': return 'NOT IN'; // Not flippable in this context
-		default: return op;
-	}
-}
-
-/**
- * Extract constraints for a specific table from a relational plan
- * Analyzes all Filter nodes and join conditions that reference the table
- */
-export function extractConstraintsForTable(
-	plan: RelationalPlanNode,
-	targetTableRelationKey: string
-): PredicateConstraint[] {
-	const constraints: PredicateConstraint[] = [];
-
-	// Walk the plan tree looking for filter predicates
-	walkPlanForPredicates(plan, (predicate, sourceNode) => {
-		// Create table info for the target table only
-		const tableInfos = createTableInfosFromPlan(plan).filter(
-			info => info.relationKey === targetTableRelationKey
-		);
-
-		if (tableInfos.length > 0) {
-			const result = extractConstraints(predicate, tableInfos);
-			const tableConstraints = result.constraintsByTable.get(targetTableRelationKey);
-			if (tableConstraints) {
-				constraints.push(...tableConstraints);
-				log('Found %d constraints for table %s from %s',
-					tableConstraints.length, targetTableRelationKey, sourceNode);
-			}
-		}
-	});
-
-	return constraints;
-}
-
-/**
- * Extract constraints and combined residual predicate for a specific table
- */
-export function extractConstraintsAndResidualForTable(
-    plan: RelationalPlanNode,
-    targetTableRelationKey: string
-): { constraints: PredicateConstraint[]; residualPredicate?: ScalarPlanNode } {
-    const constraints: PredicateConstraint[] = [];
-    const residuals: ScalarPlanNode[] = [];
-
-    walkPlanForPredicates(plan, (predicate) => {
-        const tableInfos = createTableInfosFromPlan(plan).filter(
-            info => info.relationKey === targetTableRelationKey
-        );
-        if (tableInfos.length === 0) return;
-        const result = extractConstraints(predicate, tableInfos);
-        const tableConstraints = result.constraintsByTable.get(targetTableRelationKey);
-        if (tableConstraints && tableConstraints.length) {
-            constraints.push(...tableConstraints);
-        }
-        if (result.residualPredicate) {
-            residuals.push(result.residualPredicate);
-        }
-    });
-
-    return { constraints, residualPredicate: combineResiduals(residuals) };
-}
-
-/**
- * Compute which unique keys are fully covered by equality constraints for a table within a plan.
- * Returns a list of covered keys (each key is a list of column indexes in the table output order).
- */
-export function extractCoveredKeysForTable(
-    plan: RelationalPlanNode,
-    targetTableRelationKey: string
-): number[][] {
-    const constraints: PredicateConstraint[] = extractConstraintsForTable(plan, targetTableRelationKey);
-    const tInfos = createTableInfosFromPlan(plan).filter(info => info.relationKey === targetTableRelationKey);
-    if (tInfos.length === 0) return [];
-    const uniqueKeys = tInfos[0].uniqueKeys ?? [];
-    return computeCoveredKeysForConstraints(constraints, uniqueKeys);
-}
-
-/**
- * Given a set of constraints and a table's unique keys, compute which keys are fully covered by equality.
- */
-export function computeCoveredKeysForConstraints(
-    constraints: readonly PredicateConstraint[],
-    tableUniqueKeys: readonly number[][]
-): number[][] {
-    const eqCols = new Set<number>();
-    for (const c of constraints) {
-        if (c.op === '=') {
-            eqCols.add(c.columnIndex);
-        }
-        if (c.op === 'IN' && Array.isArray(c.value) && (c.value as unknown[]).length === 1) {
-            eqCols.add(c.columnIndex);
-        }
-    }
-    const covered: number[][] = [];
-    for (const key of tableUniqueKeys) {
-        if (key.length === 0) {
-            covered.push([]);
-            continue;
-        }
-        const allCovered = key.every(idx => eqCols.has(idx));
-        if (allCovered) covered.push([...key]);
-    }
-    return covered;
-}
-
-/**
- * Analyze plan to classify each TableReference instance as 'row' (row-specific) or 'global'.
- * Row-specific means equality constraints fully cover at least one unique key at that reference.
- */
-export function analyzeRowSpecific(
-    plan: RelationalPlanNode | PlanNode
-): Map<string, 'row' | 'global'> {
-    const result = new Map<string, 'row' | 'global'>();
-    const infos = createTableInfosFromPlan(plan as RelationalPlanNode);
-    for (const info of infos) {
-        const covered = extractCoveredKeysForTable(plan as RelationalPlanNode, info.relationKey);
-        result.set(info.relationKey, covered.length > 0 ? 'row' : 'global');
-    }
-    return result;
-}
-
-function combineResiduals(predicates: ScalarPlanNode[]): ScalarPlanNode | undefined {
-    if (predicates.length === 0) return undefined;
-    if (predicates.length === 1) return predicates[0];
-    let acc = predicates[0];
-    for (let i = 1; i < predicates.length; i++) {
-        const right = predicates[i];
-        const ast: AST.BinaryExpr = { type: 'binary', operator: 'AND', left: (acc as any).expression, right: (right as any).expression };
-        acc = new BinaryOpNode((acc as any).scope, ast, acc, right);
-    }
-    return acc;
-}
-
-/**
- * Walk a plan tree and call callback for each predicate found
- */
-function walkPlanForPredicates(
-  plan: PlanNode,
-  callback: (predicate: ScalarPlanNode, sourceNode: string) => void
-): void {
-  if (!plan) return;
-  // If node exposes predicates via characteristic, collect them
-  if (CapabilityDetectors.isPredicateSource(plan as any)) {
-    // eslint-disable-next-line @typescript-eslint/no-explicit-any
-    const preds = (plan as any).getPredicates() as ReadonlyArray<ScalarPlanNode>;
-    for (const p of preds) {
-      callback(p, 'PredicateSource');
-    }
-  }
-
-  // Recurse into all children (scalar and relational)
-  for (const child of plan.getChildren()) {
-    walkPlanForPredicates(child as unknown as PlanNode, callback);
-  }
-}
-
-/**
- * Create table information from a relational plan
- */
-function createTableInfosFromPlan(plan: RelationalPlanNode | PlanNode): TableInfo[] {
-  const tableInfos: TableInfo[] = [];
-
-  const seen = new Set<string>();
-
-  function visitAny(node: PlanNode): void {
-    const id = (node as any).id ?? null;
-    if (id !== null) {
-      const k = String(id);
-      if (seen.has(k)) return;
-      seen.add(k);
-    }
-
-    if (node instanceof TableReferenceNode) {
-      const tr = node as unknown as { tableSchema: { schemaName: string; name: string } };
-      tableInfos.push(createTableInfoFromNode(node as unknown as RelationalPlanNode, `${tr.tableSchema.schemaName}.${tr.tableSchema.name}`));
-    }
-
-    for (const rel of node.getRelations()) {
-      visitAny(rel as unknown as PlanNode);
-    }
-
-    for (const child of node.getChildren()) {
-      visitAny(child as unknown as PlanNode);
-    }
-  }
-
-  visitAny(plan as unknown as PlanNode);
-  return tableInfos;
-}
-
-/**
- * Utility to create table info from a table reference node
- */
-export function createTableInfoFromNode(node: RelationalPlanNode, relationName?: string): TableInfo {
-	const attributes = node.getAttributes();
-	const columnIndexMap = new Map<number, number>();
-
-	// Map attribute IDs to column indices
-	attributes.forEach((attr, index) => {
-		columnIndexMap.set(attr.id, index);
-	});
-
-	// Extract logical unique keys from relation type, map ColRef[] to plain column indexes
-	const relType = (node as unknown as { getType: () => { keys: { index: number }[][] } }).getType();
-	const uniqueKeys: number[][] | undefined = Array.isArray(relType?.keys)
-		? relType.keys.map(key => key.map(ref => ref.index))
-		: undefined;
-
-	const relName = relationName || node.toString();
-	const relationKey = `${relName}#${(node as any).id ?? 'unknown'}`;
-
-	return {
-		relationName: relName,
-		relationKey,
-		attributes: attributes.map(attr => ({ id: attr.id, name: attr.name })),
-		columnIndexMap,
-		uniqueKeys
-	};
-}
-
-/**
- * Create a residual filter predicate from constraints that weren't handled
- * This allows creating a filter function that can be applied at runtime
- */
-export function createResidualFilter(
-	originalPredicate: ScalarPlanNode,
-	handledConstraints: PredicateConstraint[]
-): ((row: Row) => boolean) | undefined {
-	// If no constraints were handled, return undefined (original predicate still needed)
-	if (handledConstraints.length === 0) {
-		return undefined;
-	}
-
-	// TODO: Implement sophisticated residual filter construction
-	// This would need to:
-	// 1. Identify which parts of the original predicate were handled
-	// 2. Construct a new predicate with only the unhandled parts
-	// 3. Compile that predicate to a runtime function
-
-	log('Residual filter construction not yet implemented - using original predicate');
-	return undefined;
-}