Enum JoinAlgorithm 

pub enum JoinAlgorithm {
    Hash,
    SortMerge,
}

Algorithm to use for join execution.

Variants

Hash

Hash join: build hash table on one side, probe with other. O(N+M) complexity - suitable for production workloads. Default and recommended for all equality joins.

SortMerge

Sort-merge join: sort both sides, then merge. Good for pre-sorted inputs or when memory is constrained. Not yet implemented.

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 Default for JoinAlgorithm

fn default() -> JoinAlgorithm

Returns the “default value” for a type.

impl Display for JoinAlgorithm

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

Formats the value using the given formatter.

impl Hash for JoinAlgorithm

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

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 Copy for JoinAlgorithm

impl Eq for JoinAlgorithm

impl StructuralPartialEq for JoinAlgorithm