Data structure and operations for time-varying variable in...

Details Data structure and operations for time-varying variable in... Data structure and operations for time-varying variable in...

G - Physics

06

Q

G06Q 10/00 (2006.01)

Patent

CA 2339554

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.

La présente invention concerne un procédé permettant d'utiliser une arborescence binaire de données pour représenter une variable temporelle et pour résoudre des requêtes concernant la variable. Cette arborescence convient particulièrement à la solution de requêtes de type "trouver/find" telle que "quel est le premier/dernier instant à partir de quand on dispose de y unités?". Ce type de requête peut se résoudre avec une efficacité de O(log n), "n" étant le nombre de noeuds de l'arborescence.

Affiliated with

Also associated with

Rating

Data structure and operations for time-varying variable in... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Data structure and operations for time-varying variable in..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data structure and operations for time-varying variable in... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1582609