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

[jmosbacher]

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.