System and method for storing and accessing data in an interlocking trees datastore

A system for generating a datastore is disclosed. The system comprises: a processor; a memory coupled to the processor; and a datastore generator for creating a datastore. The datastore comprises: root nodes and non-root nodes, organized into a plurality of connected trees, where the plurality of connected trees comprise a tree of a first type comprising a first root and at least one of a plurality of non-root nodes, and at least one of a plurality of trees of a second type. The second tree type comprises a second root node and a plurality of non-root nodes common with the nodes of the tree of the first type, wherein the nodes of the datastore include at least one elemental node, one subcomponent node and one end product node. At least one elemental node comprises a first null pointer, a second null pointer, a third null pointer and a fourth pointer pointing to a second list of pointers to nodes, the second list comprising nodes which contain the elemental node as their second portion.