Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

feat: ParquetExec predicate preservation #5495

Merged
merged 1 commit into from
Mar 7, 2023

Conversation

crepererum
Copy link
Contributor

Which issue does this PR close?

-

Rationale for this change

  • Add public getter for ParquetExec::predicate. This should allow phys. optimizer passes to inspect the actual predicate.
  • Use the actual predicate (not the pruning one which may contain less data) for serialization. This should avoid some confusion where predicates (when they are not used for pruning) are lost.

What changes are included in this PR?

See rationale.

Are these changes tested?

-

Are there any user-facing changes?

Improved ParquetExec handling.

- Add public getter for `ParquetExec::predicate`. This should allow
  phys. optimizer passes to inspect the actual predicate.
- Use the actual predicate (not the pruning one which may contain less
  data) for serialization. This should avoid some confusion where
  predicates (when they are not used for pruning) are lost.
@github-actions github-actions bot added the core Core DataFusion crate label Mar 7, 2023
Copy link
Contributor

@alamb alamb left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

LGTM -- thanks @crepererum

@alamb alamb merged commit 50e9d78 into apache:main Mar 7, 2023
@andygrove andygrove added the enhancement New feature or request label Mar 12, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
core Core DataFusion crate enhancement New feature or request
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants