Data structure and operations for time-varying variable in an enterprise model
US6374249B1 · kind B1 · utility
4Cited by
16References
14Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Aug 11, 1999 |
| Grant date | Apr 16, 2002 |
| Priority date | — |
| Expiry date | Aug 11, 2019 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06Q10/06
- WIPO fieldIT methods for management
- WIPO sectorElectrical engineering
Abstract
A method of using a binary tree data structure to represent a time-varying variable, and to solve queries about the variable. The tree is especially useful for solving “find” type queries, such as “What is the earliest/latest time when a minimum of y units are on hand?” This type of query can be solved with a efficiency of O(log n), where n is the number of nodes of the tree.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.