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

lazily-build IntervalTree indexes for data when overlap queries are made #433

Open
jmosbacher opened this issue Apr 27, 2021 · 0 comments
Open

Comments

@jmosbacher
Copy link
Contributor

Whats the problem?

Overlap queries using brute force algorithms can be expensive.

Proposed solution

It may be beneficial to build IntervalTrees from the data types that are queried for overlaps. Pandas has a cython implementation of an IntervalTree thats we can easily use since we already have pandas as a dependency.

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

No branches or pull requests

1 participant