Patent · US Active

Indexing stored data

US7761474B2 · kind B2 · utility

4Cited by
15References
20Claims
0Family size

Assignee

Inventors

Key dates

Filing dateJun 30, 2004
Grant dateJul 20, 2010
Priority date
Expiry dateJan 4, 2028

Classification

  • Technology area (CPC Y)Emerging Cross-Sectional Technologies
  • CPC primaryY10S707/956
  • WIPO fieldComputer technology
  • WIPO sectorElectrical engineering

Abstract

Methods and apparatus, including computer program products, for providing a data structure, embodied in a computer-readable medium, implementing a tree of nodes having inner nodes and leaf nodes, and performing a scan of the data structure to identify an entry that satisfies a search criterion. Each leaf node includes a key having a first value representing a starting point of an interval, a second value representing an ending point of an interval, and a third value representing a duration of an interval. Each inner node is a root node of a subtree. Each inner node includes a key having a first value representing a minimum of the starting points of intervals in the corresponding subtree, a second value representing a maximum of the ending points of the intervals in the corresponding subtree, and a third value representing a maximum duration of the intervals in the corresponding subtree.

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.