forked from apache/datafusion
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Physical plan can be further optimized. In particular, an expression can be determined as never null even if it wasn't known at the time of logical planning. Thus, the final schema check needs to be relax, allowing now-non-null data where nullable data was expected. This replaces schema equality check, with asymmetric "is satisfied by" relation.
- Loading branch information
Showing
4 changed files
with
84 additions
and
2 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,67 @@ | ||
use arrow_schema::{DataType, Field, Fields, Schema}; | ||
|
||
/// Verifies whether the original planned schema can be satisfied with data | ||
/// adhering to the candidate schema. In practice, this is equality check on the | ||
/// schemas except that original schema can have nullable fields where candidate | ||
/// is constrained to not provide null data. | ||
pub(crate) fn schema_satisfied_by(original: &Schema, candidate: &Schema) -> bool { | ||
original.metadata() == candidate.metadata() | ||
&& fields_satisfied_by(original.fields(), candidate.fields()) | ||
} | ||
|
||
/// See [`schema_satisfied_by`] for the contract. | ||
fn fields_satisfied_by<'a>(original: &Fields, candidate: &Fields) -> bool { | ||
original.len() == candidate.len() | ||
&& original | ||
.iter() | ||
.zip(candidate) | ||
.all(|(original, candidate)| field_satisfied_by(original, candidate)) | ||
} | ||
|
||
/// See [`schema_satisfied_by`] for the contract. | ||
fn field_satisfied_by(original: &Field, candidate: &Field) -> bool { | ||
original.name() == candidate.name() | ||
&& (original.is_nullable() || !candidate.is_nullable()) | ||
&& original.metadata() == candidate.metadata() | ||
&& data_type_satisfied_by(original.data_type(), candidate.data_type()) | ||
} | ||
|
||
/// See [`schema_satisfied_by`] for the contract. | ||
fn data_type_satisfied_by(original: &DataType, candidate: &DataType) -> bool { | ||
match (original, candidate) { | ||
(DataType::List(original_field), DataType::List(candidate_field)) => { | ||
field_satisfied_by(original_field, candidate_field) | ||
} | ||
|
||
(DataType::ListView(original_field), DataType::ListView(candidate_field)) => { | ||
field_satisfied_by(original_field, candidate_field) | ||
} | ||
|
||
( | ||
DataType::FixedSizeList(original_field, original_size), | ||
DataType::FixedSizeList(candidate_field, candidate_size), | ||
) => { | ||
original_size == candidate_size | ||
&& field_satisfied_by(original_field, candidate_field) | ||
} | ||
|
||
(DataType::LargeList(original_field), DataType::LargeList(candidate_field)) => { | ||
field_satisfied_by(original_field, candidate_field) | ||
} | ||
|
||
( | ||
DataType::LargeListView(original_field), | ||
DataType::LargeListView(candidate_field), | ||
) => field_satisfied_by(original_field, candidate_field), | ||
|
||
(DataType::Struct(original_fields), DataType::Struct(candidate_fields)) => { | ||
fields_satisfied_by(original_fields, candidate_fields) | ||
} | ||
|
||
// TODO (DataType::Union(, _), DataType::Union(_, _)) => {} | ||
// TODO (DataType::Dictionary(_, _), DataType::Dictionary(_, _)) => {} | ||
// TODO (DataType::Map(_, _), DataType::Map(_, _)) => {} | ||
// TODO (DataType::RunEndEncoded(_, _), DataType::RunEndEncoded(_, _)) => {} | ||
_ => original == candidate, | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters