1. A system that updates K datastores comprising: an engine for processing KStores, a KStore comprising an interlocking trees datastore comprising 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 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, wherein 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.