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.
