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

作者: David E. Joslin , Laerte F. Morgado

DOI:

关键词: AVL treeAlgorithmSegment treeInterval treeK-ary treeMathematicsTheoretical computer scienceTree (data structure)Binary treeVantage-point treeRange tree

摘要: A method of using a binary tree data structure to represent time-varying variable, and solve queries about the variable. The is especially useful for solving 'find' type queries, such as 'What earliest/latest time when minimum y units are on hand ?'. This query can be solved with an efficiency O(log n), where n number nodes tree.

参考文章(19)
Richard Brockman, Inventory pipeline management system ,(1997)
Richard Steele Richards, Polymorphic enhanced modeling ,(1998)
Gediminas Adomavicius, Alexander S. Tuzhilin, Method for determining actionable patterns in a database ,(1999)
Willibald Doeringer, Mehdi Nassehi, Mohan Sharma, Douglas Dykeman, Gunter Karjoth, Variable length data sequence backtracking a trie structure ,(1994)
Satwinder S. Mangat, Steven G. Mahlum, Wayne Taylor, Document reference environment manager ,(1997)
Ralph H. LaBedz, Jane M. Zeisloft, Nathaniel M. Sims, Daniel C. Kusswurm, John M. Turner, Managing an inventory of devices. ,(1994)
Neal Richard Eisenberg, Charles Siegfried Tribolet, John Marland Garth, Mary Claire Lehner, Robert Louis Huddleston, Versioned-database management system in which tasks are associated with promote groups which comprise a set of parts whose changes are to be promoted ,(1995)