Saving and restoring an interlocking trees datastore

Details Saving and restoring an interlocking trees datastore Saving and restoring an interlocking trees datastore

G - Physics

06

F

G06F 7/00 (2006.01)

Patent

CA 2582727

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. A previous process acted 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. This shows how to build a save file without saving all links, using a new restore process to restore the links instead.

Un magasin de données à structure arborescente comprenant une forêt d'arbres interconnectés qui peuvent être générés et/ou contactés nécessite des procédés de sauvegarde et de restauration spécialisés afin de garantir que tous les liens sont maintenus correctement lors de sa restauration complète ou partielle. L'invention repose sur un procédé antérieur conforme aux caractéristiques connues du magasin de données à structure arborescente qui permet de générer un fichier de données et de mettre en paquets chaque noeud de la structure tout en sauvegardant minutieusement les liens et les listes de liens comportant les anciennes adresses en mémoire. Cette invention permet de construire un fichier sûr sans sauvegarder tous les liens au moyen d'un nouveau procédé qui consiste à restaurer de préférence les liens.

Affiliated with

Also associated with

Rating

Saving and restoring an interlocking trees datastore does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Saving and restoring an interlocking trees datastore, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Saving and restoring an interlocking trees datastore will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1962625