Interval tree for identifying intervals that intersect with a query interval

摘要

A method operable with a computing system is described for identifying which time interval keys within an interval tree intersect with a query interval. The method comprises accessing information from a node of the interval tree. The node comprises a time interval that identifies the earliest start time and latest end time amongst all time interval keys at or beneath the node within the interval tree. The method also comprises determining if one or more of the node's children have the potential to intersect a query interval based upon the time interval.