Saving and restoring an interlocking trees datastore

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

2007-05-01

2007-05-01

Truong, Cam-Y (Department: 2162)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000, C707S793000

Reexamination Certificate

active

10958830

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. 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.

REFERENCES:
patent: 4286330 (1981-08-01), Isaacson
patent: 5245337 (1993-09-01), Bugajski
patent: 5293164 (1994-03-01), Bugajski
patent: 5592667 (1997-01-01), Bugajski
patent: 5630125 (1997-05-01), Zellweger
patent: 5829004 (1998-10-01), Au
patent: 5963965 (1999-10-01), Vogel
patent: 5966709 (1999-10-01), Zhang
patent: 5978794 (1999-11-01), Agrawal et al.
patent: 5983232 (1999-11-01), Zhang
patent: 6018734 (2000-01-01), Zhang
patent: 6029170 (2000-02-01), Garger
patent: 6031993 (2000-02-01), Andrews et al.
patent: 6102958 (2000-08-01), Meystel
patent: 6115715 (2000-09-01), Traversat et al.
patent: 6138115 (2000-10-01), Agrawal et al.
patent: 6138117 (2000-10-01), Bayardo
patent: 6160549 (2000-12-01), Touma et al.
patent: 6275817 (2001-08-01), Reed et al.
patent: 6278987 (2001-08-01), Reed et al.
patent: 6286002 (2001-09-01), Axaopoulos et al.
patent: 6341281 (2002-01-01), MacNicol et al.
patent: 6360224 (2002-03-01), Chickering
patent: 6381600 (2002-04-01), Lau
patent: 6389406 (2002-05-01), Reed et al.
patent: 6394263 (2002-05-01), McCrory
patent: 6453314 (2002-09-01), Chan et al.
patent: 6470277 (2002-10-01), Chin et al.
patent: 6473757 (2002-10-01), Garofalakis et al.
patent: 6499026 (2002-12-01), Rivette et al.
patent: 6505184 (2003-01-01), Reed et al.
patent: 6581063 (2003-06-01), Kirkman
patent: 6604114 (2003-08-01), Toong et al.
patent: 6615202 (2003-09-01), Ding et al.
patent: 6624762 (2003-09-01), End, III
patent: 6662185 (2003-12-01), Stark et al.
patent: 6681225 (2004-01-01), Uceda-Sosa et al.
patent: 6684207 (2004-01-01), Greenfield et al.
patent: 6691109 (2004-02-01), Bjornson et al.
patent: 6745194 (2004-06-01), Burrows
patent: 6748378 (2004-06-01), Lavender et al.
patent: 6760720 (2004-07-01), De Bellis
patent: 6769124 (2004-07-01), Schoening et al.
patent: 6804688 (2004-10-01), Kobayashi et al.
patent: 6807541 (2004-10-01), Bender et al.
patent: 6816856 (2004-11-01), Baskins et al.
patent: 6826556 (2004-11-01), Miller et al.
patent: 6831668 (2004-12-01), Cras et al.
patent: 6868414 (2005-03-01), Khanna et al.
patent: 6895490 (2005-05-01), Moore et al.
patent: 6900807 (2005-05-01), Liongosari et al.
patent: 6931401 (2005-08-01), Gibson et al.
patent: 6952736 (2005-10-01), Westbrook
patent: 6965892 (2005-11-01), Uceda-Sosa et al.
patent: 2002/0124003 (2002-09-01), Rajasekaran et al.
patent: 2002/0138353 (2002-09-01), Schreiber et al.
patent: 2002/0188613 (2002-12-01), Chakraborty et al.
patent: 2002/0194173 (2002-12-01), Bjornson et al.
patent: 2003/0033279 (2003-02-01), Gibson et al.
patent: 2003/0093424 (2003-05-01), Chun et al.
patent: 2003/0115176 (2003-06-01), Bobroff et al.
patent: 2003/0120651 (2003-06-01), Bernstein
patent: 2003/0177149 (2003-09-01), Coombs
patent: 2003/0204513 (2003-10-01), Bumbulis
patent: 2003/0204515 (2003-10-01), Shadmon et al.
patent: 2004/0107186 (2004-06-01), Najork et al.
patent: 2004/0133590 (2004-07-01), Henderson et al.
patent: 2004/0143571 (2004-07-01), Bjornson et al.
patent: 2004/0230560 (2004-11-01), Elza et al.
patent: 2004/0249781 (2004-12-01), Anderson
patent: 2005/0015383 (2005-01-01), Harjanto
patent: 2005/0050054 (2005-03-01), Clark et al.
patent: 2005/0071370 (2005-03-01), Atschul et al.
patent: 2005/0080800 (2005-04-01), Parupudi et al.
patent: 2005/0097108 (2005-05-01), Wang et al.
patent: 2005/0102294 (2005-05-01), Coldewey
patent: 2005/0149503 (2005-07-01), Raghavachari
patent: 2005/0171960 (2005-08-01), Lomet
patent: 2005/0262108 (2005-11-01), Gupta
patent: 0 079 465 (1985-01-01), None
patent: WO 95/17783 (1995-06-01), None
patent: W/O 02/063498 (2002-08-01), None
patent: WO 02/063498 (2002-08-01), None
Gschia-Yuan Teng & David L. Neuhoff, “An Improved Hierarchical Lossless Text Compression Algrithm”, Proceedings 1995 Data Compression Conference.
Won Kim & Myung Kim, “Performance and Scaleability in Knowledge Engineering: Issues and Solutions”, Journal of Object-Oriented Programming, vol. 12, No. 7, pp. 39-43, Nov./Dec. 1999.
Jeffrey O. Kephart & David M. Chess, “The Vision of Autonomic Computing”, T.J. Watson Research Jan 2003.
Linda Dailey Paulson, “Computer System, Heal Thyself”, Aug. 2003.
Dave Gussow, “Headline: IBM-Enterprise Storage Server Shines at Colgate Palmolive”, Jan. 6, 2003.
Caroline Humer, “IBM Creates Self-Healing Computer Unit”, Jan. 8, 2003.

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: LFUS-PAI-O-3815362