作者: Darrell D. E. Long , Thomas M. Kroeger
DOI:
关键词: Mathematics 、 Computational complexity theory 、 Data structure 、 Partition (database) 、 Limiting 、 Out of memory 、 Model order 、 Theoretical computer science 、 Trie 、 Algorithm 、 Event tracking
摘要: A method of tracking events and their sequences in a computer system predicting the probability future using data structure that represents predictive nature after an initial event correlating to object system. The invention reduces memory requirements computational complexity by partitioning trie into subtries where each subtrie set events, statically limiting size partitions number descendants below node defining partition, refreshing parts children releasing slots occupied particular when additional space is needed. In addition, partition can be attached which it moved out with object. this way, structures would otherwise grow as large N O have predictions on order O×N, objects modeled model order, will limited which, turn, limits O.