Patent ID: 7213041

Claim:
A method of restoring an interlocking trees datastore from a saved interlocking trees datastore data file, wherein said method of restoring comprises: from said saved interlocking trees datastore data file, retrieving supporting information, wherein said saved interlocking trees datastore data file has at least one packet for each node to be restored, wherein said interlocking trees datastore after being restored has at least one elemental beginning root (BOT) node, at least one subcomponent node and at least a plurality of root nodes, wherein BOT nodes have a list of asCase pointers to subcomponent nodes, wherein said subcomponent nodes have a list of asCase pointers to other subcomponent nodes and wherein said root nodes have a list of asResult pointers to subcomponent nodes that depend from said BOT node, establishing an area in memory based upon at least some of said supporting information, iteratively reading node packets from said saved interlocking trees datastore data file until all node packets are read, and for each node packet read, allocating memory and having a new memory address assigned for new nodes created from read node packet in a main memory store on a computer system, creating an address translation table for each read node packet and adding information including at least an old memory address of said read node packet to said address translation table, said address translation table having a correspondence between said new memory address for each node packet from said allocating, and said old memory address for said read node packet, wherein prior to said reading, a determination is made as to what type of node packets is to be read, and said determination is made based upon reading a supporting information about node packets, and wherein said restoring an interlocking trees datastore from a saved interlocking trees datastore data file is based on said creating address translation table and said adding of information.