Interval tree for identifying intervals that intersect with a query interval
US7512617B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Dec 29, 2004 |
| Grant date | Mar 31, 2009 |
| Priority date | — |
| Expiry date | Jan 18, 2026 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99942
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.