Method for processing new sequences being recorded into an interlocking trees datastore
A method of recording information in an interlocking trees datastore having a plurality of K paths includes receiving a data stream input sequence and traversing the interlocking trees datastore in accordance with the received input sequence for recording the received input sequence within the interlocking trees datastore. First determining whether a K path of the plurality of K paths matches the input sequence is performed and second determining that a new sequence has been encountered in accordance with the first determining is performed. New structure is built in accordance with the second determining. A path of the plurality of paths has a plurality of K nodes including a current K node, an adjacent K node that is adjacent to the current K node, the adjacent K node having a non-adjacent K node that is not in the asCase list of the current K node.
1 . A method of recording information in an interlocking trees datastore having a plurality of K paths, comprising:
receiving a data stream input sequence;
traversing said interlocking trees datastore in accordance with said received data stream input sequence for recording said received data stream input sequence within said interlocking trees datastore;
first determining whether a K path of said plurality of K paths matches said data stream input sequence; and
second determining that a new sequence has been encountered in accordance with said first determining.
2 . The method of recording information in an interlocking trees datastore of claim 1 , comprising building new structure in accordance with said second determining.
3 . The method of recording information in an interlocking trees datastore of claim 1 , wherein a path of said plurality of paths has a plurality of K nodes including a current K node, an adjacent K node that is adjacent to said current K node, said adjacent K node having a non-adjacent K node that is not in the asCase list of said current K node further comprising traversing said interlocking trees datastore by determining a match between said non-adjacent K node an adjacent K node.
4 . The method of recording information in an interlocking trees datastore of claim 3 , wherein the non-adjacent K node is the K node matched to an input particle
5 . The method of recording information in an interlocking trees datastore of claim 3 , wherein said interlocking trees datastore includes a plurality of levels and the non-adjacent K node is some other K node of said plurality of K nodes.
6 . The method of recording information in an interlocking trees datastore of claim 3 , further comprising traversing said interlocking trees datastore in accordance with an asCase bi-directional link of a K node of said plurality of K nodes.
7 . The method of recording information in an interlocking trees datastore of claim 6 , further comprising determining said match in accordance with a Result pointer of a K node of said plurality of K nodes.
8 . The method of recording information in an interlocking trees datastore of claim 3 , further comprising traversing from a current K node location to an adjacent K node in accordance with said non-adjacent K node.
9 . The method of recording information in an interlocking trees datastore of claim 8 , further comprising determining said adjacent K node in accordance with an asCase list of said current K node.
10 . The method of recording information in an interlocking trees datastore of claim 8 , further comprising determining a match between said adjacent K node and a further K node.
11 . The method of recording information in an interlocking trees datastore of claim 10 , further comprising determining said match between said adjacent K node and an end node or a K node representing a further particle.
12 . The method of recording information in an interlocking trees datastore of claim 8 , wherein said current K node is a beginning of thought node.
13 . The method of recording information in an interlocking trees datastore of claim 8 , wherein said current K node is a subcomponent K node of said path of said plurality of paths.
14 . The method of recording information in an interlocking trees datastore of claim 1 , further comprising processing a new sequence event in accordance with said second determining.
15 . The method for recording information in an interlocking trees datastore of claim 14 , wherein said interlocking trees datastore is constructed by a KEngine further comprising processing a new sequence event by way of said KEngine.
16 . The method for recording information in an interlocking trees datastore of claim 14 , wherein said KEngine has a procedure further comprising processing a new sequence event in accordance with established parameter settings.
17 . The method of recording information in an interlocking trees datastore of claim 16 , further comprising reporting said new sequence in accordance with said established parameter settings.
18 . The method for recording information in an interlocking trees datastore of claim 16 , further comprising creating new KStore structure in accordance with said established parameter setting.
19 . The method for recording information in an interlocking trees datastore of claim 16 , further comprising instantiating a process in accordance with said established parameter setting.
20 . The method for recording information in an interlocking trees datastore of claim 16 , wherein said established parameter setting is obtained from a graphical user interface.
21 . The method for recording information in an interlocking trees datastore of claim 16 , wherein said established parameter setting is obtained from a calling procedure.
22 . The method for recording information in an interlocking trees datastore of claim 1 , further comprising determining a possible next K node in accordance with said first determining.
23 . The method for recording information in an interlocking trees datastore of claim 22 , further comprising:
determining a plurality of possible next K nodes wherein at least one possible next K node of said plurality of possible next K nodes has a node count; and
selecting said possible next K node in accordance with said node count.
24 . The method for recording information in an interlocking trees datastore of claim 22 , further comprising determining said possible next K in accordance with a context.
25 . The method for recording information in an interlocking trees datastore of claim 22 , further comprising determining said possible next K in accordance with how recently a node on the asCase list of a current node has been created.
26 . The method for recording information in an interlocking trees datastore of claim 22 , further comprising determining said possible next K in accordance with how recently a node on the asCase list of a current node has been accessed.
27 . The method for recording information in an interlocking trees datastore of claim 2 , further comprising locking said matched K node when said new K node is built.
28 . The method for recording information in an interlocking trees datastore of claim 1 , further comprising reporting said new sequence in accordance with said first determining.
29 . The method for recording information in an interlocking trees datastore of claim 28 , wherein said interlocking trees datastore is provided with a KEngine further comprising reporting said new sequence by way of said KEngine.
30 . The method for recording information in an interlocking trees datastore of claim 28 , wherein said interlocking trees datastore is accessed by way of a calling procedure further comprising reporting said new sequence by way of returning information to said calling procedure.
31 . A method for recording information in an interlocking trees datastore having at least one K node, comprising:
receiving a sequence having at least one input into said interlocking trees datastore;
first determining a mismatch between said at least one K node and said at least one input; and
second determining that said sequence is a new sequence in accordance with said determined mismatch.
32 . The method for recording information in an interlocking trees datastore of claim 31 , wherein said interlocking trees datastore includes a plurality of K paths having an end node and a plurality of K nodes and said sequence has a plurality of inputs associated with a plurality of sensors, further comprising:
receiving said sequence having said plurality of inputs into said interlocking trees datastore;
traversing at least one K path of said plurality of K paths in accordance with said plurality of inputs to provide a traversed K path;
determining a mismatch between a K node of said plurality of K nodes and an end node or a sensor to provide a mismatched K node and a mismatched end node or sensor;
determining that said sequence is a new sequence in accordance with said determined mismatch.
33 . The method for recording information in an interlocking trees datastore of claim 32 , further comprising traversing said at least one K path by determining a match between a current K node of said at least one K path and a matched sensor K node with an associated matched input.
34 . The method for recording information in an interlocking trees datastore of claim 33 , further comprising determining an adjacent K node of said current K node.
35 . The method for recording information in an interlocking trees datastore of claim 34 , further comprising determining said adjacent K node in accordance with an asCase list pointer of said current K node.
36 . The method for recording information in an interlocking trees datastore of claim 34 , further comprising first determining in accordance with a Result pointer of said adjacent K node.
37 . The method for recording information in an interlocking trees datastore of claim 31 , further comprising reporting said new sequence in accordance with said first determining.
38 . The method for recording information in an interlocking trees datastore of claim 37 , wherein said interlocking trees datastore is provided with a KEngine further comprising reporting said new sequence by way of said KEngine.
39 . The method for recording information in an interlocking trees datastore of claim 37 , wherein said KEngine has a calling procedure further comprising reporting said new sequence by having said KEngine return information to said calling procedure.
40 . The method for recording information in an interlocking trees datastore of claim 39 , wherein said interlocking trees datastore has a learn engine and said calling procedure comprises said learn engine.
41 . The method for recording information in an interlocking trees datastore of claim 39 , wherein said calling procedure comprises a query.
42 . The method for recording information in an interlocking trees datastore of claim 31 , further comprising reporting an event in accordance with said first determining.
43 . The method for recording information in an interlocking trees datastore of claim 42 , wherein said event comprises recording a best guess in said interlocking trees datastore.
44 . The method for recording information in an interlocking trees datastore of claim 31 , further comprising logging a message in accordance with said first determining.
45 . The method for recording information in an interlocking trees datastore of claim 31 , further comprising setting a lock flag in accordance with said first determining.
46 . The method for recording information in an interlocking trees datastore of claim 31 , further comprising determining a possible next K node in accordance with said first determining.
47 . The method for recording information in an interlocking trees datastore of claim 46 , further comprising:
determining a plurality of possible next K nodes, at least one possible next K node of said plurality of possible next K nodes having a node count; and
selecting said possible next K node in accordance with said node count.
48 . The method for recording information in an interlocking trees datastore of claim 31 , further comprising building a new K node in accordance with said first determining.
49 . The method for recording information in an interlocking trees datastore of claim 48 , further comprising locking said current K node when said new K node is built.
50 . The method for recording information in an interlocking trees datastore of claim 49 , further comprising establishing Case bi-directional links between said current K node and said new K node when said current K node is locked.
51 . The method for recording information in an interlocking trees datastore of claim 49 , further comprising locking said the Result node of said new K node when said new K node is built.
52 . The method for recording information in an interlocking trees datastore of claim 49 , further comprising updating the asResult list of said Result node of said new K node when said Result node of said new K node is locked.
53 . The method for recording information in an interlocking trees datastore of claim 48 , wherein said new K node has a new node count further comprising initializing said new node count.
54 . A system for recording information in an interlocking trees datastore having a plurality of K paths, comprising:
a received data stream input sequence;
a traversal of said interlocking trees datastore in accordance with said received data stream input sequence for recording said received data stream input sequence within said interlocking trees datastore;
a first determination whether a K path of said plurality of K paths matches said data stream input sequence; and
a second determination that a new sequence has been encountered in accordance with said first determination.
55 . The system for recording information in an interlocking trees datastore of claim 54 , comprising a new structure built in accordance with said second determination.
56 . The system for recording information in an interlocking trees datastore of claim 54 , wherein a path of said plurality of paths has a plurality of K nodes including a current K node, an adjacent K node that is adjacent to said current K node, said adjacent K node having a non-adjacent K node that is not in the asCase list of said current K node further comprising a traversal of said interlocking trees datastore determined by a match between said non-adjacent K node an adjacent K node.
57 . The system for recording information in an interlocking trees datastore of claim 56 , wherein the non-adjacent K node is the K node matched to an input particle
58 . The system for recording information in an interlocking trees datastore of claim 56 , wherein said interlocking trees datastore includes a plurality of levels and the non-adjacent K node is some other K node of said plurality of K nodes.
59 . The system for recording information in an interlocking trees datastore of claim 56 , further comprising a traversal of said interlocking trees datastore in accordance with an asCase bi-directional link of a K node of said plurality of K nodes.
60 . The system for recording information in an interlocking trees datastore of claim 59 , further comprising a determination of said match in accordance with a Result pointer of a K node of said plurality of K nodes.
61 . The system for recording information in an interlocking trees datastore of claim 56 , further comprising a traversal from a current K node location to an adjacent K node in accordance with said non-adjacent K node.
62 . The system for recording information in an interlocking trees datastore of claim 61 , further comprising a determination of said adjacent K node in accordance with an asCase list of said current K node.
63 . The system for recording information in an interlocking trees datastore of claim 61 , further comprising a determination of a match between said adjacent K node and a further K node.