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.
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.
-
Citations
21 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. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A method of restoring an interlocking trees data store from permanent storage to memory comprising the steps of:
-
Allocating memory and reading supporting structures required before the interlocking trees data store is restored, from permanent storage into memory reading each node packet and allocating memory for nodes—
creating a translation table of old memory addresses &
new memory addresses for each nodereading each node packet and reconstructing nodes and pointer lists Allocating memory and reading supporting structures that require address translation using the translation table to be restored, from permanent storage into memory. - View Dependent Claims (13)
-
-
14. A set of instructions executable on a computing system which when executed configure said system to provide the facility to save 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, a second set to create a node packet containing all information relevant to the node, and a third set to write the node created by the second set to permanent storage connected to said computing system.
-
15. A set of instructions, executable on a computing system which when executed configure said system to provide the facility to restore a trees based datastore, said set of instructions comprising:
a restore set, having;
instructions to reconstruct metadata, and an address translation table maintenance and using set for establishing an address translation table to convert addresses between addresses in saved packets and addresses in a restored interlocking trees datastore. - View Dependent Claims (16)
-
17. A computer system for running an interlocking trees datastore program so that an interlocking trees data store can function in a main memory of said computer system, said computer system having a program for saving said interlocking trees datastore and a program for restoring said interlocking trees datastore wherein addresses of said interlocking trees datastore and said restored interlocking trees datastore are not the same, said program for restoring said interlocking trees datastore having means to establish an address translation table to translate addresses found in node packets created by said save program to new addresses in said restored interlocking trees datastore.
-
18. 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. - View Dependent Claims (19, 20, 21)
-
Specification