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

andCardinality and orCardinality could be faster/use less memory #46

Closed
lemire opened this issue Dec 3, 2015 · 2 comments
Closed

andCardinality and orCardinality could be faster/use less memory #46

lemire opened this issue Dec 3, 2015 · 2 comments
Labels
enhancement help wanted performance

Comments

@lemire
Copy link
Member

lemire commented Dec 3, 2015

Currently andCardinaly and orCardinality are implemented in such a way that intermediate containers are constructed and immediately discarded. This could be optimized significantly.
@lemire
Copy link
Member Author

lemire commented Apr 26, 2016

Actually, just implementing a faster andCardinality would be sufficient since we can deduce the union cardinality from the intersection cardinality given the cardinalities of the inputs.

@lemire
Copy link
Member Author

lemire commented Mar 17, 2017

Resolved as per this commit : 8a91ca4

@lemire lemire closed this as completed Mar 17, 2017
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement help wanted performance
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@lemire