Saving and restoring an interlocking trees datastore
First Claim
1. A method of saving an interlocking trees data store from memory to permanent storage comprising the steps of:
- traversing the interlocking trees data store to access each node;
creating a node packet containing all information relevant to the node; and
writing the node packet to permanent storage;
wherein,the interlocking trees datastore structure comprising elemental root nodes, subcomponent nodes and end-product nodes using asCase and asResult bi-directional links used in determining paths within the interlocking trees datastore structure;
the asCase bi-directional link represents a pointer to a first of two nodes from which a particular node is created; and
the asResult bi-directional link represents a pointer to a second of two nodes from which the particular node is created.
10 Assignments
0 Petitions
Accused Products
Abstract
A tree-based datastore comprising a forest of interconnected trees that can be generated and/or accessed may require specialized saving and restoring processes to ensure that all the links are properly maintained whether it will be restored in full or in part. The processes act on known features of the trees based datastore to generate a file of metadata and packetize each of the nodes of the structure, carefully saving the links and lists of links with old memory addresses accounted for. When restoring the full or partial save to a new memory, a translation table is used to convert the addresses of the nodes and their links to appropriately matched locations in the new memory so that the structure of the data store can be reconstructed in the new location and ensuring that there is sufficient protected memory for the structure as the restore is accomplished.
111 Citations
16 Claims
-
1. A method of saving an interlocking trees data store from memory to permanent storage comprising the steps of:
-
traversing the interlocking trees data store to access each node; creating a node packet containing all information relevant to the node; and writing the node packet to permanent storage; wherein, the interlocking trees datastore structure comprising elemental root nodes, subcomponent nodes and end-product nodes using asCase and asResult bi-directional links used in determining paths within the interlocking trees datastore structure; the asCase bi-directional link represents a pointer to a first of two nodes from which a particular node is created; and the asResult bi-directional link represents a pointer to a second of two nodes from which the particular node is created. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A computer readable storage media containing encoded data comprising a set of instructions executable on a computing system which when executed configure said system to provide the facility to save and restore a trees based datastore, said set of instructions comprising:
-
a save set having; a first set to traverse the interlocking trees data store to access each node to be saved; a second set to create a node packet containing all information relevant to the node to be saved; and a third set to write the node to be saved as a packet created by the second set to permanent storage connected to said computing system; wherein, the interlocking trees datastore structure comprising elemental root nodes, subcomponent nodes and end-product nodes using asCase and asResult bi-directional links used in determining paths within the interlocking trees datastore structure; the asCase bi-directional link represents a pointer to a first of two nodes from which a particular node is created; and the asResult bi-directional link represents a pointer to a second of two nodes from which the particular node is created.
-
-
13. A computer system having an interlocking trees datastore in a memory of said computer system and having a saving means for saving said interlocking trees datastore for later restoration, said saving means comprising:
-
means for locating and saving all relevant header information including metadata relevant to restoring said interlocking trees data store, means for locating each node in said interlocking trees data store and means for saving all data about each located node in a packet form; wherein, the interlocking trees datastore comprising elemental root nodes, subcomponent nodes and end-product nodes using asCase and asResult bi-directional links used in determining paths within the interlocking trees datastore structure; the asCase bi-directional link represents a pointer to a first of two nodes from which a particular node is created; and the asResult bi-directional link represents a pointer to a second of two nodes from which the particular node is created. - View Dependent Claims (14, 15, 16)
-
Specification