1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532
// Copyright Materialize, Inc. and contributors. All rights reserved.
//
// Use of this software is governed by the Business Source License
// included in the LICENSE file.
//
// As of the Change Date specified in that file, in accordance with
// the Business Source License, use of this software will be governed
// by the Apache License, Version 2.0.
//! Rendering of linear join plans.
//!
//! Consult [LinearJoinPlan] documentation for details.
use std::time::{Duration, Instant};
use differential_dataflow::lattice::Lattice;
use differential_dataflow::operators::arrange::arrangement::Arranged;
use differential_dataflow::trace::TraceReader;
use differential_dataflow::{AsCollection, Collection, Data};
use mz_compute_types::dyncfgs::{ENABLE_MZ_JOIN_CORE, LINEAR_JOIN_YIELDING};
use mz_compute_types::plan::join::linear_join::{LinearJoinPlan, LinearStagePlan};
use mz_compute_types::plan::join::JoinClosure;
use mz_dyncfg::ConfigSet;
use mz_repr::fixed_length::ToDatumIter;
use mz_repr::{DatumVec, Diff, Row, RowArena, SharedRow};
use mz_storage_types::errors::DataflowError;
use mz_timely_util::operator::CollectionExt;
use timely::container::columnation::Columnation;
use timely::dataflow::operators::OkErr;
use timely::dataflow::Scope;
use timely::progress::timestamp::{Refines, Timestamp};
use crate::extensions::arrange::MzArrange;
use crate::render::context::{
ArrangementFlavor, CollectionBundle, Context, MzArrangement, MzArrangementImport, ShutdownToken,
};
use crate::render::join::mz_join_core::mz_join_core;
use crate::row_spine::RowRowSpine;
use crate::typedefs::{RowRowAgent, RowRowEnter};
/// Available linear join implementations.
///
/// See the `mz_join_core` module docs for our rationale for providing two join implementations.
#[derive(Clone, Copy)]
enum LinearJoinImpl {
Materialize,
DifferentialDataflow,
}
/// Specification of how linear joins are to be executed.
///
/// Note that currently `yielding` only affects the `Materialize` join implementation, as the DD
/// join doesn't allow configuring its yielding behavior. Merging [#390] would fix this.
///
/// [#390]: https://github.com/TimelyDataflow/differential-dataflow/pull/390
#[derive(Clone, Copy)]
pub struct LinearJoinSpec {
implementation: LinearJoinImpl,
yielding: YieldSpec,
}
impl Default for LinearJoinSpec {
fn default() -> Self {
Self {
implementation: LinearJoinImpl::Materialize,
yielding: Default::default(),
}
}
}
impl LinearJoinSpec {
/// Create a `LinearJoinSpec` based on the given config.
pub fn from_config(config: &ConfigSet) -> Self {
let implementation = match ENABLE_MZ_JOIN_CORE.get(config) {
true => LinearJoinImpl::Materialize,
false => LinearJoinImpl::DifferentialDataflow,
};
let yielding_raw = LINEAR_JOIN_YIELDING.get(config);
let yielding = YieldSpec::try_from_str(&yielding_raw).unwrap_or_else(|| {
tracing::error!("invalid LINEAR_JOIN_YIELDING config: {yielding_raw}");
YieldSpec::default()
});
Self {
implementation,
yielding,
}
}
/// Render a join operator according to this specification.
fn render<G, Tr1, Tr2, L, I>(
&self,
arranged1: &Arranged<G, Tr1>,
arranged2: &Arranged<G, Tr2>,
shutdown_token: ShutdownToken,
result: L,
) -> Collection<G, I::Item, Diff>
where
G: Scope,
G::Timestamp: Lattice,
Tr1: TraceReader<Time = G::Timestamp, Diff = Diff> + Clone + 'static,
Tr2: for<'a> TraceReader<Key<'a> = Tr1::Key<'a>, Time = G::Timestamp, Diff = Diff>
+ Clone
+ 'static,
L: FnMut(Tr1::Key<'_>, Tr1::Val<'_>, Tr2::Val<'_>) -> I + 'static,
I: IntoIterator,
I::Item: Data,
{
use LinearJoinImpl::*;
match (
self.implementation,
self.yielding.after_work,
self.yielding.after_time,
) {
(DifferentialDataflow, _, _) => arranged1.join_core(arranged2, result),
(Materialize, Some(work_limit), Some(time_limit)) => {
let yield_fn =
move |start: Instant, work| work >= work_limit || start.elapsed() >= time_limit;
mz_join_core(arranged1, arranged2, shutdown_token, result, yield_fn)
}
(Materialize, Some(work_limit), None) => {
let yield_fn = move |_start, work| work >= work_limit;
mz_join_core(arranged1, arranged2, shutdown_token, result, yield_fn)
}
(Materialize, None, Some(time_limit)) => {
let yield_fn = move |start: Instant, _work| start.elapsed() >= time_limit;
mz_join_core(arranged1, arranged2, shutdown_token, result, yield_fn)
}
(Materialize, None, None) => {
let yield_fn = |_start, _work| false;
mz_join_core(arranged1, arranged2, shutdown_token, result, yield_fn)
}
}
}
}
/// Specification of a dataflow operator's yielding behavior.
#[derive(Clone, Copy)]
struct YieldSpec {
/// Yield after the given amount of work was performed.
after_work: Option<usize>,
/// Yield after the given amount of time has elapsed.
after_time: Option<Duration>,
}
impl Default for YieldSpec {
fn default() -> Self {
Self {
after_work: Some(1_000_000),
after_time: Some(Duration::from_millis(100)),
}
}
}
impl YieldSpec {
fn try_from_str(s: &str) -> Option<Self> {
let mut after_work = None;
let mut after_time = None;
let options = s.split(',').map(|o| o.trim());
for option in options {
let parts: Vec<_> = option.split(':').map(|p| p.trim()).collect();
match &parts[..] {
["work", amount] => {
let amount = amount.parse().ok()?;
after_work = Some(amount);
}
["time", millis] => {
let millis = millis.parse().ok()?;
let duration = Duration::from_millis(millis);
after_time = Some(duration);
}
_ => return None,
}
}
Some(Self {
after_work,
after_time,
})
}
}
/// Different forms the streamed data might take.
enum JoinedFlavor<G, T>
where
G: Scope,
G::Timestamp: Lattice + Refines<T> + Columnation,
T: Timestamp + Lattice + Columnation,
{
/// Streamed data as a collection.
Collection(Collection<G, Row, Diff>),
/// A dataflow-local arrangement.
Local(MzArrangement<G>),
/// An imported arrangement.
Trace(MzArrangementImport<G, T>),
}
impl<G, T> Context<G, T>
where
G: Scope,
G::Timestamp: Lattice + Refines<T> + Columnation,
T: Timestamp + Lattice + Columnation,
{
pub(crate) fn render_join(
&mut self,
inputs: Vec<CollectionBundle<G, T>>,
linear_plan: LinearJoinPlan,
) -> CollectionBundle<G, T> {
self.scope.clone().region_named("Join(Linear)", |inner| {
// Collect all error streams, and concatenate them at the end.
let mut errors = Vec::new();
// Determine which form our maintained spine of updates will initially take.
// First, just check out the availability of an appropriate arrangement.
// This will be `None` in the degenerate single-input join case, which ensures
// that we do not panic if we never go around the `stage_plans` loop.
let arrangement = linear_plan.stage_plans.get(0).and_then(|stage| {
inputs[linear_plan.source_relation].arrangement(&stage.stream_key)
});
// We can use an arrangement if it exists and an initial closure does not.
let mut joined = match (arrangement, linear_plan.initial_closure) {
(Some(ArrangementFlavor::Local(oks, errs)), None) => {
errors.push(errs.as_collection(|k, _v| k.clone()).enter_region(inner));
JoinedFlavor::Local(oks.enter_region(inner))
}
(Some(ArrangementFlavor::Trace(_gid, oks, errs)), None) => {
errors.push(errs.as_collection(|k, _v| k.clone()).enter_region(inner));
JoinedFlavor::Trace(oks.enter_region(inner))
}
(_, initial_closure) => {
// TODO: extract closure from the first stage in the join plan, should it exist.
// TODO: apply that closure in `flat_map_ref` rather than calling `.collection`.
let (joined, errs) = inputs[linear_plan.source_relation]
.as_specific_collection(linear_plan.source_key.as_deref());
errors.push(errs.enter_region(inner));
let mut joined = joined.enter_region(inner);
// In the current code this should always be `None`, but we have this here should
// we change that and want to know what we should be doing.
if let Some(closure) = initial_closure {
// If there is no starting arrangement, then we can run filters
// directly on the starting collection.
// If there is only one input, we are done joining, so run filters
let (j, errs) = joined.flat_map_fallible("LinearJoinInitialization", {
// Reuseable allocation for unpacking.
let mut datums = DatumVec::new();
move |row| {
let binding = SharedRow::get();
let mut row_builder = binding.borrow_mut();
let temp_storage = RowArena::new();
let mut datums_local = datums.borrow_with(&row);
// TODO(mcsherry): re-use `row` allocation.
closure
.apply(&mut datums_local, &temp_storage, &mut row_builder)
.map_err(DataflowError::from)
.transpose()
}
});
joined = j;
errors.push(errs);
}
JoinedFlavor::Collection(joined)
}
};
// progress through stages, updating partial results and errors.
for stage_plan in linear_plan.stage_plans.into_iter() {
// Different variants of `joined` implement this differently,
// and the logic is centralized there.
let stream = self.differential_join(
joined,
inputs[stage_plan.lookup_relation].enter_region(inner),
stage_plan,
&mut errors,
);
// Update joined results and capture any errors.
joined = JoinedFlavor::Collection(stream);
}
// We have completed the join building, but may have work remaining.
// For example, we may have expressions not pushed down (e.g. literals)
// and projections that could not be applied (e.g. column repetition).
if let JoinedFlavor::Collection(mut joined) = joined {
if let Some(closure) = linear_plan.final_closure {
let (updates, errs) = joined.flat_map_fallible("LinearJoinFinalization", {
// Reuseable allocation for unpacking.
let mut datums = DatumVec::new();
move |row| {
let binding = SharedRow::get();
let mut row_builder = binding.borrow_mut();
let temp_storage = RowArena::new();
let mut datums_local = datums.borrow_with(&row);
// TODO(mcsherry): re-use `row` allocation.
closure
.apply(&mut datums_local, &temp_storage, &mut row_builder)
.map_err(DataflowError::from)
.transpose()
}
});
joined = updates;
errors.push(errs);
}
// Return joined results and all produced errors collected together.
CollectionBundle::from_collections(
joined,
differential_dataflow::collection::concatenate(inner, errors),
)
} else {
panic!("Unexpectedly arranged join output");
}
.leave_region()
})
}
/// Looks up the arrangement for the next input and joins it to the arranged
/// version of the join of previous inputs.
fn differential_join<S>(
&self,
mut joined: JoinedFlavor<S, T>,
lookup_relation: CollectionBundle<S, T>,
LinearStagePlan {
stream_key,
stream_thinning,
lookup_key,
closure,
lookup_relation: _,
}: LinearStagePlan,
errors: &mut Vec<Collection<S, DataflowError, Diff>>,
) -> Collection<S, Row, Diff>
where
S: Scope<Timestamp = G::Timestamp>,
{
// If we have only a streamed collection, we must first form an arrangement.
if let JoinedFlavor::Collection(stream) = joined {
let (keyed, errs) = stream.map_fallible("LinearJoinKeyPreparation", {
// Reuseable allocation for unpacking.
let mut datums = DatumVec::new();
move |row| {
let binding = SharedRow::get();
let mut row_builder = binding.borrow_mut();
let temp_storage = RowArena::new();
let datums_local = datums.borrow_with(&row);
row_builder.packer().try_extend(
stream_key
.iter()
.map(|e| e.eval(&datums_local, &temp_storage)),
)?;
let key = row_builder.clone();
row_builder
.packer()
.extend(stream_thinning.iter().map(|e| datums_local[*e]));
let value = row_builder.clone();
Ok((key, value))
}
});
errors.push(errs);
// TODO(vmarcos): We should implement further arrangement specialization here (#22104).
// By knowing how types propagate through joins we could specialize intermediate
// arrangements as well, either in values or eventually in keys.
let arranged = keyed.mz_arrange::<RowRowSpine<_, _>>("JoinStage");
joined = JoinedFlavor::Local(MzArrangement::RowRow(arranged));
}
// Demultiplex the four different cross products of arrangement types we might have.
let arrangement = lookup_relation
.arrangement(&lookup_key[..])
.expect("Arrangement absent despite explicit construction");
use MzArrangement as A;
use MzArrangementImport as I;
match joined {
JoinedFlavor::Collection(_) => {
unreachable!("JoinedFlavor::Collection variant avoided at top of method");
}
JoinedFlavor::Local(local) => match arrangement {
ArrangementFlavor::Local(oks, errs1) => {
let (oks, errs2) = match (local, oks) {
(A::RowRow(prev_keyed), A::RowRow(next_input)) => self
.differential_join_inner::<_, RowRowAgent<_, _>, RowRowAgent<_, _>>(
prev_keyed, next_input, closure,
),
};
errors.push(errs1.as_collection(|k, _v| k.clone()));
errors.extend(errs2);
oks
}
ArrangementFlavor::Trace(_gid, oks, errs1) => {
let (oks, errs2) = match (local, oks) {
(A::RowRow(prev_keyed), I::RowRow(next_input)) => self
.differential_join_inner::<_, RowRowAgent<_, _>, RowRowEnter<_, _, _>>(
prev_keyed, next_input, closure,
),
};
errors.push(errs1.as_collection(|k, _v| k.clone()));
errors.extend(errs2);
oks
}
},
JoinedFlavor::Trace(trace) => match arrangement {
ArrangementFlavor::Local(oks, errs1) => {
let (oks, errs2) = match (trace, oks) {
(I::RowRow(prev_keyed), A::RowRow(next_input)) => self
.differential_join_inner::<_, RowRowEnter<_, _, _>, RowRowAgent<_, _>>(
prev_keyed, next_input, closure,
),
};
errors.push(errs1.as_collection(|k, _v| k.clone()));
errors.extend(errs2);
oks
}
ArrangementFlavor::Trace(_gid, oks, errs1) => {
let (oks, errs2) = match (trace, oks) {
(I::RowRow(prev_keyed), I::RowRow(next_input)) => self
.differential_join_inner::<_, RowRowEnter<_, _, _>, RowRowEnter<_, _, _>>(
prev_keyed, next_input, closure,
),
};
errors.push(errs1.as_collection(|k, _v| k.clone()));
errors.extend(errs2);
oks
}
},
}
}
/// Joins the arrangement for `next_input` to the arranged version of the
/// join of previous inputs. This is split into its own method to enable
/// reuse of code with different types of `next_input`.
///
/// The return type includes an optional error collection, which may be
/// `None` if we can determine that `closure` cannot error.
fn differential_join_inner<S, Tr1, Tr2>(
&self,
prev_keyed: Arranged<S, Tr1>,
next_input: Arranged<S, Tr2>,
closure: JoinClosure,
) -> (
Collection<S, Row, Diff>,
Option<Collection<S, DataflowError, Diff>>,
)
where
S: Scope<Timestamp = G::Timestamp>,
Tr1: TraceReader<Time = G::Timestamp, Diff = Diff> + Clone + 'static,
Tr2: for<'a> TraceReader<Key<'a> = Tr1::Key<'a>, Time = G::Timestamp, Diff = Diff>
+ Clone
+ 'static,
for<'a> Tr1::Key<'a>: ToDatumIter,
for<'a> Tr1::Val<'a>: ToDatumIter,
for<'a> Tr2::Val<'a>: ToDatumIter,
{
// Reuseable allocation for unpacking.
let mut datums = DatumVec::new();
if closure.could_error() {
let (oks, err) = self
.linear_join_spec
.render(
&prev_keyed,
&next_input,
self.shutdown_token.clone(),
move |key, old, new| {
let binding = SharedRow::get();
let mut row_builder = binding.borrow_mut();
let temp_storage = RowArena::new();
let key = key.to_datum_iter();
let old = old.to_datum_iter();
let new = new.to_datum_iter();
let mut datums_local = datums.borrow();
datums_local.extend(key);
datums_local.extend(old);
datums_local.extend(new);
closure
.apply(&mut datums_local, &temp_storage, &mut row_builder)
.map_err(DataflowError::from)
.transpose()
},
)
.inner
.ok_err(|(x, t, d)| {
// TODO(mcsherry): consider `ok_err()` for `Collection`.
match x {
Ok(x) => Ok((x, t, d)),
Err(x) => Err((x, t, d)),
}
});
(oks.as_collection(), Some(err.as_collection()))
} else {
let oks = self.linear_join_spec.render(
&prev_keyed,
&next_input,
self.shutdown_token.clone(),
move |key, old, new| {
let binding = SharedRow::get();
let mut row_builder = binding.borrow_mut();
let temp_storage = RowArena::new();
let key = key.to_datum_iter();
let old = old.to_datum_iter();
let new = new.to_datum_iter();
let mut datums_local = datums.borrow();
datums_local.extend(key);
datums_local.extend(old);
datums_local.extend(new);
closure
.apply(&mut datums_local, &temp_storage, &mut row_builder)
.expect("Closure claimed to never error")
},
);
(oks, None)
}
}
}