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.

Sign up for GitHub

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

Jump to bottom

Faster projection/selection/restriction algorithms. #28

Closed
daemontus opened this issue Sep 1, 2021 · 1 comment
Closed

Faster projection/selection/restriction algorithms. #28

daemontus opened this issue Sep 1, 2021 · 1 comment
Labels
performance

Comments

@daemontus
Copy link
Member

daemontus commented Sep 1, 2021 •
edited
Loading

At the moment, projection, selection, restriction and picking are implemented using standard logical operations (albeit with minor optimisations using fused flip-ops). However, it should be possible to design specialised algorithms for these problems which should significantly outperform current solutions.
@daemontus daemontus changed the title Faster projection/selection algorithms. Faster projection/selection/restriction algorithms. May 3, 2022
@daemontus daemontus mentioned this issue May 3, 2022
Closed
@daemontus
Copy link
Member Author

These specialised algorithms are now part of the implementation as of 0.5.0. The only operation that cannot use them is pick. It would probably be possible to also optimise pick at some point, but considering how rarely it is used, there's probably no reason to do so.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
performance
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@daemontus