Struct QueryPlan 

pub struct QueryPlan {
    pub root: PlanNode,
    pub estimated_cost: f64,
    pub estimated_cardinality: u64,
}

A complete, annotated query execution plan.

The plan is a tree of PlanNodes that mirrors the physical execution order decided by the optimizer. Each node carries its own cost / row estimate so callers can identify expensive sub-trees without executing the query.

Fields

root: PlanNode

Root operator of the physical plan tree.

estimated_cost: f64

Aggregate estimated cost for the entire plan (abstract cost units).

estimated_cardinality: u64

Estimated number of result rows produced by the root operator.

Trait Implementations

impl Clone for QueryPlan

fn clone(&self) -> QueryPlan

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for QueryPlan

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for QueryPlan

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for QueryPlan

fn eq(&self, other: &QueryPlan) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for QueryPlan

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for QueryPlan