@quereus/quereus 4.4.1 → 4.6.0

package/dist/src/planner/stats/catalog-stats.js

@@ -6,8 +6,19 @@
  */
 import { NaiveStatsProvider } from './index.js';
 import { createLogger } from '../../common/logger.js';
+import { catalogRowCount } from './table-cardinality.js';
 import { selectivityFromHistogram } from './histogram.js';
+import { combineConjunctive, combineDisjunctive } from './selectivity-combine.js';
+import { splitConjuncts, splitDisjuncts } from '../analysis/predicate-conjuncts.js';
 const log = createLogger('optimizer:stats:catalog');
+/**
+ * Guard against unbounded recursion through nested OR / NOT structures.
+ * (AND and OR levels are each flattened in one step, so this only bites on
+ * genuinely alternating boolean nesting.)
+ */
+const MAX_BOOLEAN_DEPTH = 16;
+const complete = (value) => ({ kind: 'complete', value });
+const lowerBound = (value) => ({ kind: 'lowerBound', value });
 // ── CatalogStatsProvider ────────────────────────────────────────────────
 /**
  * Statistics provider that reads cached TableStatistics from the schema catalog.
@@ -19,27 +30,51 @@ export class CatalogStatsProvider {
         this.fallback = fallback ?? new NaiveStatsProvider();
     }
     tableRows(table) {
-        const stats = table.statistics;
-        if (stats) {
-            log('Table %s: catalog rowCount=%d', table.name, stats.rowCount);
-            return stats.rowCount;
-        }
-        return this.fallback.tableRows(table);
+        const rows = catalogRowCount(table);
+        if (rows === undefined)
+            return this.fallback.tableRows(table);
+        log('Table %s: rowCount=%d (source: %s)', table.name, rows, table.statistics ? 'catalog' : 'schema');
+        return rows;
     }
-    selectivity(table, predicate) {
-        const stats = table.statistics;
-        if (!stats)
-            return this.fallback.selectivity(table, predicate);
-        const sel = this.estimatePredicateSelectivity(stats, predicate);
-        if (sel !== undefined) {
-            log('Predicate selectivity for %s on %s: %f (catalog)', predicate.nodeType, table.name, sel);
-            return sel;
+    selectivity(table, predicate, resolve) {
+        const estimate = this.estimate(table, predicate, resolve);
+        if (estimate?.kind === 'complete') {
+            log('Predicate selectivity for %s on %s: %f (catalog)', predicate.nodeType, table.name, estimate.value);
+            return estimate.value;
         }
-        return this.fallback.selectivity(table, predicate);
+        const naive = this.fallback.selectivity(table, predicate);
+        if (estimate === undefined)
+            return naive;
+        // A partly-known OR: keep the naive guess's caution, but never report below the
+        // floor the statistics already prove. Reporting the floor on its own would be
+        // wrong in the other direction — an unread branch may match far more rows than
+        // the branch that was read.
+        const lifted = naive === undefined ? estimate.value : Math.max(naive, estimate.value);
+        log('Predicate selectivity for %s on %s: %f (naive %o against catalog floor %f)', predicate.nodeType, table.name, lifted, naive, estimate.value);
+        return lifted;
+    }
+    /**
+     * The catalog half of {@link selectivity}: undefined rather than a naive guess
+     * when the table carries no statistics, or when the predicate's shape puts it out
+     * of reach of the ones it has —
+     *
+     * - the column is not a direct child of the comparison (`lower(cat) = 'x'` —
+     *   {@link extractColumnFromPredicate} looks one level down and finds none), or
+     * - the column was minted above the base table (a computed projection, an
+     *   aggregate or window output), which a caller-supplied
+     *   {@link ColumnStatsResolver} reports by resolving the attribute to nothing.
+     *
+     * A partly-known OR reads as undefined here: this method means "real statistics
+     * answered *the predicate*", and `rule-filter-selectivity` uses it as its
+     * does-this-relation-have-usable-statistics gate. A floor is not an answer.
+     */
+    statsOnlySelectivity(table, predicate, resolve) {
+        const estimate = this.estimate(table, predicate, resolve);
+        return estimate?.kind === 'complete' ? estimate.value : undefined;
     }
-    joinSelectivity(leftTable, rightTable, joinCondition) {
+    joinSelectivity(leftTable, rightTable, joinCondition, resolve) {
         // For equi-joins, use 1/max(ndv_left, ndv_right) if we can extract columns
-        const colNames = extractEquiJoinColumns(joinCondition);
+        const colNames = extractEquiJoinColumns(joinCondition, resolve);
         if (colNames) {
             // Check FK→PK: if one side has an FK referencing the other's PK,
             // use 1/ndv_pk for tighter selectivity
@@ -98,6 +133,13 @@ export class CatalogStatsProvider {
             return ndv;
         return this.fallback.distinctValues?.(table, columnName);
     }
+    /**
+     * NOTE: no {@link ColumnStatsResolver} is threaded here, so the delegated estimate
+     * matches columns by AST name. Nothing in the engine calls this today (only its own
+     * tests do), so nothing is wrong now — but the first production caller must widen
+     * this signature to take a resolver and pass it down, or it will silently get the
+     * name matching the selectivity family no longer uses.
+     */
     indexSelectivity(table, indexName, predicate) {
         // Delegate to base selectivity — real column stats already improve this
         const sel = this.selectivity(table, predicate);
@@ -110,17 +152,172 @@ export class CatalogStatsProvider {
         const colStats = table.statistics?.columnStats.get(columnName.toLowerCase());
         return colStats?.distinctCount;
     }
-    estimatePredicateSelectivity(stats, predicate) {
+    /**
+     * Entry point for predicate selectivity: no statistics at all, or the empty
+     * table, short-circuit; otherwise walk the predicate's boolean structure.
+     */
+    estimate(table, predicate, resolve) {
+        const stats = table.statistics;
+        if (!stats)
+            return undefined;
         if (stats.rowCount === 0)
-            return 0;
+            return complete(0);
+        return this.estimateNode({ stats, resolve }, predicate, 0);
+    }
+    /**
+     * Recurse over the boolean structure (AND / OR / NOT) of a predicate,
+     * delegating anything else to {@link estimateLeaf}.
+     *
+     * Returns undefined when nothing useful can be said, which lets `selectivity`
+     * fall through to the naive provider exactly as it did before this recursion
+     * existed.
+     */
+    estimateNode(ctx, node, depth) {
+        if (depth > MAX_BOOLEAN_DEPTH)
+            return undefined;
+        if (node.nodeType === 'BinaryOp') {
+            // Planner convention is uppercase 'AND' / 'OR' (see predicate-normalizer).
+            const op = node.expression.operator;
+            if (op === 'AND')
+                return this.estimateConjunction(ctx, node, depth);
+            if (op === 'OR')
+                return this.estimateDisjunction(ctx, node, depth);
+        }
+        if (node.nodeType === 'UnaryOp') {
+            // 'NOT' is boolean structure; the other unary operators ('IS NULL' etc.)
+            // are leaves and fall through to estimateLeaf below.
+            if (node.expression.operator === 'NOT') {
+                // Read the operand through getChildren() rather than `.operand`, matching
+                // how the rest of this file introspects nodes structurally.
+                const operand = node.getChildren()[0];
+                if (!operand)
+                    return undefined;
+                const inner = this.estimateNode(ctx, operand, depth + 1);
+                // A lower bound negates into an UPPER bound, which nothing downstream
+                // models, so a partly-known operand makes the negation unknown.
+                if (inner?.kind !== 'complete')
+                    return undefined;
+                // NOTE: estimateConjunction's "unknown conjunct counts as 1.0" makes an AND
+                // estimate an UPPER bound, and negating flips that into a LOWER bound — so
+                // `not (a = 1 and lower(s) = 'x')` errs low where the AND path claims to err
+                // high. Bounded (the true value is between this and 1) and the direction only
+                // inverts under an explicit NOT, which the planner rarely leaves standing. If
+                // negated mixed-knowledge predicates ever drive a bad plan, widen `Estimate`
+                // to carry an upper-bound kind as well.
+                return complete(1 - inner.value);
+            }
+        }
+        return this.leafEstimate(ctx, node);
+    }
+    /** {@link estimateLeaf} lifted into the {@link Estimate} vocabulary. */
+    leafEstimate(ctx, node) {
+        const sel = this.estimateLeaf(ctx, node);
+        return sel === undefined ? undefined : complete(sel);
+    }
+    /**
+     * AND: estimate each conjunct and combine the ones we could estimate.
+     *
+     * An unestimable conjunct is treated as selectivity 1.0 (claim no reduction)
+     * rather than handed to NaiveStatsProvider's flat 0.1. That number is
+     * fabricated, and multiplying it in biases the whole estimate downward;
+     * over-estimating surviving rows is the safer error direction for plan choice.
+     * Concretely `a = 1 and lower(b) = 'x'` now estimates 1/ndv(a) where it used to
+     * estimate 0.1 — a deliberate change, not a regression.
+     *
+     * If *every* conjunct is unknown we return undefined so the whole-predicate
+     * naive fallback in `selectivity()` still runs.
+     *
+     * A conjunct that only produced a lower bound (a partly-known OR) counts as
+     * unknown here for the same reason: folding a floor into the product would drag
+     * the result down, and AND deliberately errs high.
+     */
+    estimateConjunction(ctx, node, depth) {
+        const conjuncts = splitConjuncts(node);
+        // splitConjuncts only descends through real BinaryOpNode instances; if it
+        // handed back the node itself there is nothing to decompose.
+        if (conjuncts.length === 1 && conjuncts[0] === node)
+            return this.leafEstimate(ctx, node);
+        const known = [];
+        for (const conjunct of conjuncts) {
+            const est = this.estimateNode(ctx, conjunct, depth + 1);
+            if (est?.kind === 'complete')
+                known.push(est.value);
+        }
+        if (known.length === 0)
+            return undefined;
+        // NOTE: conjuncts on the *same* column (`a > 1 and a < 10`) are strongly
+        // anti-correlated and are not paired into a single range here. Exponential
+        // backoff damps the error (0.333 · √0.333 ≈ 0.19 instead of 0.11) but does
+        // not remove it; same-column range pairing would.
+        return complete(this.floorCombined(ctx.stats, combineConjunctive(known), known.length));
+    }
+    /**
+     * OR: estimate every disjunct; combine them when all were readable, otherwise
+     * report what was proved as a lower bound.
+     *
+     * Unlike AND there is no safe default for an unknown disjunct — assuming 1.0
+     * would make the whole disjunction 1.0 (safe but useless), and assuming 0 would
+     * silently drop a branch that may match everything. But giving up outright
+     * discards a bound already in hand: `a or b` keeps at least as many rows as `a`,
+     * so the most permissive branch that COULD be read floors the whole disjunction.
+     * That floor travels out as a `lowerBound`, which `selectivity` uses to lift the
+     * naive guess (see there) and `statsOnlySelectivity` still reports as unknown.
+     *
+     * The floor is the max of the readable branches, NOT their disjunctive
+     * combination: `1 - Π(1 - sᵢ)` assumes the branches are independent, which is an
+     * estimate rather than a proof — if one readable branch subsumes another the true
+     * value is only the max.
+     */
+    estimateDisjunction(ctx, node, depth) {
+        const disjuncts = splitDisjuncts(node);
+        // See estimateConjunction: nothing to decompose when the walk is a no-op.
+        if (disjuncts.length === 1 && disjuncts[0] === node)
+            return this.leafEstimate(ctx, node);
+        const sels = [];
+        let anyUnreadable = false;
+        for (const disjunct of disjuncts) {
+            const est = this.estimateNode(ctx, disjunct, depth + 1);
+            if (est === undefined) {
+                anyUnreadable = true;
+                continue;
+            }
+            // A branch's own lower bound is still a lower bound on the disjunction.
+            // NOTE: unreachable today — splitDisjuncts flattens nested ORs, and no other
+            // node kind produces a lowerBound, so no disjunct can carry one. Kept because
+            // it is the correct handling the moment another kind does.
+            if (est.kind === 'lowerBound')
+                anyUnreadable = true;
+            sels.push(est.value);
+        }
+        if (sels.length === 0)
+            return undefined;
+        if (anyUnreadable)
+            return lowerBound(Math.max(...sels));
+        return complete(this.floorCombined(ctx.stats, combineDisjunctive(sels), sels.length));
+    }
+    /**
+     * Never claim fewer than one surviving row once two or more selectivities were
+     * actually combined. Deliberately not applied to a single leaf estimate:
+     * `IS NULL` on a column with nullCount 0 legitimately returns 0 today, and
+     * `FilterNode.estimatedRows` already floors the row count at 1.
+     */
+    floorCombined(stats, sel, combinedCount) {
+        if (combinedCount < 2)
+            return sel;
+        // rowCount === 0 short-circuits in estimatePredicateSelectivity, so the
+        // max() here only guards against a negative / absent count.
+        return Math.max(sel, 1 / Math.max(stats.rowCount, 1));
+    }
+    /** Estimate a single (non-boolean) comparison against column statistics. */
+    estimateLeaf(ctx, predicate) {
         // Try to extract column reference from the predicate for column-level estimation
-        const colInfo = extractColumnFromPredicate(predicate);
+        const colInfo = extractColumnFromPredicate(predicate, ctx.resolve);
         if (!colInfo)
             return undefined;
-        const colStats = stats.columnStats.get(colInfo.columnName.toLowerCase());
+        const colStats = ctx.stats.columnStats.get(colInfo.columnName.toLowerCase());
         if (!colStats)
             return undefined;
-        const { rowCount } = stats;
+        const { rowCount } = ctx.stats;
         switch (predicate.nodeType) {
             case 'BinaryOp': {
                 const op = predicate.expression.operator;
@@ -190,12 +387,27 @@ export class CatalogStatsProvider {
 // ── Predicate introspection helpers ─────────────────────────────────────
 // These extract structural info from plan nodes using typed imports of the
 // concrete node classes (BinaryOpNode, UnaryOpNode, etc.).
-function extractColumnFromPredicate(predicate) {
+function extractColumnFromPredicate(predicate, resolve) {
     // BinaryOp, In, Between, UnaryOp all typically have a column child
+    // NOTE: for a column-vs-column comparison on one table (`where x = y`) this
+    // picks the first ColumnReference and the caller finds no literal, so `=`
+    // yields 1/ndv(x) — wrong, since it models "x equals a constant" rather than
+    // "x equals another varying column". Pre-existing; fixing it needs a real
+    // two-sided comparison classifier.
     const children = predicate.getChildren();
     for (const child of children) {
         if (child.nodeType === 'ColumnReference') {
-            const name = child.expression.name;
+            const col = child;
+            if (resolve) {
+                // Identity path: an attribute minted above the base table resolves to
+                // nothing, and the estimate declines rather than borrowing whichever base
+                // column happens to share its AST name. Note this returns outright instead
+                // of trying the next child — "the compared column has no statistics" is the
+                // answer, not a reason to read the other operand.
+                const resolved = resolve(col.attributeId);
+                return resolved === undefined ? undefined : { columnName: resolved };
+            }
+            const name = col.expression.name;
             if (name)
                 return { columnName: name };
         }
@@ -219,7 +431,10 @@ function extractInListSize(predicate) {
     const node = predicate;
     if (Array.isArray(node.values))
         return node.values.length;
-    // Some IN nodes store the list in children after the first (column) child
+    // Some IN nodes store the list in children after the first (column) child.
+    // NOTE: `x in (select …)` has no value list, so this falls to children.length-1
+    // === 1 and the caller reports 1/ndv — the estimate for a single equality
+    // rather than for the subquery's real cardinality. Pre-existing.
     const children = predicate.getChildren();
     if (children.length > 1)
         return children.length - 1;
@@ -241,7 +456,7 @@ function extractBetweenBounds(predicate) {
     }
     return undefined;
 }
-function extractEquiJoinColumns(condition) {
+function extractEquiJoinColumns(condition, resolve) {
     if (condition.nodeType !== 'BinaryOp')
         return undefined;
     const op = condition.expression.operator;
@@ -254,10 +469,17 @@ function extractEquiJoinColumns(condition) {
     const right = children[1];
     if (left.nodeType !== 'ColumnReference' || right.nodeType !== 'ColumnReference')
         return undefined;
-    const leftName = left.expression.name;
-    const rightName = right.expression.name;
+    const leftName = columnStatsName(left, resolve);
+    const rightName = columnStatsName(right, resolve);
     if (!leftName || !rightName)
         return undefined;
     return { left: leftName, right: rightName };
 }
+/**
+ * The base-table column a reference's statistics live under: by attribute identity
+ * when a resolver is available, otherwise by the name in the AST.
+ */
+function columnStatsName(col, resolve) {
+    return resolve ? resolve(col.attributeId) : col.expression.name;
+}
 //# sourceMappingURL=catalog-stats.js.map

package/dist/src/planner/stats/catalog-stats.js.map

@@ -1 +1 @@
-{"version":3,"file":"catalog-stats.js","sourceRoot":"","sources":["../../../../src/planner/stats/catalog-stats.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAMH,OAAO,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,wBAAwB,EAAE,MAAM,gBAAgB,CAAC;AAK1D,MAAM,GAAG,GAAG,YAAY,CAAC,yBAAyB,CAAC,CAAC;AAsDpD,2EAA2E;AAE3E;;;GAGG;AACH,MAAM,OAAO,oBAAoB;IACf,QAAQ,CAAqB;IAE9C,YAAY,QAA6B;QACxC,IAAI,CAAC,QAAQ,GAAG,QAAQ,IAAI,IAAI,kBAAkB,EAAE,CAAC;IACtD,CAAC;IAED,SAAS,CAAC,KAAkB;QAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,UAAU,CAAC;QAC/B,IAAI,KAAK,EAAE,CAAC;YACX,GAAG,CAAC,+BAA+B,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;YACjE,OAAO,KAAK,CAAC,QAAQ,CAAC;QACvB,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IACvC,CAAC;IAED,WAAW,CAAC,KAAkB,EAAE,SAAyB;QACxD,MAAM,KAAK,GAAG,KAAK,CAAC,UAAU,CAAC;QAC/B,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAE/D,MAAM,GAAG,GAAG,IAAI,CAAC,4BAA4B,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAChE,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACvB,GAAG,CAAC,kDAAkD,EAAE,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC7F,OAAO,GAAG,CAAC;QACZ,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACpD,CAAC;IAED,eAAe,CAAC,SAAsB,EAAE,UAAuB,EAAE,aAA6B;QAC7F,2EAA2E;QAC3E,MAAM,QAAQ,GAAG,sBAAsB,CAAC,aAAa,CAAC,CAAC;QACvD,IAAI,QAAQ,EAAE,CAAC;YACd,iEAAiE;YACjE,uCAAuC;YACvC,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,UAAU,EAAE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;YACzF,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACzB,GAAG,CAAC,oCAAoC,EAAE,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;gBAClF,OAAO,KAAK,CAAC;YACd,CAAC;YAED,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC3D,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC9D,IAAI,OAAO,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBACrD,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;gBAC/C,GAAG,CAAC,oDAAoD,EACvD,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;gBAC1D,OAAO,GAAG,CAAC;YACZ,CAAC;QACF,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,CAAC,eAAe,EAAE,CAAC,SAAS,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC;IAC9E,CAAC;IAED;;;OAGG;IACK,eAAe,CACtB,SAAsB,EAAE,UAAuB,EAC/C,WAAmB,EAAE,YAAoB;QAEzC,4BAA4B;QAC5B,IAAI,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,WAAW,EAAE,UAAU,CAAC,EAAE,CAAC;YACzD,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;YAC7C,IAAI,KAAK,KAAK,SAAS;gBAAE,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACxD,CAAC;QACD,4BAA4B;QAC5B,IAAI,IAAI,CAAC,UAAU,CAAC,UAAU,EAAE,YAAY,EAAE,SAAS,CAAC,EAAE,CAAC;YAC1D,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YAC5C,IAAI,KAAK,KAAK,SAAS;gBAAE,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACxD,CAAC;QACD,OAAO,SAAS,CAAC;IAClB,CAAC;IAEO,UAAU,CAAC,KAAkB,EAAE,OAAe,EAAE,eAA4B;QACnF,IAAI,CAAC,KAAK,CAAC,WAAW;YAAE,OAAO,KAAK,CAAC;QACrC,MAAM,MAAM,GAAG,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC;QAC/D,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACvC,OAAO,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAClC,EAAE,CAAC,eAAe,CAAC,WAAW,EAAE,KAAK,eAAe,CAAC,IAAI,CAAC,WAAW,EAAE;YACvE,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CAC3B,CAAC;IACH,CAAC;IAEO,aAAa,CAAC,KAAkB;QACvC,IAAI,KAAK,CAAC,oBAAoB,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC9D,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACjE,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC;IAED,cAAc,CAAC,KAAkB,EAAE,UAAkB;QACpD,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QAChD,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,GAAG,CAAC;QAClC,OAAO,IAAI,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;IAC1D,CAAC;IAED,gBAAgB,CAAC,KAAkB,EAAE,SAAiB,EAAE,SAAyB;QAChF,wEAAwE;QACxE,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAC/C,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,GAAG,CAAC;QAClC,OAAO,IAAI,CAAC,QAAQ,CAAC,gBAAgB,EAAE,CAAC,KAAK,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;IACtE,CAAC;IAED,qEAAqE;IAE7D,WAAW,CAAC,KAAkB,EAAE,UAAkB;QACzD,MAAM,QAAQ,GAAG,KAAK,CAAC,UAAU,EAAE,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC;QAC7E,OAAO,QAAQ,EAAE,aAAa,CAAC;IAChC,CAAC;IAEO,4BAA4B,CACnC,KAAsB,EACtB,SAAyB;QAEzB,IAAI,KAAK,CAAC,QAAQ,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAEnC,iFAAiF;QACjF,MAAM,OAAO,GAAG,0BAA0B,CAAC,SAAS,CAAC,CAAC;QACtD,IAAI,CAAC,OAAO;YAAE,OAAO,SAAS,CAAC;QAE/B,MAAM,QAAQ,GAAG,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC;QACzE,IAAI,CAAC,QAAQ;YAAE,OAAO,SAAS,CAAC;QAEhC,MAAM,EAAE,QAAQ,EAAE,GAAG,KAAK,CAAC;QAE3B,QAAQ,SAAS,CAAC,QAAQ,EAAE,CAAC;YAC5B,KAAK,UAAU,CAAC,CAAC,CAAC;gBACjB,MAAM,EAAE,GAAI,SAAqC,CAAC,UAAU,CAAC,QAAQ,CAAC;gBACtE,IAAI,CAAC,EAAE;oBAAE,OAAO,SAAS,CAAC;gBAE1B,kBAAkB;gBAClB,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;oBAC/B,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;gBAChD,CAAC;gBAED,uBAAuB;gBACvB,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;oBAChC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,CAAC;gBACtD,CAAC;gBAED,uEAAuE;gBACvE,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;oBAC5D,IAAI,QAAQ,CAAC,SAAS,EAAE,CAAC;wBACxB,MAAM,KAAK,GAAG,oBAAoB,CAAC,SAAS,CAAC,CAAC;wBAC9C,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;4BACzB,OAAO,wBAAwB,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;wBAC1E,CAAC;oBACF,CAAC;oBACD,+CAA+C;oBAC/C,OAAO,CAAC,GAAG,CAAC,CAAC;gBACd,CAAC;gBAED,+CAA+C;gBAC/C,IAAI,EAAE,KAAK,MAAM,EAAE,CAAC;oBACnB,OAAO,CAAC,GAAG,CAAC,CAAC;gBACd,CAAC;gBAED,OAAO,SAAS,CAAC;YAClB,CAAC;YAED,KAAK,SAAS,CAAC,CAAC,CAAC;gBAChB,MAAM,EAAE,GAAI,SAAoC,CAAC,UAAU,CAAC,QAAQ,CAAC;gBACrE,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;oBACtB,OAAO,QAAQ,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;gBACnD,CAAC;gBACD,IAAI,EAAE,KAAK,aAAa,EAAE,CAAC;oBAC1B,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC;gBACzD,CAAC;gBACD,OAAO,SAAS,CAAC;YAClB,CAAC;YAED,KAAK,IAAI,CAAC,CAAC,CAAC;gBACX,0BAA0B;gBAC1B,MAAM,QAAQ,GAAG,iBAAiB,CAAC,SAAS,CAAC,CAAC;gBAC9C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;oBAC5B,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,CAAC;gBACtE,CAAC;gBACD,OAAO,SAAS,CAAC;YAClB,CAAC;YAED,KAAK,SAAS,CAAC,CAAC,CAAC;gBAChB,IAAI,QAAQ,CAAC,SAAS,EAAE,CAAC;oBACxB,MAAM,MAAM,GAAG,oBAAoB,CAAC,SAAS,CAAC,CAAC;oBAC/C,IAAI,MAAM,EAAE,CAAC;wBACZ,MAAM,MAAM,GAAG,wBAAwB,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,EAAE,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;wBACxF,MAAM,OAAO,GAAG,wBAAwB,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;wBAC1F,IAAI,MAAM,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;4BACnD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC;wBAC1C,CAAC;oBACF,CAAC;gBACF,CAAC;gBACD,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,qBAAqB;YACpC,CAAC;YAED;gBACC,OAAO,SAAS,CAAC;QACnB,CAAC;IACF,CAAC;CACD;AAED,2EAA2E;AAC3E,2EAA2E;AAC3E,2DAA2D;AAE3D,SAAS,0BAA0B,CAAC,SAAyB;IAC5D,mEAAmE;IACnE,MAAM,QAAQ,GAAG,SAAS,CAAC,WAAW,EAAE,CAAC;IACzC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC9B,IAAI,KAAK,CAAC,QAAQ,KAAK,iBAAiB,EAAE,CAAC;YAC1C,MAAM,IAAI,GAAI,KAAwC,CAAC,UAAU,CAAC,IAAI,CAAC;YACvE,IAAI,IAAI;gBAAE,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;QACvC,CAAC;IACF,CAAC;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,SAAS,oBAAoB,CAAC,SAAyB;IACtD,MAAM,QAAQ,GAAG,SAAS,CAAC,WAAW,EAAE,CAAC;IACzC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC9B,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAClC,MAAM,GAAG,GAAI,KAAgC,CAAC,UAAU,CAAC,KAAK,CAAC;YAC/D,wDAAwD;YACxD,IAAI,GAAG,YAAY,OAAO;gBAAE,OAAO,SAAS,CAAC;YAC7C,OAAO,GAAG,CAAC;QACZ,CAAC;IACF,CAAC;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,SAAS,iBAAiB,CAAC,SAAyB;IACnD,MAAM,IAAI,GAAG,SAA8B,CAAC;IAC5C,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;QAAE,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC1D,0EAA0E;IAC1E,MAAM,QAAQ,GAAG,SAAS,CAAC,WAAW,EAAE,CAAC;IACzC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IACpD,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,SAAS,oBAAoB,CAAC,SAAyB;IACtD,MAAM,IAAI,GAAG,SAAmC,CAAC;IACjD,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC7F,MAAM,MAAM,GAAI,IAAI,CAAC,KAAgC,CAAC,UAAU,CAAC,KAAK,CAAC;QACvE,MAAM,OAAO,GAAI,IAAI,CAAC,KAAgC,CAAC,UAAU,CAAC,KAAK,CAAC;QACxE,wDAAwD;QACxD,IAAI,MAAM,YAAY,OAAO,IAAI,OAAO,YAAY,OAAO;YAAE,OAAO,SAAS,CAAC;QAC9E,IAAI,MAAM,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YACnD,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;QACvC,CAAC;IACF,CAAC;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,SAAS,sBAAsB,CAAC,SAAyB;IACxD,IAAI,SAAS,CAAC,QAAQ,KAAK,UAAU;QAAE,OAAO,SAAS,CAAC;IACxD,MAAM,EAAE,GAAI,SAAqC,CAAC,UAAU,CAAC,QAAQ,CAAC;IACtE,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC;IAEhD,MAAM,QAAQ,GAAG,SAAS,CAAC,WAAW,EAAE,CAAC;IACzC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAE5C,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC1B,IAAI,IAAI,CAAC,QAAQ,KAAK,iBAAiB,IAAI,KAAK,CAAC,QAAQ,KAAK,iBAAiB;QAAE,OAAO,SAAS,CAAC;IAElG,MAAM,QAAQ,GAAI,IAAuC,CAAC,UAAU,CAAC,IAAI,CAAC;IAC1E,MAAM,SAAS,GAAI,KAAwC,CAAC,UAAU,CAAC,IAAI,CAAC;IAC5E,IAAI,CAAC,QAAQ,IAAI,CAAC,SAAS;QAAE,OAAO,SAAS,CAAC;IAE9C,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;AAC7C,CAAC"}
+{"version":3,"file":"catalog-stats.js","sourceRoot":"","sources":["../../../../src/planner/stats/catalog-stats.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAMH,OAAO,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AACzD,OAAO,EAAE,wBAAwB,EAAE,MAAM,gBAAgB,CAAC;AAC1D,OAAO,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,0BAA0B,CAAC;AAClF,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,oCAAoC,CAAC;AAKpF,MAAM,GAAG,GAAG,YAAY,CAAC,yBAAyB,CAAC,CAAC;AAEpD;;;;GAIG;AACH,MAAM,iBAAiB,GAAG,EAAE,CAAC;AA0B7B,MAAM,QAAQ,GAAG,CAAC,KAAa,EAAY,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;AAC5E,MAAM,UAAU,GAAG,CAAC,KAAa,EAAY,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,CAAC,CAAC;AAkEhF,2EAA2E;AAE3E;;;GAGG;AACH,MAAM,OAAO,oBAAoB;IACf,QAAQ,CAAqB;IAE9C,YAAY,QAA6B;QACxC,IAAI,CAAC,QAAQ,GAAG,QAAQ,IAAI,IAAI,kBAAkB,EAAE,CAAC;IACtD,CAAC;IAED,SAAS,CAAC,KAAkB;QAC3B,MAAM,IAAI,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC9D,GAAG,CAAC,oCAAoC,EAAE,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QACrG,OAAO,IAAI,CAAC;IACb,CAAC;IAED,WAAW,CAAC,KAAkB,EAAE,SAAyB,EAAE,OAA6B;QACvF,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QAC1D,IAAI,QAAQ,EAAE,IAAI,KAAK,UAAU,EAAE,CAAC;YACnC,GAAG,CAAC,kDAAkD,EAAE,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;YACxG,OAAO,QAAQ,CAAC,KAAK,CAAC;QACvB,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAC1D,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QAEzC,gFAAgF;QAChF,8EAA8E;QAC9E,+EAA+E;QAC/E,4BAA4B;QAC5B,MAAM,MAAM,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;QACtF,GAAG,CAAC,4EAA4E,EAC/E,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;QAChE,OAAO,MAAM,CAAC;IACf,CAAC;IAED;;;;;;;;;;;;;;OAcG;IACH,oBAAoB,CAAC,KAAkB,EAAE,SAAyB,EAAE,OAA6B;QAChG,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QAC1D,OAAO,QAAQ,EAAE,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;IACnE,CAAC;IAED,eAAe,CACd,SAAsB,EACtB,UAAuB,EACvB,aAA6B,EAC7B,OAA6B;QAE7B,2EAA2E;QAC3E,MAAM,QAAQ,GAAG,sBAAsB,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;QAChE,IAAI,QAAQ,EAAE,CAAC;YACd,iEAAiE;YACjE,uCAAuC;YACvC,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,UAAU,EAAE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;YACzF,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACzB,GAAG,CAAC,oCAAoC,EAAE,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;gBAClF,OAAO,KAAK,CAAC;YACd,CAAC;YAED,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC3D,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC9D,IAAI,OAAO,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBACrD,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;gBAC/C,GAAG,CAAC,oDAAoD,EACvD,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;gBAC1D,OAAO,GAAG,CAAC;YACZ,CAAC;QACF,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,CAAC,eAAe,EAAE,CAAC,SAAS,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC;IAC9E,CAAC;IAED;;;OAGG;IACK,eAAe,CACtB,SAAsB,EAAE,UAAuB,EAC/C,WAAmB,EAAE,YAAoB;QAEzC,4BAA4B;QAC5B,IAAI,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,WAAW,EAAE,UAAU,CAAC,EAAE,CAAC;YACzD,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;YAC7C,IAAI,KAAK,KAAK,SAAS;gBAAE,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACxD,CAAC;QACD,4BAA4B;QAC5B,IAAI,IAAI,CAAC,UAAU,CAAC,UAAU,EAAE,YAAY,EAAE,SAAS,CAAC,EAAE,CAAC;YAC1D,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YAC5C,IAAI,KAAK,KAAK,SAAS;gBAAE,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACxD,CAAC;QACD,OAAO,SAAS,CAAC;IAClB,CAAC;IAEO,UAAU,CAAC,KAAkB,EAAE,OAAe,EAAE,eAA4B;QACnF,IAAI,CAAC,KAAK,CAAC,WAAW;YAAE,OAAO,KAAK,CAAC;QACrC,MAAM,MAAM,GAAG,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC;QAC/D,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACvC,OAAO,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAClC,EAAE,CAAC,eAAe,CAAC,WAAW,EAAE,KAAK,eAAe,CAAC,IAAI,CAAC,WAAW,EAAE;YACvE,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CAC3B,CAAC;IACH,CAAC;IAEO,aAAa,CAAC,KAAkB;QACvC,IAAI,KAAK,CAAC,oBAAoB,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC9D,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACjE,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC;IAED,cAAc,CAAC,KAAkB,EAAE,UAAkB;QACpD,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QAChD,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,GAAG,CAAC;QAClC,OAAO,IAAI,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;IAC1D,CAAC;IAED;;;;;;OAMG;IACH,gBAAgB,CAAC,KAAkB,EAAE,SAAiB,EAAE,SAAyB;QAChF,wEAAwE;QACxE,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAC/C,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,GAAG,CAAC;QAClC,OAAO,IAAI,CAAC,QAAQ,CAAC,gBAAgB,EAAE,CAAC,KAAK,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;IACtE,CAAC;IAED,qEAAqE;IAE7D,WAAW,CAAC,KAAkB,EAAE,UAAkB;QACzD,MAAM,QAAQ,GAAG,KAAK,CAAC,UAAU,EAAE,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC;QAC7E,OAAO,QAAQ,EAAE,aAAa,CAAC;IAChC,CAAC;IAED;;;OAGG;IACK,QAAQ,CACf,KAAkB,EAClB,SAAyB,EACzB,OAA6B;QAE7B,MAAM,KAAK,GAAG,KAAK,CAAC,UAAU,CAAC;QAC/B,IAAI,CAAC,KAAK;YAAE,OAAO,SAAS,CAAC;QAC7B,IAAI,KAAK,CAAC,QAAQ,KAAK,CAAC;YAAE,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC,YAAY,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED;;;;;;;OAOG;IACK,YAAY,CACnB,GAAoB,EACpB,IAAoB,EACpB,KAAa;QAEb,IAAI,KAAK,GAAG,iBAAiB;YAAE,OAAO,SAAS,CAAC;QAEhD,IAAI,IAAI,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;YAClC,2EAA2E;YAC3E,MAAM,EAAE,GAAI,IAAgC,CAAC,UAAU,CAAC,QAAQ,CAAC;YACjE,IAAI,EAAE,KAAK,KAAK;gBAAE,OAAO,IAAI,CAAC,mBAAmB,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YACpE,IAAI,EAAE,KAAK,IAAI;gBAAE,OAAO,IAAI,CAAC,mBAAmB,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QACpE,CAAC;QAED,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YACjC,yEAAyE;YACzE,qDAAqD;YACrD,IAAK,IAA+B,CAAC,UAAU,CAAC,QAAQ,KAAK,KAAK,EAAE,CAAC;gBACpE,0EAA0E;gBAC1E,4DAA4D;gBAC5D,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAA+B,CAAC;gBACpE,IAAI,CAAC,OAAO;oBAAE,OAAO,SAAS,CAAC;gBAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBACzD,sEAAsE;gBACtE,gEAAgE;gBAChE,IAAI,KAAK,EAAE,IAAI,KAAK,UAAU;oBAAE,OAAO,SAAS,CAAC;gBACjD,4EAA4E;gBAC5E,2EAA2E;gBAC3E,6EAA6E;gBAC7E,8EAA8E;gBAC9E,8EAA8E;gBAC9E,6EAA6E;gBAC7E,wCAAwC;gBACxC,OAAO,QAAQ,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;YAClC,CAAC;QACF,CAAC;QAED,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IACrC,CAAC;IAED,wEAAwE;IAChE,YAAY,CAAC,GAAoB,EAAE,IAAoB;QAC9D,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACzC,OAAO,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IACtD,CAAC;IAED;;;;;;;;;;;;;;;;OAgBG;IACK,mBAAmB,CAC1B,GAAoB,EACpB,IAAoB,EACpB,KAAa;QAEb,MAAM,SAAS,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;QACvC,0EAA0E;QAC1E,6DAA6D;QAC7D,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAEzF,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YAClC,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YACxD,IAAI,GAAG,EAAE,IAAI,KAAK,UAAU;gBAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACrD,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAEzC,yEAAyE;QACzE,2EAA2E;QAC3E,2EAA2E;QAC3E,kDAAkD;QAClD,OAAO,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,kBAAkB,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IACzF,CAAC;IAED;;;;;;;;;;;;;;;;OAgBG;IACK,mBAAmB,CAC1B,GAAoB,EACpB,IAAoB,EACpB,KAAa;QAEb,MAAM,SAAS,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;QACvC,0EAA0E;QAC1E,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAEzF,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,IAAI,aAAa,GAAG,KAAK,CAAC;QAC1B,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YAClC,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YACxD,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBACvB,aAAa,GAAG,IAAI,CAAC;gBACrB,SAAS;YACV,CAAC;YACD,wEAAwE;YACxE,6EAA6E;YAC7E,8EAA8E;YAC9E,2DAA2D;YAC3D,IAAI,GAAG,CAAC,IAAI,KAAK,YAAY;gBAAE,aAAa,GAAG,IAAI,CAAC;YACpD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAExC,IAAI,aAAa;YAAE,OAAO,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QAExD,OAAO,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,kBAAkB,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACvF,CAAC;IAED;;;;;OAKG;IACK,aAAa,CAAC,KAAsB,EAAE,GAAW,EAAE,aAAqB;QAC/E,IAAI,aAAa,GAAG,CAAC;YAAE,OAAO,GAAG,CAAC;QAClC,wEAAwE;QACxE,4DAA4D;QAC5D,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,4EAA4E;IACpE,YAAY,CACnB,GAAoB,EACpB,SAAyB;QAEzB,iFAAiF;QACjF,MAAM,OAAO,GAAG,0BAA0B,CAAC,SAAS,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;QACnE,IAAI,CAAC,OAAO;YAAE,OAAO,SAAS,CAAC;QAE/B,MAAM,QAAQ,GAAG,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC;QAC7E,IAAI,CAAC,QAAQ;YAAE,OAAO,SAAS,CAAC;QAEhC,MAAM,EAAE,QAAQ,EAAE,GAAG,GAAG,CAAC,KAAK,CAAC;QAE/B,QAAQ,SAAS,CAAC,QAAQ,EAAE,CAAC;YAC5B,KAAK,UAAU,CAAC,CAAC,CAAC;gBACjB,MAAM,EAAE,GAAI,SAAqC,CAAC,UAAU,CAAC,QAAQ,CAAC;gBACtE,IAAI,CAAC,EAAE;oBAAE,OAAO,SAAS,CAAC;gBAE1B,kBAAkB;gBAClB,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;oBAC/B,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;gBAChD,CAAC;gBAED,uBAAuB;gBACvB,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;oBAChC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,CAAC;gBACtD,CAAC;gBAED,uEAAuE;gBACvE,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;oBAC5D,IAAI,QAAQ,CAAC,SAAS,EAAE,CAAC;wBACxB,MAAM,KAAK,GAAG,oBAAoB,CAAC,SAAS,CAAC,CAAC;wBAC9C,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;4BACzB,OAAO,wBAAwB,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;wBAC1E,CAAC;oBACF,CAAC;oBACD,+CAA+C;oBAC/C,OAAO,CAAC,GAAG,CAAC,CAAC;gBACd,CAAC;gBAED,+CAA+C;gBAC/C,IAAI,EAAE,KAAK,MAAM,EAAE,CAAC;oBACnB,OAAO,CAAC,GAAG,CAAC,CAAC;gBACd,CAAC;gBAED,OAAO,SAAS,CAAC;YAClB,CAAC;YAED,KAAK,SAAS,CAAC,CAAC,CAAC;gBAChB,MAAM,EAAE,GAAI,SAAoC,CAAC,UAAU,CAAC,QAAQ,CAAC;gBACrE,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;oBACtB,OAAO,QAAQ,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;gBACnD,CAAC;gBACD,IAAI,EAAE,KAAK,aAAa,EAAE,CAAC;oBAC1B,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC;gBACzD,CAAC;gBACD,OAAO,SAAS,CAAC;YAClB,CAAC;YAED,KAAK,IAAI,CAAC,CAAC,CAAC;gBACX,0BAA0B;gBAC1B,MAAM,QAAQ,GAAG,iBAAiB,CAAC,SAAS,CAAC,CAAC;gBAC9C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;oBAC5B,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,CAAC;gBACtE,CAAC;gBACD,OAAO,SAAS,CAAC;YAClB,CAAC;YAED,KAAK,SAAS,CAAC,CAAC,CAAC;gBAChB,IAAI,QAAQ,CAAC,SAAS,EAAE,CAAC;oBACxB,MAAM,MAAM,GAAG,oBAAoB,CAAC,SAAS,CAAC,CAAC;oBAC/C,IAAI,MAAM,EAAE,CAAC;wBACZ,MAAM,MAAM,GAAG,wBAAwB,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,EAAE,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;wBACxF,MAAM,OAAO,GAAG,wBAAwB,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;wBAC1F,IAAI,MAAM,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;4BACnD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC;wBAC1C,CAAC;oBACF,CAAC;gBACF,CAAC;gBACD,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,qBAAqB;YACpC,CAAC;YAED;gBACC,OAAO,SAAS,CAAC;QACnB,CAAC;IACF,CAAC;CACD;AAED,2EAA2E;AAC3E,2EAA2E;AAC3E,2DAA2D;AAE3D,SAAS,0BAA0B,CAClC,SAAyB,EACzB,OAA6B;IAE7B,mEAAmE;IACnE,4EAA4E;IAC5E,0EAA0E;IAC1E,6EAA6E;IAC7E,0EAA0E;IAC1E,mCAAmC;IACnC,MAAM,QAAQ,GAAG,SAAS,CAAC,WAAW,EAAE,CAAC;IACzC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC9B,IAAI,KAAK,CAAC,QAAQ,KAAK,iBAAiB,EAAE,CAAC;YAC1C,MAAM,GAAG,GAAG,KAAuC,CAAC;YACpD,IAAI,OAAO,EAAE,CAAC;gBACb,sEAAsE;gBACtE,0EAA0E;gBAC1E,2EAA2E;gBAC3E,4EAA4E;gBAC5E,kDAAkD;gBAClD,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBAC1C,OAAO,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;YACtE,CAAC;YACD,MAAM,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC;YACjC,IAAI,IAAI;gBAAE,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;QACvC,CAAC;IACF,CAAC;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,SAAS,oBAAoB,CAAC,SAAyB;IACtD,MAAM,QAAQ,GAAG,SAAS,CAAC,WAAW,EAAE,CAAC;IACzC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC9B,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAClC,MAAM,GAAG,GAAI,KAAgC,CAAC,UAAU,CAAC,KAAK,CAAC;YAC/D,wDAAwD;YACxD,IAAI,GAAG,YAAY,OAAO;gBAAE,OAAO,SAAS,CAAC;YAC7C,OAAO,GAAG,CAAC;QACZ,CAAC;IACF,CAAC;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,SAAS,iBAAiB,CAAC,SAAyB;IACnD,MAAM,IAAI,GAAG,SAA8B,CAAC;IAC5C,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;QAAE,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC1D,2EAA2E;IAC3E,gFAAgF;IAChF,0EAA0E;IAC1E,iEAAiE;IACjE,MAAM,QAAQ,GAAG,SAAS,CAAC,WAAW,EAAE,CAAC;IACzC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IACpD,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,SAAS,oBAAoB,CAAC,SAAyB;IACtD,MAAM,IAAI,GAAG,SAAmC,CAAC;IACjD,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC7F,MAAM,MAAM,GAAI,IAAI,CAAC,KAAgC,CAAC,UAAU,CAAC,KAAK,CAAC;QACvE,MAAM,OAAO,GAAI,IAAI,CAAC,KAAgC,CAAC,UAAU,CAAC,KAAK,CAAC;QACxE,wDAAwD;QACxD,IAAI,MAAM,YAAY,OAAO,IAAI,OAAO,YAAY,OAAO;YAAE,OAAO,SAAS,CAAC;QAC9E,IAAI,MAAM,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YACnD,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;QACvC,CAAC;IACF,CAAC;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,SAAS,sBAAsB,CAC9B,SAAyB,EACzB,OAA6B;IAE7B,IAAI,SAAS,CAAC,QAAQ,KAAK,UAAU;QAAE,OAAO,SAAS,CAAC;IACxD,MAAM,EAAE,GAAI,SAAqC,CAAC,UAAU,CAAC,QAAQ,CAAC;IACtE,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC;IAEhD,MAAM,QAAQ,GAAG,SAAS,CAAC,WAAW,EAAE,CAAC;IACzC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAE5C,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC1B,IAAI,IAAI,CAAC,QAAQ,KAAK,iBAAiB,IAAI,KAAK,CAAC,QAAQ,KAAK,iBAAiB;QAAE,OAAO,SAAS,CAAC;IAElG,MAAM,QAAQ,GAAG,eAAe,CAAC,IAAsC,EAAE,OAAO,CAAC,CAAC;IAClF,MAAM,SAAS,GAAG,eAAe,CAAC,KAAuC,EAAE,OAAO,CAAC,CAAC;IACpF,IAAI,CAAC,QAAQ,IAAI,CAAC,SAAS;QAAE,OAAO,SAAS,CAAC;IAE9C,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;AAC7C,CAAC;AAED;;;GAGG;AACH,SAAS,eAAe,CAAC,GAAwB,EAAE,OAA6B;IAC/E,OAAO,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC;AACjE,CAAC"}

package/dist/src/planner/stats/conjunct-selectivity.d.ts

@@ -0,0 +1,48 @@
+/**
+ * Per-conjunct selectivity estimation shared by `rule-filter-selectivity`
+ * (which folds the estimates into one stamped number) and
+ * `rule-filter-conjunct-ordering` (which ranks conjuncts individually).
+ * Extracted verbatim from the former so the two cannot drift.
+ *
+ * Everything here is gated on REAL statistics: a single-relation conjunct goes
+ * through `statsOnlySelectivity` (never `selectivity`, whose NaiveStatsProvider
+ * fallback fabricates a per-nodeType guess), and a cross-relation conjunct
+ * requires `columnStats` for both compared columns. Undefined always means
+ * "no real statistics answered", never "here is a guess".
+ *
+ * Do NOT re-export this module from `stats/index.ts`: `framework/context.ts`
+ * imports `stats/index.ts`, and this module type-imports `OptContext` from
+ * `framework/context.ts`, so a barrel re-export would create an import cycle
+ * (mirroring the same note on `cost/conjunct-cost.ts`).
+ *
+ * NOTE: a CORRELATED subquery conjunct (`exists (select … where i.oid = o.id)`)
+ * can resolve an outer attribute id through `conjunctRelations` — the walk
+ * descends relational children — and come back with a base-column estimate that
+ * describes the OUTER column rather than the subquery's result. Pre-existing in
+ * the stamping path, and bounded in the ordering path because the cost tier is
+ * the primary sort key: such a conjunct is `Subquery` tier, so a bogus estimate
+ * can only reorder it against other `Subquery`-tier conjuncts, never lift it
+ * ahead of a `Pure` one.
+ */
+import type { ScalarPlanNode } from '../nodes/plan-node.js';
+import type { OptContext } from '../framework/context.js';
+import type { ColumnOrigin } from '../util/column-origins.js';
+import type { ColumnStatsResolver } from './index.js';
+/**
+ * Selectivity of an inequality (`<` `<=` `>` `>=`) comparing a column of one table
+ * to a column of another. The standard uniform-distribution estimate for a
+ * two-sided inequality is 1/3: there is no cross-table histogram, so nothing
+ * better than the uniform assumption is available here.
+ */
+export declare const CROSS_RELATION_INEQUALITY_SELECTIVITY: number;
+/**
+ * A resolver over `origins`, restricted to the origins `accept` allows.
+ *
+ * An attribute with no origin — or one belonging to a relation the caller is not
+ * currently estimating — resolves to undefined, which the provider reads as "this
+ * column has no statistics" rather than falling back to its AST name.
+ */
+export declare function makeColumnStatsResolver(origins: ReadonlyMap<number, ColumnOrigin>, accept: (origin: ColumnOrigin) => boolean): ColumnStatsResolver;
+/** Estimate one conjunct, or undefined when it cannot be attributed / estimated. */
+export declare function estimateConjunctSelectivity(conjunct: ScalarPlanNode, origins: ReadonlyMap<number, ColumnOrigin>, context: OptContext): number | undefined;
+//# sourceMappingURL=conjunct-selectivity.d.ts.map

package/dist/src/planner/stats/conjunct-selectivity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"conjunct-selectivity.d.ts","sourceRoot":"","sources":["../../../../src/planner/stats/conjunct-selectivity.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH,OAAO,KAAK,EAAY,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACtE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAC;AAI1D,OAAO,KAAK,EAAE,YAAY,EAAoB,MAAM,2BAA2B,CAAC;AAChF,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,YAAY,CAAC;AAEtD;;;;;GAKG;AACH,eAAO,MAAM,qCAAqC,QAAQ,CAAC;AAE3D;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CACtC,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,YAAY,CAAC,EAC1C,MAAM,EAAE,CAAC,MAAM,EAAE,YAAY,KAAK,OAAO,GACvC,mBAAmB,CAKrB;AAED,oFAAoF;AACpF,wBAAgB,2BAA2B,CAC1C,QAAQ,EAAE,cAAc,EACxB,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,YAAY,CAAC,EAC1C,OAAO,EAAE,UAAU,GACjB,MAAM,GAAG,SAAS,CAkBpB"}

package/dist/src/planner/stats/conjunct-selectivity.js

@@ -0,0 +1,168 @@
+/**
+ * Per-conjunct selectivity estimation shared by `rule-filter-selectivity`
+ * (which folds the estimates into one stamped number) and
+ * `rule-filter-conjunct-ordering` (which ranks conjuncts individually).
+ * Extracted verbatim from the former so the two cannot drift.
+ *
+ * Everything here is gated on REAL statistics: a single-relation conjunct goes
+ * through `statsOnlySelectivity` (never `selectivity`, whose NaiveStatsProvider
+ * fallback fabricates a per-nodeType guess), and a cross-relation conjunct
+ * requires `columnStats` for both compared columns. Undefined always means
+ * "no real statistics answered", never "here is a guess".
+ *
+ * Do NOT re-export this module from `stats/index.ts`: `framework/context.ts`
+ * imports `stats/index.ts`, and this module type-imports `OptContext` from
+ * `framework/context.ts`, so a barrel re-export would create an import cycle
+ * (mirroring the same note on `cost/conjunct-cost.ts`).
+ *
+ * NOTE: a CORRELATED subquery conjunct (`exists (select … where i.oid = o.id)`)
+ * can resolve an outer attribute id through `conjunctRelations` — the walk
+ * descends relational children — and come back with a base-column estimate that
+ * describes the OUTER column rather than the subquery's result. Pre-existing in
+ * the stamping path, and bounded in the ordering path because the cost tier is
+ * the primary sort key: such a conjunct is `Subquery` tier, so a bogus estimate
+ * can only reorder it against other `Subquery`-tier conjuncts, never lift it
+ * ahead of a `Pure` one.
+ */
+import { BinaryOpNode } from '../nodes/scalar.js';
+import { ColumnReferenceNode } from '../nodes/reference.js';
+/**
+ * Selectivity of an inequality (`<` `<=` `>` `>=`) comparing a column of one table
+ * to a column of another. The standard uniform-distribution estimate for a
+ * two-sided inequality is 1/3: there is no cross-table histogram, so nothing
+ * better than the uniform assumption is available here.
+ */
+export const CROSS_RELATION_INEQUALITY_SELECTIVITY = 1 / 3;
+/**
+ * A resolver over `origins`, restricted to the origins `accept` allows.
+ *
+ * An attribute with no origin — or one belonging to a relation the caller is not
+ * currently estimating — resolves to undefined, which the provider reads as "this
+ * column has no statistics" rather than falling back to its AST name.
+ */
+export function makeColumnStatsResolver(origins, accept) {
+    return (attributeId) => {
+        const origin = origins.get(attributeId);
+        return origin && accept(origin) ? origin.columnName : undefined;
+    };
+}
+/** Estimate one conjunct, or undefined when it cannot be attributed / estimated. */
+export function estimateConjunctSelectivity(conjunct, origins, context) {
+    const relations = conjunctRelations(conjunct, origins);
+    if (relations === undefined)
+        return undefined;
+    if (relations.size === 1) {
+        const [[relation, table]] = relations;
+        // Relation-instance identity, not schema: `from t a join t b` gives two
+        // instances sharing one TableSchema, so schema equality would not separate the
+        // sides. `conjunctRelations` has already established that this conjunct touches
+        // exactly this one instance.
+        const resolve = makeColumnStatsResolver(origins, origin => origin.relation === relation);
+        return singleRelationConjunct(table, conjunct, resolve, context);
+    }
+    if (relations.size === 2) {
+        return crossRelationConjunct(conjunct, origins, context);
+    }
+    // Three or more relations in one conjunct: no model for it here.
+    return undefined;
+}
+/**
+ * The distinct relation instances a conjunct's column references come from, each
+ * mapped to the schema whose statistics describe it.
+ *
+ * Returns undefined when the conjunct references no column at all, or references
+ * any attribute that is not a base-table column (a computed projection, an
+ * aggregate output, a join existence flag, a set-operation output, a column of a
+ * table inside a scalar subquery) — in either case there are no statistics to
+ * consult.
+ */
+function conjunctRelations(conjunct, origins) {
+    const relations = new Map();
+    const stack = [conjunct];
+    while (stack.length > 0) {
+        const n = stack.pop();
+        if (n instanceof ColumnReferenceNode) {
+            const origin = origins.get(n.attributeId);
+            if (!origin)
+                return undefined;
+            relations.set(origin.relation, origin.table);
+            continue;
+        }
+        for (const child of n.getChildren())
+            stack.push(child);
+    }
+    return relations.size > 0 ? relations : undefined;
+}
+/**
+ * A conjunct over exactly one relation: hand it to the provider as if it were a
+ * single-table predicate.
+ *
+ * `statsOnlySelectivity` — not `selectivity` — IS the statistics gate. `selectivity`
+ * always returns a number (CatalogStatsProvider falls through to NaiveStatsProvider,
+ * which answers a flat 0.1 for any BinaryOp), so using it here would replace 0.5 with
+ * 0.1 on essentially every filter-over-join in the codebase — including the many tests
+ * that never run ANALYZE — churning plan shapes with no information behind the change.
+ * It also covers the subtler case of an analyzed table with a predicate the catalog
+ * cannot read (`lower(o.cat) = 'x'`), which a column-stats-presence check would let
+ * through. A provider that does not implement it is treated as having no statistics.
+ */
+function singleRelationConjunct(table, conjunct, resolve, context) {
+    return context.stats.statsOnlySelectivity?.(table, conjunct, resolve);
+}
+function hasColumnStats(origin) {
+    return origin.table.statistics?.columnStats.has(origin.columnName.toLowerCase()) ?? false;
+}
+/**
+ * A conjunct comparing a column of one relation to a column of another
+ * (`o.qty > l.qty`, `a.id = b.id`). Only a plain binary comparison with a bare
+ * column reference on each side is modelled; anything else is unknown.
+ *
+ * Gated on real column statistics for BOTH compared columns, for the same reason as
+ * {@link singleRelationConjunct}: `joinSelectivity` falls back to
+ * `NaiveStatsProvider`'s `1/max(rowCount)` whenever it cannot read a distinct count,
+ * so table-level `statistics` being present is not enough on its own.
+ */
+function crossRelationConjunct(conjunct, origins, context) {
+    if (!(conjunct instanceof BinaryOpNode))
+        return undefined;
+    if (!(conjunct.left instanceof ColumnReferenceNode))
+        return undefined;
+    if (!(conjunct.right instanceof ColumnReferenceNode))
+        return undefined;
+    const leftOrigin = origins.get(conjunct.left.attributeId);
+    const rightOrigin = origins.get(conjunct.right.attributeId);
+    if (!leftOrigin || !rightOrigin)
+        return undefined;
+    if (!hasColumnStats(leftOrigin) || !hasColumnStats(rightOrigin))
+        return undefined;
+    const op = conjunct.expression.operator;
+    // Both origins were resolved and stats-checked by identity just above, so no
+    // further narrowing is needed — the resolver only has to replace the AST names
+    // with the base columns those two attributes actually are.
+    const resolve = makeColumnStatsResolver(origins, () => true);
+    if (op === '=' || op === '==')
+        return equiJoinSelectivity(conjunct, leftOrigin, rightOrigin, resolve, context);
+    // `extractEquiJoinColumns` accepts only `=`, so the catalog declines a `<>` and
+    // `joinSelectivity` answers from NaiveStatsProvider, which is capped at 0.5. The
+    // complement is therefore bounded to [0.5, 1] — it can only ever relax the
+    // estimate relative to DEFAULT_FILTER_SELECTIVITY, and the true value for a
+    // cross-relation `<>` is near 1, so the bound errs in the right direction.
+    if (op === '!=' || op === '<>') {
+        const eq = equiJoinSelectivity(conjunct, leftOrigin, rightOrigin, resolve, context);
+        return eq === undefined ? undefined : 1 - eq;
+    }
+    if (op === '<' || op === '<=' || op === '>' || op === '>=') {
+        return CROSS_RELATION_INEQUALITY_SELECTIVITY;
+    }
+    return undefined;
+}
+/**
+ * Argument order matters: `CatalogStatsProvider.joinSelectivity` reads the column
+ * pair off the condition's own child order (`extractEquiJoinColumns`) and
+ * `fkPkSelectivity` interprets left/right against the tables it was handed. So the
+ * table owning the conjunct's LEFT child must be passed first.
+ */
+function equiJoinSelectivity(conjunct, leftOrigin, rightOrigin, resolve, context) {
+    return context.stats.joinSelectivity?.(leftOrigin.table, rightOrigin.table, conjunct, resolve);
+}
+//# sourceMappingURL=conjunct-selectivity.js.map

package/dist/src/planner/stats/conjunct-selectivity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"conjunct-selectivity.js","sourceRoot":"","sources":["../../../../src/planner/stats/conjunct-selectivity.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAKH,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAI5D;;;;;GAKG;AACH,MAAM,CAAC,MAAM,qCAAqC,GAAG,CAAC,GAAG,CAAC,CAAC;AAE3D;;;;;;GAMG;AACH,MAAM,UAAU,uBAAuB,CACtC,OAA0C,EAC1C,MAAyC;IAEzC,OAAO,CAAC,WAAW,EAAE,EAAE;QACtB,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACxC,OAAO,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC;IACjE,CAAC,CAAC;AACH,CAAC;AAED,oFAAoF;AACpF,MAAM,UAAU,2BAA2B,CAC1C,QAAwB,EACxB,OAA0C,EAC1C,OAAmB;IAEnB,MAAM,SAAS,GAAG,iBAAiB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IACvD,IAAI,SAAS,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAE9C,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,CAAC,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,GAAG,SAAS,CAAC;QACtC,wEAAwE;QACxE,+EAA+E;QAC/E,gFAAgF;QAChF,6BAA6B;QAC7B,MAAM,OAAO,GAAG,uBAAuB,CAAC,OAAO,EAAE,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC;QACzF,OAAO,sBAAsB,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IAClE,CAAC;IACD,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,qBAAqB,CAAC,QAAQ,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IAC1D,CAAC;IACD,iEAAiE;IACjE,OAAO,SAAS,CAAC;AAClB,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,iBAAiB,CACzB,QAAwB,EACxB,OAA0C;IAE1C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAiC,CAAC;IAC3D,MAAM,KAAK,GAAe,CAAC,QAAQ,CAAC,CAAC;IAErC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACvB,IAAI,CAAC,YAAY,mBAAmB,EAAE,CAAC;YACtC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;YAC1C,IAAI,CAAC,MAAM;gBAAE,OAAO,SAAS,CAAC;YAC9B,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;YAC7C,SAAS;QACV,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,WAAW,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxD,CAAC;IAED,OAAO,SAAS,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;AACnD,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAS,sBAAsB,CAC9B,KAAkB,EAClB,QAAwB,EACxB,OAA4B,EAC5B,OAAmB;IAEnB,OAAO,OAAO,CAAC,KAAK,CAAC,oBAAoB,EAAE,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;AACvE,CAAC;AAED,SAAS,cAAc,CAAC,MAAoB;IAC3C,OAAO,MAAM,CAAC,KAAK,CAAC,UAAU,EAAE,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC,IAAI,KAAK,CAAC;AAC3F,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,qBAAqB,CAC7B,QAAwB,EACxB,OAA0C,EAC1C,OAAmB;IAEnB,IAAI,CAAC,CAAC,QAAQ,YAAY,YAAY,CAAC;QAAE,OAAO,SAAS,CAAC;IAC1D,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,YAAY,mBAAmB,CAAC;QAAE,OAAO,SAAS,CAAC;IACtE,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,YAAY,mBAAmB,CAAC;QAAE,OAAO,SAAS,CAAC;IAEvE,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC1D,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IAC5D,IAAI,CAAC,UAAU,IAAI,CAAC,WAAW;QAAE,OAAO,SAAS,CAAC;IAClD,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC;QAAE,OAAO,SAAS,CAAC;IAElF,MAAM,EAAE,GAAG,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC;IAExC,6EAA6E;IAC7E,+EAA+E;IAC/E,2DAA2D;IAC3D,MAAM,OAAO,GAAG,uBAAuB,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;IAE7D,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,IAAI;QAAE,OAAO,mBAAmB,CAAC,QAAQ,EAAE,UAAU,EAAE,WAAW,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IAE/G,gFAAgF;IAChF,iFAAiF;IACjF,2EAA2E;IAC3E,4EAA4E;IAC5E,2EAA2E;IAC3E,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;QAChC,MAAM,EAAE,GAAG,mBAAmB,CAAC,QAAQ,EAAE,UAAU,EAAE,WAAW,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QACpF,OAAO,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;IAC9C,CAAC;IAED,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;QAC5D,OAAO,qCAAqC,CAAC;IAC9C,CAAC;IAED,OAAO,SAAS,CAAC;AAClB,CAAC;AAED;;;;;GAKG;AACH,SAAS,mBAAmB,CAC3B,QAAwB,EACxB,UAAwB,EACxB,WAAyB,EACzB,OAA4B,EAC5B,OAAmB;IAEnB,OAAO,OAAO,CAAC,KAAK,CAAC,eAAe,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;AAChG,CAAC"}