Struct mz_compute_types::plan::reduce::BucketedPlan

pub struct BucketedPlan {
    pub aggr_funcs: Vec<AggregateFunc>,
    pub skips: Vec<usize>,
    pub buckets: Vec<u64>,
}

Plan for computing a set of hierarchical aggregations with non-monotonic inputs.

To perform hierarchical aggregations with stable runtimes under updates we’ll subdivide the group key into buckets, compute the reduction in each of those subdivided buckets and then combine the results into a coarser bucket (one that represents a larger fraction of the original input) and redo the reduction in another layer. Effectively, we’ll construct a min / max heap out of a series of reduce operators (each one is a separate layer).

Fields

aggr_funcs: Vec<AggregateFunc>

All of the aggregations we were asked to compute.

skips: Vec<usize>

Set of “skips” or calls to nth() an iterator needs to do over the input to extract the relevant datums.

buckets: Vec<u64>

The number of buckets in each layer of the reduction tree. Should be decreasing, and ideally, a power of two so that we can easily distribute values to buckets with value.hashed() % buckets[layer].

Implementations

impl BucketedPlan

fn into_monotonic(self, must_consolidate: bool) -> MonotonicPlan

Convert to a monotonic plan, indicate whether the operator must apply consolidation to its input.

Trait Implementations

impl Clone for BucketedPlan

fn clone(&self) -> BucketedPlan

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for BucketedPlan

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for BucketedPlan

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Ord for BucketedPlan

fn cmp(&self, other: &BucketedPlan) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl PartialEq for BucketedPlan

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

fn partial_cmp(&self, other: &BucketedPlan) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl RustType<ProtoBucketedPlan> for BucketedPlan

fn into_proto(&self) -> ProtoBucketedPlan

Convert a Self into a Proto value.

fn from_proto(proto: ProtoBucketedPlan) -> Result<Self, TryFromProtoError>

Consume and convert a Proto back into a Self value.

fn into_proto_owned(self) -> Proto

A zero clone version of Self::into_proto that types can optionally implement, otherwise, the default implementation delegates to Self::into_proto.

impl Serialize for BucketedPlan

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for BucketedPlan

impl StructuralPartialEq for BucketedPlan