1. A computer-based system that updates KStores datastores within randomly accessible memory attached to the computer-based system, the system comprising: an engine for processing KStores, a KStore comprising an interlocking trees datastore comprising: a processor; elemental root nodes: subcomponent nodes; and end product nodes linked by asCase and asResult bi-directional links that create asCase and asResult paths within the interlocking trees datastore; wherein an asCase link represents a link to the first of the two nodes from which a node is created; and asResult link represents a link to the second of the two nodes from which a node is created; an asCase path comprises a sequence of subcomponent nodes linked with bi-directional asCase links ending with an end product node and where each subcomponent node in the asCase path has a bi-directional asResult link to an elemental root node or end product node comprising an asResult tree; the KStore processing engine updates an existing KStore to create an updated KStore by updating counts of analogous nodes based on the counts of the nodes in the updating KStore; and the portion of the updating KStore is isolated by following links of root nodes to subcomponent nodes, traversing an asCase path of the subcomponent node to an end product node of the asCase path, and determining a count associated with the isolated portion of the updating KStore.