Enum JoinAlgorithm 

pub enum JoinAlgorithm {
    Hash,
    NestedLoop,
    Merge,
}

Which join algorithm to use for a given join node

Variants

Hash

Hash join: good when one side is small enough to fit in memory

NestedLoop

Nested loop join: good when outer is tiny and inner has index support

Merge

Sort-merge join: good for large sorted inputs with shared sort keys

Trait Implementations

impl Clone for JoinAlgorithm

fn clone(&self) -> JoinAlgorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for JoinAlgorithm

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

Formats the value using the given formatter.

impl PartialEq for JoinAlgorithm

fn eq(&self, other: &JoinAlgorithm) -> 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 Eq for JoinAlgorithm

impl StructuralPartialEq for JoinAlgorithm