Skip to content

Optimize intersect iterator - sort from low to high #1880

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

Closed
ashtul opened this issue Feb 28, 2021 · 0 comments · Fixed by #1881
Closed

Optimize intersect iterator - sort from low to high #1880

ashtul opened this issue Feb 28, 2021 · 0 comments · Fixed by #1881
Assignees
Labels
x:perf Performance Improvement

Comments

@ashtul
Copy link
Contributor

ashtul commented Feb 28, 2021

Sort intersect iterator from a low to a high number of estimated results.
This will minimize the number of iteration we make.

@ashtul ashtul added the x:perf Performance Improvement label Feb 28, 2021
@ashtul ashtul self-assigned this Feb 28, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
x:perf Performance Improvement
Projects
None yet
Development

Successfully merging a pull request may close this issue.

1 participant