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
//! Transformation operations for query planning in FlowLog Datalog programs.
//!
//! This module provides the core transformation abstractions that define how data flows
//! through query execution plans. Transformations represent operations like filtering,
//! projection, joins, and aggregation that convert input collections into output collections.
use std::collections::HashMap;
use std::fmt;
use std::sync::Arc;
use tracing::trace;
use crate::catalog::JoinPredicates;
use crate::common::compute_fp;
use crate::planner::Collection;
mod flow;
mod info;
pub(crate) use flow::TransformationFlow;
pub(crate) use info::{KeyValueLayout, TransformationInfo};
/// Represents a data transformation operation in a query execution plan.
#[derive(Clone, Hash, Eq, PartialEq, Debug)]
pub(crate) enum Transformation {
// === Unary Transformations ===
/// Row-to-row transformation (filtering, projection, aggregation)
RowToRow {
input: Arc<Collection>,
output: Arc<Collection>,
flow: TransformationFlow,
},
/// Row-to-key-value transformation (structure rows into KV pairs).
/// Includes key-value, key-only, and value-only outputs.
RowToKv {
input: Arc<Collection>,
output: Arc<Collection>,
flow: TransformationFlow,
},
/// Key-value to row transformation
KvToRow {
input: Arc<Collection>,
output: Arc<Collection>,
flow: TransformationFlow,
},
/// Key-value to key-value transformation.
/// Includes key-value, key-only, and value-only outputs.
KvToKv {
input: Arc<Collection>,
output: Arc<Collection>,
flow: TransformationFlow,
},
// === Binary Transformations ===
/// Join: Key-value ⋈ Key-value to row transformation
JnToRow {
input: (Arc<Collection>, Arc<Collection>),
output: Arc<Collection>,
flow: TransformationFlow,
},
/// Join: Key-value ⋈ Key-value to key-value transformation.
/// Includes key-value, key-only, and value-only outputs.
JnToKv {
input: (Arc<Collection>, Arc<Collection>),
output: Arc<Collection>,
flow: TransformationFlow,
},
/// Antijoin: Key-value ¬ Key-only to row transformation
NJnToRow {
input: (Arc<Collection>, Arc<Collection>),
output: Arc<Collection>,
flow: TransformationFlow,
},
/// Antijoin: Key-only ¬ Key-only to key-value transformation.
/// Includes key-value, key-only, and value-only outputs.
NJnToKv {
input: (Arc<Collection>, Arc<Collection>),
output: Arc<Collection>,
flow: TransformationFlow,
},
}
// ========================
// Inspectors
// ========================
impl Transformation {
/// Returns `true` if this is a unary transformation.
pub(crate) fn is_unary(&self) -> bool {
matches!(
self,
Self::RowToRow { .. }
| Self::RowToKv { .. }
| Self::KvToRow { .. }
| Self::KvToKv { .. }
)
}
}
// ========================
// Getters
// ========================
impl Transformation {
/// Returns the input collection for unary transformations.
///
/// # Panics
///
/// Panics if called on a binary transformation. Use `is_unary()` to check first.
pub(crate) fn unary_input(&self) -> &Arc<Collection> {
match self {
Self::RowToRow { input, .. }
| Self::RowToKv { input, .. }
| Self::KvToRow { input, .. }
| Self::KvToKv { input, .. } => input,
_ => panic!("Planner error: unary_input called on binary transformation"),
}
}
/// Returns the input collections for binary transformations.
///
/// # Panics
///
/// Panics if called on a unary transformation. Use `is_unary()` to check first.
pub(crate) fn binary_input(&self) -> &(Arc<Collection>, Arc<Collection>) {
match self {
Self::JnToRow { input, .. }
| Self::JnToKv { input, .. }
| Self::NJnToRow { input, .. }
| Self::NJnToKv { input, .. } => input,
_ => panic!("Planner error: binary_input called on unary transformation"),
}
}
/// Returns the input fingerprint(s) for any transformation.
pub(crate) fn input_fingerprints(&self) -> Vec<u64> {
match self {
Self::RowToRow { input, .. }
| Self::RowToKv { input, .. }
| Self::KvToRow { input, .. }
| Self::KvToKv { input, .. } => vec![input.fingerprint()],
Self::JnToRow { input, .. }
| Self::JnToKv { input, .. }
| Self::NJnToRow { input, .. }
| Self::NJnToKv { input, .. } => vec![input.0.fingerprint(), input.1.fingerprint()],
}
}
/// Returns the output collection for any transformation.
pub(crate) fn output(&self) -> &Arc<Collection> {
match self {
Self::RowToRow { output, .. }
| Self::RowToKv { output, .. }
| Self::KvToRow { output, .. }
| Self::KvToKv { output, .. }
| Self::JnToRow { output, .. }
| Self::JnToKv { output, .. }
| Self::NJnToRow { output, .. }
| Self::NJnToKv { output, .. } => output,
}
}
/// Returns the transformation flow for any transformation.
pub(crate) fn flow(&self) -> &TransformationFlow {
match self {
Self::RowToRow { flow, .. }
| Self::RowToKv { flow, .. }
| Self::KvToKv { flow, .. }
| Self::KvToRow { flow, .. }
| Self::JnToRow { flow, .. }
| Self::JnToKv { flow, .. }
| Self::NJnToRow { flow, .. }
| Self::NJnToKv { flow, .. } => flow,
}
}
/// Return the transformation operation name.
pub(crate) fn operation_name(&self) -> &'static str {
match self {
Self::RowToRow { .. } => "[Row -> Row]",
Self::RowToKv { .. } => "[Row -> KV]",
Self::KvToRow { .. } => "[KV -> Row]",
Self::KvToKv { .. } => "[KV -> KV]",
Self::JnToRow { .. } => "[Join -> Row]",
Self::JnToKv { .. } => "[Join -> KV]",
Self::NJnToRow { .. } => "[AntiJoin -> Row]",
Self::NJnToKv { .. } => "[AntiJoin -> KV]",
}
}
/// Simplified operation label for profiler / visualizer output.
pub(crate) fn profile_operation_name(&self) -> &'static str {
match self {
Self::RowToRow { .. } => "Map",
Self::RowToKv { .. } => "Arrange",
Self::KvToRow { .. } => "Flatten",
Self::KvToKv { .. } => "Transform",
Self::JnToRow { input, .. } => {
if input.0.is_k_only() {
"SemiJoin"
} else {
"Join"
}
}
Self::JnToKv { input, .. } => {
if input.0.is_k_only() {
"SemiJoinMap"
} else {
"JoinMap"
}
}
Self::NJnToRow { .. } => "AntiJoin",
Self::NJnToKv { .. } => "AntiJoinMap",
}
}
}
/// Lineage fp → content fp; absent entries (name-based atom fps) pass through.
fn resolve_fp(fp_map: &HashMap<u64, u64>, fp: u64) -> u64 {
fp_map.get(&fp).copied().unwrap_or(fp)
}
// ========================
// Constructors
// ========================
impl Transformation {
/// Materialize a [`TransformationInfo`] into a [`Transformation`] whose
/// output fingerprint is content-canonical — `hash(variant tag, resolved
/// input fps, flow)`, all rhs_id-free — unlike the lineage info
/// fingerprints, which embed rule-local atom positions and defeat
/// cross-rule sharing.
///
/// `fp_map` (per rule, threaded in pipeline order) maps info fp →
/// content fp so inputs resolve to their producers; many info fps
/// mapping to one content fp is the intended sharing.
pub(crate) fn from_info(info: &TransformationInfo, fp_map: &mut HashMap<u64, u64>) -> Self {
// Tag mirrors the variant picked below, so equal fingerprints
// imply the same variant.
let (left, right) = info.input_info_fp();
let left_fp = resolve_fp(fp_map, left);
let right_fp = right.map(|fp| resolve_fp(fp_map, fp));
let tag = match info {
TransformationInfo::KVToKV { .. } => {
match (info.is_row_input(), info.is_row_output()) {
(true, true) => "row_to_row",
(true, false) => "row_to_kv",
(false, true) => "kv_to_row",
(false, false) => "kv_to_kv",
}
}
TransformationInfo::JoinToKV { .. } => {
if info.is_row_output() {
"jn_to_row"
} else {
"jn_to_kv"
}
}
TransformationInfo::AntiJoinToKV { .. } => {
if info.is_row_output() {
"njn_to_row"
} else {
"njn_to_kv"
}
}
};
let tx = match info {
TransformationInfo::KVToKV { .. } => Self::kv_to_kv(info, tag, left_fp),
TransformationInfo::JoinToKV { .. } => {
Self::join(info, tag, left_fp, right_fp.unwrap())
}
TransformationInfo::AntiJoinToKV { .. } => {
Self::antijoin(info, tag, left_fp, right_fp.unwrap())
}
};
fp_map.insert(info.output_info_fp(), tx.output().fingerprint());
tx
}
/// Creates a unary transformation from input/output key-value layouts.
///
/// This method analyzes the input and output layouts to determine the specific
/// transformation type needed (RowToRow, RowToKv, KvToRow, or KvToKv).
///
/// # Arguments
///
/// * `info` - TransformationInfo containing input/output layouts and constraints
///
/// # Returns
///
/// A Transformation variant appropriate for the input/output layout combination:
/// - `RowToRow`: Row input → Row output (filtering/projection on flat rows)
/// - `RowToKv`: Row input → Key-value output (structuring rows into KV pairs)
/// - `KvToRow`: Key-value input → Row output (flattening KV pairs into rows)
/// - `KvToKv`: Key-value input → Key-value output (re-keying / re-structuring)
fn kv_to_kv(info: &TransformationInfo, tag: &'static str, input_fp: u64) -> Self {
trace!("Creating kv_to_kv transformation with info:\n{}", info);
// Create the transformation flow that defines how data moves through the operation
let flow = TransformationFlow::kv_to_kv(
info.input_kv_layout().0,
info.output_kv_layout(),
info.kv_predicates(),
);
let output_fp = compute_fp((tag, input_fp, &flow));
let input = Arc::new(Collection::new(
input_fp,
info.input_name().0.to_string(),
info.input_kv_layout().0.key(),
info.input_kv_layout().0.value(),
));
let output = Arc::new(Collection::new(
output_fp,
info.output_name().to_string(),
info.output_kv_layout().key(),
info.output_kv_layout().value(),
));
match (info.is_row_input(), info.is_row_output()) {
// Row in, Row out: filtering, projection, or aggregation on flat rows.
(true, true) => Self::RowToRow {
input,
output,
flow,
},
// Row in, KV out: structure flat rows into key-value pairs.
(true, false) => Self::RowToKv {
input,
output,
flow,
},
// KV in, Row out: flatten key-value pairs back into rows.
(false, true) => Self::KvToRow {
input,
output,
flow,
},
// KV in, KV out: re-key or re-structure an existing KV layout.
(false, false) => Self::KvToKv {
input,
output,
flow,
},
}
}
/// Creates a join transformation between two collections.
///
/// This method automatically determines the appropriate join type based on the
/// input collection characteristics and join key presence. It supports equi-joins,
/// cartesian products, and various key/value combinations.
///
/// # Arguments
///
/// * `info` - TransformationInfo containing both input layouts and output structure
///
/// # Returns
///
/// A binary join Transformation variant chosen by the output layout:
/// - `JnToRow`: Key-value ⋈ Key-value producing a flat row output
/// - `JnToKv`: Key-value ⋈ Key-value producing a key-value output
fn join(info: &TransformationInfo, tag: &'static str, left_fp: u64, right_fp: u64) -> Self {
// Create transformation flow that defines how the join operation processes data
let flow = TransformationFlow::join_to_kv(
info.input_kv_layout().0,
info.input_kv_layout().1.unwrap(),
info.output_kv_layout(),
info.join_predicates(),
);
let output_fp = compute_fp((tag, left_fp, right_fp, &flow));
let input = (
Arc::new(Collection::new(
left_fp,
info.input_name().0.to_string(),
info.input_kv_layout().0.key(),
info.input_kv_layout().0.value(),
)),
Arc::new(Collection::new(
right_fp,
info.input_name().1.unwrap().to_string(),
info.input_kv_layout().1.unwrap().key(),
info.input_kv_layout().1.unwrap().value(),
)),
);
let output = Arc::new(Collection::new(
output_fp,
info.output_name().to_string(),
info.output_kv_layout().key(),
info.output_kv_layout().value(),
));
if info.is_row_output() {
Self::JnToRow {
input,
output,
flow,
}
} else {
Self::JnToKv {
input,
output,
flow,
}
}
}
/// Creates an antijoin transformation.
///
/// Antijoins are used for filtering operations where tuples from the left collection
/// are excluded if they have matching keys in the right collection. This is commonly
/// used for implementing logical negation in Datalog rules.
///
/// # Arguments
///
/// * `info` - TransformationInfo containing both input layouts (left must be key-only)
///
/// # Returns
///
/// A binary antijoin Transformation variant chosen by the output layout:
/// - `NJnToRow`: Key-only ¬⋈ Key-only producing a flat row output
/// - `NJnToKv`: Key-only ¬⋈ Key-only producing a key-value output
///
/// # Panics
///
/// Panics if the left collection is not key-only, as antijoins require the left
/// collection to contain only keys for filtering purposes.
fn antijoin(info: &TransformationInfo, tag: &'static str, left_fp: u64, right_fp: u64) -> Self {
// Antijoins require the left collection to be key-only (used for filtering)
assert!(
info.input_kv_layout().0.value().is_empty(),
"Planner error: antijoin - left collection must be key-only"
);
// Create transformation flow (no comparison expressions for antijoins)
let flow = TransformationFlow::join_to_kv(
info.input_kv_layout().0,
info.input_kv_layout().1.unwrap(),
info.output_kv_layout(),
&JoinPredicates::default(), // No predicates for antijoins
);
let output_fp = compute_fp((tag, left_fp, right_fp, &flow));
let input = (
Arc::new(Collection::new(
left_fp,
info.input_name().0.to_string(),
info.input_kv_layout().0.key(),
info.input_kv_layout().0.value(),
)),
Arc::new(Collection::new(
right_fp,
info.input_name().1.unwrap().to_string(),
info.input_kv_layout().1.unwrap().key(),
info.input_kv_layout().1.unwrap().value(),
)),
);
let output = Arc::new(Collection::new(
output_fp,
info.output_name().to_string(),
info.output_kv_layout().key(),
info.output_kv_layout().value(),
));
if info.is_row_output() {
Self::NJnToRow {
input,
output,
flow,
}
} else {
Self::NJnToKv {
input,
output,
flow,
}
}
}
}
impl fmt::Display for Transformation {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
writeln!(f, "{}", self.operation_name())?;
if self.is_unary() {
writeln!(f, " In : {}", self.unary_input())?;
} else {
let (left, right) = self.binary_input();
writeln!(f, " Left : {}", left)?;
writeln!(f, " Right: {}", right)?;
}
writeln!(f, " Flow : {}", self.flow())?;
writeln!(f, " Out : {}", self.output())
}
}