Data structure and operations for time-varying variable in an enterprise model

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 ty...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: JOSLIN, DAVID, E, MORGADO, LAERTE, F
Format: Patent
Sprache:eng ; fre ; ger
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 an efficiency of O(log n), where n is the number of nodes of the tree.