Data structure and operations for time-varying variable in an enterprise model
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Apr 16, 2002
Grant Date -
N/A
app pub date -
Aug 11, 1999
filing date -
Aug 11, 1998
priority date (Note) -
In Force
status (Latency Note)
Importance
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.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully