velesdb_core/velesql/explain/

plan_builder.rs

//! Plan construction logic for `VelesQL` EXPLAIN.
//!
//! Contains `impl QueryPlan` methods for building plans from SELECT statements,
//! MATCH clauses, and related query structures.

use std::collections::HashSet;

use super::filter_strategy::{estimate_filter_stats, resolve_filter_strategy};
use super::formatter;
use super::node_stats;
use super::types::{
    AggregatePlan, FilterPlan, FilterStrategy, FusionInfo, GroupByPlan, IndexLookupPlan, IndexType,
    JoinPlanNode, LimitPlan, MatchTraversalPlan, OffsetPlan, PlanNode, QueryPlan, SortPlan,
    TableScanPlan, VectorSearchPlan,
};
use crate::collection::search::query::match_planner::{
    CollectionStats, MatchExecutionStrategy, MatchQueryPlanner,
};
use crate::collection::stats::CollectionStats as CoreCollectionStats;
use crate::velesql::ast::{Condition, LetBinding, SelectStatement, DEFAULT_SELECT_LIMIT};
use crate::velesql::MatchClause;

impl QueryPlan {
    /// Creates a new query plan from a SELECT statement.
    #[must_use]
    pub fn from_select(stmt: &SelectStatement) -> Self {
        Self::from_select_with_stats(stmt, &HashSet::new(), None)
    }

    /// Creates a new query plan from SELECT with known indexed metadata fields.
    #[must_use]
    pub fn from_select_with_indexed_fields(
        stmt: &SelectStatement,
        indexed_fields: &HashSet<String>,
    ) -> Self {
        Self::from_select_with_stats(stmt, indexed_fields, None)
    }

    /// Creates a query plan with access to calibrated collection statistics.
    ///
    /// When `stats` is `Some`, cost and filter-strategy decisions use the
    /// calibrated `CostEstimator` pipeline (issue #471). When `None`, falls
    /// back bit-for-bit to the heuristic path so legacy tests and callers
    /// without a resolved collection keep working.
    #[must_use]
    pub fn from_select_with_stats(
        stmt: &SelectStatement,
        indexed_fields: &HashSet<String>,
        stats: Option<&CoreCollectionStats>,
    ) -> Self {
        Self::build_select_plan(stmt, indexed_fields, stats, true)
    }

    /// Shared SELECT plan construction.
    ///
    /// `implicit_limit` controls whether the engine default
    /// [`DEFAULT_SELECT_LIMIT`] is surfaced as a Limit node when the statement
    /// has no explicit LIMIT. Plain SELECT statements pass `true`; MATCH and
    /// compound queries pass `false` (no implicit limit applies to them).
    fn build_select_plan(
        stmt: &SelectStatement,
        indexed_fields: &HashSet<String>,
        stats: Option<&CoreCollectionStats>,
        implicit_limit: bool,
    ) -> Self {
        let mut has_vector_search = false;
        let mut filter_conditions = Vec::new();
        let mut index_lookup = None;

        if let Some(ref condition) = stmt.where_clause {
            Self::analyze_condition(condition, &mut has_vector_search, &mut filter_conditions);
            index_lookup = Self::extract_index_lookup(condition, indexed_fields);
        }

        let (mut nodes, index_used) = Self::build_scan_node(stmt, has_vector_search, index_lookup);
        let filter_strategy = Self::append_filter_nodes_with_stats(
            &mut nodes,
            &filter_conditions,
            stmt,
            has_vector_search,
            stats,
        );
        Self::append_post_filter_nodes(&mut nodes, stmt);
        Self::push_pagination_nodes(&mut nodes, stmt, implicit_limit);

        let mut plan = Self::assemble_plan_with_stats(
            nodes,
            index_used,
            filter_strategy,
            has_vector_search,
            stats,
        );
        plan.with_options = Self::extract_with_options(stmt);
        plan.fusion_info = Self::extract_fusion_info(stmt);
        plan
    }

    /// Creates a full query plan from a `Query`, including LET bindings (issue #471).
    #[must_use]
    pub fn from_query(query: &crate::velesql::ast::Query) -> Self {
        Self::from_query_with_stats(query, &HashSet::new(), None)
    }

    /// Creates a full query plan from a `Query`, with optional collection stats
    /// for calibrated cost estimation (issue #471).
    #[must_use]
    pub fn from_query_with_stats(
        query: &crate::velesql::ast::Query,
        indexed_fields: &HashSet<String>,
        stats: Option<&CoreCollectionStats>,
    ) -> Self {
        Self::from_query_with_all_stats(query, indexed_fields, stats, None)
    }

    /// Creates a full query plan from a `Query`, threading both calibrated
    /// `CoreCollectionStats` (SELECT cost estimation) and graph
    /// `CollectionStats` (MATCH traversal-strategy selection).
    ///
    /// MATCH queries route through [`Self::from_match`] so the EXPLAIN/exec
    /// path emits a `MatchTraversal` node with a real strategy instead of a
    /// bare `TableScan` mislabeled MATCH (backlog #14). `match_stats` is `None`
    /// on the pure-AST path (default graph stats); the Database layer supplies
    /// the live graph stats from `compute_match_collection_stats`.
    #[must_use]
    pub fn from_query_with_all_stats(
        query: &crate::velesql::ast::Query,
        indexed_fields: &HashSet<String>,
        stats: Option<&CoreCollectionStats>,
        match_stats: Option<&CollectionStats>,
    ) -> Self {
        let mut plan = if let Some(ref match_clause) = query.match_clause {
            let default_stats = CollectionStats::default();
            Self::from_match(match_clause, match_stats.unwrap_or(&default_stats))
        } else {
            // Compound queries have no implicit default LIMIT either.
            let implicit_limit = query.compound.is_none();
            Self::build_select_plan(&query.select, indexed_fields, stats, implicit_limit)
        };
        plan.let_bindings = Self::format_let_bindings(&query.let_bindings);
        plan
    }

    /// Creates a new query plan from a MATCH clause (EPIC-046 US-004).
    #[must_use]
    pub fn from_match(match_clause: &MatchClause, stats: &CollectionStats) -> Self {
        let strategy = MatchQueryPlanner::plan(match_clause, stats);
        let strategy_explanation = MatchQueryPlanner::explain(&strategy);

        let (start_labels, max_depth, has_similarity, similarity_threshold) =
            Self::extract_strategy_info(&strategy);

        let relationship_count = match_clause
            .patterns
            .first()
            .map_or(0, |p| p.relationships.len());

        let traversal = PlanNode::MatchTraversal(MatchTraversalPlan {
            strategy: strategy_explanation,
            start_labels,
            max_depth,
            relationship_count,
            has_similarity,
            similarity_threshold,
        });

        let mut nodes = vec![traversal];
        if let Some(limit) = match_clause.return_clause.limit {
            nodes.push(PlanNode::Limit(LimitPlan {
                count: limit,
                is_default: false,
            }));
        }

        let index_used = if has_similarity {
            Some(IndexType::Hnsw)
        } else {
            None
        };

        Self::assemble_plan_with_stats(
            nodes,
            index_used,
            FilterStrategy::None,
            has_similarity,
            None,
        )
    }

    /// Variant of `assemble_plan` with optional calibrated `CollectionStats`.
    fn assemble_plan_with_stats(
        mut nodes: Vec<PlanNode>,
        index_used: Option<IndexType>,
        filter_strategy: FilterStrategy,
        has_vector_search: bool,
        stats: Option<&CoreCollectionStats>,
    ) -> Self {
        let root = if nodes.len() == 1 {
            nodes.swap_remove(0)
        } else {
            PlanNode::Sequence(nodes)
        };
        let estimated_cost_ms = node_stats::estimate_cost(&root, has_vector_search, stats);
        Self {
            root,
            estimated_cost_ms,
            index_used,
            filter_strategy,
            with_options: Vec::new(),
            let_bindings: Vec::new(),
            fusion_info: None,
            cache_hit: None,
            plan_reuse_count: None,
        }
    }

    /// Default `ef_search` when the WITH clause does not specify one.
    const DEFAULT_EF_SEARCH: u32 = 100;

    /// Builds the primary scan node based on search type.
    fn build_scan_node(
        stmt: &SelectStatement,
        has_vector_search: bool,
        index_lookup: Option<(String, String)>,
    ) -> (Vec<PlanNode>, Option<IndexType>) {
        let mut nodes = Vec::new();
        let index_used;

        if has_vector_search {
            index_used = Some(IndexType::Hnsw);
            let candidates =
                u32::try_from(stmt.limit.unwrap_or(DEFAULT_SELECT_LIMIT)).unwrap_or(u32::MAX);
            let ef_search = Self::resolve_ef_search(stmt);
            nodes.push(PlanNode::VectorSearch(VectorSearchPlan {
                collection: stmt.from.clone(),
                ef_search,
                candidates,
            }));
        } else if let Some((property, value)) = index_lookup {
            index_used = Some(IndexType::Property);
            nodes.push(PlanNode::IndexLookup(IndexLookupPlan {
                label: stmt.from.clone(),
                property,
                value,
            }));
        } else {
            index_used = None;
            nodes.push(PlanNode::TableScan(TableScanPlan {
                collection: stmt.from.clone(),
            }));
        }

        (nodes, index_used)
    }

    /// Reads `ef_search` from the WITH clause, falling back to [`Self::DEFAULT_EF_SEARCH`].
    #[allow(clippy::cast_possible_truncation)]
    fn resolve_ef_search(stmt: &SelectStatement) -> u32 {
        stmt.with_clause
            .as_ref()
            .and_then(crate::velesql::ast::WithClause::get_ef_search)
            .map_or(Self::DEFAULT_EF_SEARCH, |v| v as u32)
    }

    /// Extracts WITH clause options as display pairs (issue #471).
    fn extract_with_options(stmt: &SelectStatement) -> Vec<(String, String)> {
        let Some(ref wc) = stmt.with_clause else {
            return Vec::new();
        };
        wc.options
            .iter()
            .map(|opt| (opt.key.clone(), formatter::format_with_value(&opt.value)))
            .collect()
    }

    /// Extracts FUSION clause info for EXPLAIN display (issue #471).
    fn extract_fusion_info(stmt: &SelectStatement) -> Option<FusionInfo> {
        let fc = stmt.fusion_clause.as_ref()?;
        let strategy = match fc.strategy {
            crate::velesql::ast::FusionStrategyType::Rrf => "RRF",
            crate::velesql::ast::FusionStrategyType::Weighted => "Weighted",
            crate::velesql::ast::FusionStrategyType::Maximum => "Maximum",
            crate::velesql::ast::FusionStrategyType::Rsf => "RSF",
            crate::velesql::ast::FusionStrategyType::Average => "Average",
        };
        let weights = Self::format_fusion_weights(fc);
        Some(FusionInfo {
            strategy: strategy.to_string(),
            k: fc.k,
            weights,
        })
    }

    /// Formats fusion weights into a human-readable string.
    fn format_fusion_weights(fc: &crate::velesql::ast::FusionClause) -> Option<String> {
        let mut parts = Vec::new();
        if let Some(vw) = fc.vector_weight {
            parts.push(format!("vector={vw}"));
        }
        if let Some(gw) = fc.graph_weight {
            parts.push(format!("graph={gw}"));
        }
        if let Some(dw) = fc.dense_weight {
            parts.push(format!("dense={dw}"));
        }
        if let Some(sw) = fc.sparse_weight {
            parts.push(format!("sparse={sw}"));
        }
        if parts.is_empty() {
            None
        } else {
            Some(parts.join(", "))
        }
    }

    /// Formats LET bindings as `"name = expr"` strings (issue #471).
    fn format_let_bindings(bindings: &[LetBinding]) -> Vec<String> {
        bindings
            .iter()
            .map(|b| format!("{} = {}", b.name, b.expr))
            .collect()
    }

    /// Variant of `append_filter_nodes` with access to the calibrated
    /// `CostEstimator` (issue #471).
    ///
    /// Selectivity and filter strategy use histogram data when `stats` is
    /// `Some`. When `None`, the historical heuristic (selectivity from
    /// condition count, 0.1 threshold) is preserved bit-for-bit.
    fn append_filter_nodes_with_stats(
        nodes: &mut Vec<PlanNode>,
        filter_conditions: &[String],
        stmt: &SelectStatement,
        has_vector_search: bool,
        stats: Option<&CoreCollectionStats>,
    ) -> FilterStrategy {
        let mut filter_strategy = FilterStrategy::None;

        if !filter_conditions.is_empty() {
            let heuristic_fallback = Self::estimate_selectivity(filter_conditions);
            let (selectivity, estimation_method, estimated_rows) =
                estimate_filter_stats(stmt, heuristic_fallback, stats);

            // Reason: plan_builder owns stmt so the real ef_search/candidates
            // are the same values used in `build_scan_node` above
            // (Devin finding 4). These values drive the pre/post-filter cost
            // comparison so it reflects the user's actual WITH clause instead
            // of a fixed k = 10.
            let ef_search = Self::resolve_ef_search(stmt);
            let candidates =
                u32::try_from(stmt.limit.unwrap_or(DEFAULT_SELECT_LIMIT)).unwrap_or(u32::MAX);

            filter_strategy = resolve_filter_strategy(
                selectivity,
                has_vector_search,
                ef_search,
                candidates,
                stats,
            );

            nodes.push(PlanNode::Filter(FilterPlan {
                conditions: filter_conditions.join(" AND "),
                selectivity,
                estimated_rows,
                estimation_method,
            }));
        }

        filter_strategy
    }

    /// Appends post-filter pipeline nodes (JOIN, GROUP BY, aggregation, ORDER
    /// BY) in the order they execute, mirroring the previous server-side
    /// reconstruction so the single-sourced plan is step-compatible.
    fn append_post_filter_nodes(nodes: &mut Vec<PlanNode>, stmt: &SelectStatement) {
        for join in &stmt.joins {
            nodes.push(PlanNode::Join(JoinPlanNode {
                join_type: format!("{:?}", join.join_type),
                table: join.table.clone(),
            }));
        }
        if let Some(ref group_by) = stmt.group_by {
            nodes.push(PlanNode::GroupBy(GroupByPlan {
                columns: group_by.columns.clone(),
            }));
        }
        let functions = Self::aggregate_function_names(&stmt.columns);
        if !functions.is_empty() {
            nodes.push(PlanNode::Aggregate(AggregatePlan { functions }));
        }
        if let Some(ref order_by) = stmt.order_by {
            let keys = order_by
                .iter()
                .map(|o| {
                    let (col, dir) = o.to_display_pair();
                    format!("{col} {dir}")
                })
                .collect();
            nodes.push(PlanNode::Sort(SortPlan { keys }));
        }
    }

    /// Returns the aggregate function names in SELECT-list order, or an empty
    /// vec when the projection has no aggregates.
    fn aggregate_function_names(columns: &crate::velesql::ast::SelectColumns) -> Vec<String> {
        use crate::velesql::ast::SelectColumns;
        let aggregations = match columns {
            SelectColumns::Aggregations(aggs) => aggs.as_slice(),
            SelectColumns::Mixed { aggregations, .. } => aggregations.as_slice(),
            _ => &[],
        };
        aggregations
            .iter()
            .map(|a| format!("{:?}", a.function_type))
            .collect()
    }

    /// Appends the OFFSET (when present) and LIMIT pagination nodes last, so the
    /// pipeline order is scan → filter → joins → group → aggregate → sort →
    /// offset → limit.
    fn push_pagination_nodes(
        nodes: &mut Vec<PlanNode>,
        stmt: &SelectStatement,
        implicit_limit: bool,
    ) {
        if let Some(offset) = stmt.offset {
            nodes.push(PlanNode::Offset(OffsetPlan { count: offset }));
        }
        Self::push_limit_node(nodes, stmt, implicit_limit);
    }

    /// Pushes the Limit node for a statement.
    ///
    /// Without an explicit LIMIT, plain SELECT statements (`implicit_limit ==
    /// true`) surface the engine default [`DEFAULT_SELECT_LIMIT`] so EXPLAIN
    /// matches what execution actually returns. MATCH and compound queries
    /// (`implicit_limit == false`) keep their unlimited semantics: no node.
    fn push_limit_node(nodes: &mut Vec<PlanNode>, stmt: &SelectStatement, implicit_limit: bool) {
        let (count, is_default) = match (stmt.limit, implicit_limit) {
            (Some(limit), _) => (limit, false),
            (None, true) => (DEFAULT_SELECT_LIMIT, true),
            (None, false) => return,
        };
        nodes.push(PlanNode::Limit(LimitPlan { count, is_default }));
    }

    /// Analyzes a condition to extract vector search and filter info.
    fn analyze_condition(
        condition: &Condition,
        has_vector_search: &mut bool,
        filter_conditions: &mut Vec<String>,
    ) {
        match condition {
            Condition::VectorSearch(_)
            | Condition::VectorFusedSearch(_)
            | Condition::SparseVectorSearch(_)
            | Condition::Similarity(_) => {
                *has_vector_search = true;
            }
            Condition::And(left, right) | Condition::Or(left, right) => {
                Self::analyze_condition(left, has_vector_search, filter_conditions);
                Self::analyze_condition(right, has_vector_search, filter_conditions);
            }
            Condition::Not(inner) | Condition::Group(inner) => {
                Self::analyze_condition(inner, has_vector_search, filter_conditions);
            }
            leaf => {
                if let Some(desc) = Self::describe_leaf_condition(leaf) {
                    filter_conditions.push(desc);
                }
            }
        }
    }

    /// Renders a non-composite condition as a short human-readable string for
    /// the EXPLAIN plan filter list. Returns `None` for vector/composite
    /// variants — those are handled in [`analyze_condition`] itself.
    fn describe_leaf_condition(condition: &Condition) -> Option<String> {
        let desc = match condition {
            Condition::Comparison(cmp) => {
                format!("{} {} ?", cmp.column, cmp.operator.as_str())
            }
            Condition::In(inc) => {
                let op = if inc.negated { "NOT IN" } else { "IN" };
                format!("{} {op} (...)", inc.column)
            }
            Condition::Between(btw) => format!("{} BETWEEN ? AND ?", btw.column),
            Condition::Like(lk) => format!("{} LIKE ?", lk.column),
            Condition::IsNull(isn) => {
                let op = if isn.is_null {
                    "IS NULL"
                } else {
                    "IS NOT NULL"
                };
                format!("{} {op}", isn.column)
            }
            Condition::Match(m) => format!("{} MATCH ?", m.column),
            Condition::ContainsText(ct) => format!("{} CONTAINS_TEXT ?", ct.column),
            Condition::GraphMatch(_) => "MATCH (...)".to_string(),
            Condition::Contains(cc) => {
                let mode_str = match cc.mode {
                    crate::velesql::ContainsMode::Single => "CONTAINS",
                    crate::velesql::ContainsMode::Any => "CONTAINS ANY",
                    crate::velesql::ContainsMode::All => "CONTAINS ALL",
                };
                format!("{} {mode_str} ?", cc.column)
            }
            Condition::GeoDistance(gd) => format!(
                "GEO_DISTANCE({}, {}, {}) {} ?",
                gd.column,
                gd.lat,
                gd.lng,
                gd.operator.as_str()
            ),
            Condition::GeoBbox(gb) => format!("GEO_BBOX({}, ...)", gb.column),
            _ => return None,
        };
        Some(desc)
    }

    fn extract_index_lookup(
        condition: &Condition,
        indexed_fields: &HashSet<String>,
    ) -> Option<(String, String)> {
        if let Condition::Comparison(cmp) = condition {
            if cmp.operator == crate::velesql::CompareOp::Eq && indexed_fields.contains(&cmp.column)
            {
                return Some((cmp.column.clone(), format!("{:?}", cmp.value)));
            }
        }
        if let Condition::In(inc) = condition {
            if indexed_fields.contains(&inc.column) {
                let op = if inc.negated { "NOT IN" } else { "IN" };
                return Some((inc.column.clone(), format!("{op} (...)")));
            }
        }
        None
    }

    /// Estimates selectivity (placeholder - would need statistics in production).
    pub(crate) fn estimate_selectivity(conditions: &[String]) -> f64 {
        node_stats::estimate_selectivity(conditions, None)
    }

    /// Returns the heuristic cost for a single plan node.
    #[cfg(test)]
    pub(crate) fn node_cost(node: &PlanNode) -> f64 {
        node_stats::node_cost(node)
    }

    /// Extracts traversal parameters from a `MatchExecutionStrategy`.
    fn extract_strategy_info(
        strategy: &MatchExecutionStrategy,
    ) -> (Vec<String>, u32, bool, Option<f32>) {
        match strategy {
            MatchExecutionStrategy::GraphFirst {
                start_labels,
                max_depth,
            } => (start_labels.clone(), *max_depth, false, None),
            MatchExecutionStrategy::VectorFirst { threshold, .. } => {
                (Vec::new(), 1, true, Some(*threshold))
            }
            MatchExecutionStrategy::Parallel {
                graph_hint,
                vector_hint,
            } => {
                let (labels, depth) = match graph_hint.as_ref() {
                    MatchExecutionStrategy::GraphFirst {
                        start_labels,
                        max_depth,
                    } => (start_labels.clone(), *max_depth),
                    _ => (Vec::new(), 1),
                };
                let threshold = match vector_hint.as_ref() {
                    MatchExecutionStrategy::VectorFirst { threshold, .. } => Some(*threshold),
                    _ => None,
                };
                (labels, depth, true, threshold)
            }
        }
    }
}