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

Evaluate the IntervalTree as an alternative data structure for temporal indexing #14

Open
thilinamb opened this issue Mar 17, 2020 · 0 comments
Open

Evaluate the IntervalTree as an alternative data structure for temporal indexing #14

thilinamb opened this issue Mar 17, 2020 · 0 comments
Labels
enhancement New feature or request

Comments

@thilinamb
Copy link
Collaborator

Right now, we use TreeMaps (sorted based on the from attribute of a StrandStoageKey) to implement a temporal index. But IntervalTrees seem like a better fit.

We should do a performance comparison between the two approaches.

Usable IntervalTree implementation is available here.
@thilinamb thilinamb added the enhancement New feature or request label Mar 17, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement New feature or request
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@thilinamb