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

fix(core): improve dead-loop avoidance in OptimizeInputs (v2) #206

Merged
merged 4 commits into from
Nov 1, 2024

Conversation

jopereira
Copy link
Contributor

Currently, OptimizeInputsTask avoids a dead-loop with a sequential traversal of a potentially long list of tasks, with a dynamic cast for each of them (see #29). This alternative uses a hashset of previously visited expressions for the same purpose, similarly to explored_group.

This is the second attempt, after #196.

This avoids the sequential traversal of the tasks queue (that gets
quite large) with a dynamic cast for each task (which is slow), every
time an OptimizeInputs runs. See cmu-db#29 for original code. This does
however consume more memory.
@skyzh skyzh merged commit bdf638a into cmu-db:main Nov 1, 2024
1 check passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants