Transforming unrelated data volumes into related data volumes

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000, C711S162000

Reexamination Certificate

active

07664793

ABSTRACT:
Disclosed is an apparatus and method for transforming unrelated data volumes into related data volumes. The present invention is employed after creation of first and second unrelated data volumes. In one embodiment, the second data volume is refreshed to the data contents of the first data volume so that the second data becomes a PIT copy of the first data volume. Refreshing the second data volume includes overwriting all data of the second data volume with data copied from the first data volume. However, before all data of the second data volume is overwritten with data copied from the first data volume, data of the first data volume can be modified.

REFERENCES:
patent: 4096567 (1978-06-01), Millard et al.
patent: 5155824 (1992-10-01), Edenfield et al.
patent: 5210866 (1993-05-01), Milligan et al.
patent: 5497483 (1996-03-01), Beardsley et al.
patent: 5506580 (1996-04-01), Whiting et al.
patent: 5532694 (1996-07-01), Mayers et al.
patent: 5574874 (1996-11-01), Jones et al.
patent: 5610893 (1997-03-01), Soga et al.
patent: 5649152 (1997-07-01), Ohran et al.
patent: 5778395 (1998-07-01), Whiting et al.
patent: 5835953 (1998-11-01), Ohran
patent: 5875479 (1999-02-01), Blount et al.
patent: 5907672 (1999-05-01), Matze et al.
patent: 6061770 (2000-05-01), Franklin
patent: 6073222 (2000-06-01), Ohran
patent: 6085298 (2000-07-01), Ohran
patent: 6141734 (2000-10-01), Razdan et al.
patent: 6189079 (2001-02-01), Micka et al.
patent: 6269431 (2001-07-01), Dunham
patent: 6282610 (2001-08-01), Bergsten
patent: 6338114 (2002-01-01), Paulsen et al.
patent: 6341341 (2002-01-01), Grummon et al.
patent: 6353878 (2002-03-01), Dunham
patent: 6434681 (2002-08-01), Armangau
patent: 6460054 (2002-10-01), Grummon
patent: 6564301 (2003-05-01), Middleton
patent: 6591351 (2003-07-01), Urabe et al.
patent: 6611901 (2003-08-01), Micka et al.
patent: 6643667 (2003-11-01), Arai et al.
patent: 6643671 (2003-11-01), Milillo et al.
patent: 6665815 (2003-12-01), Goldstein et al.
patent: 6691245 (2004-02-01), DeKoning
patent: 6771843 (2004-08-01), Huber et al.
patent: 6785789 (2004-08-01), Kekre et al.
patent: 6792518 (2004-09-01), Armangau et al.
patent: 6799258 (2004-09-01), Linde
patent: 7085901 (2006-08-01), Homma et al.
patent: 2003/0041220 (2003-02-01), Peleska
patent: 2003/0158834 (2003-08-01), Sawdon et al.
patent: 2003/0158862 (2003-08-01), Eshel et al.
patent: 2005/0108302 (2005-05-01), Rand et al.
patent: 0 332 210 (1989-09-01), None
patent: 0 566 966 (1993-10-01), None
patent: 1 091 283 (2001-04-01), None
Article entitled “Veritas Flashsnap Point-in-Time Copy Solutions”, by: Veritas, dated Jun. 24, 2002.
Article entitled Veritas FlashSnap: Guidelines for Using Veritas FlashSnap, by: Veritas, dated May 1, 2002.
Article entitled Veritas FlashSnap: Using Veritas FlashSnap to Protect Application Performance and Availability, by: Veritas, dated May 14, 2002.
Article entitled “Shadow Copied of Shared Folders: Frequently Asked Questions”, by: Microsoft, dated Mar. 3, 2003.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Transforming unrelated data volumes into related data volumes does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Transforming unrelated data volumes into related data volumes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transforming unrelated data volumes into related data volumes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4215151

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.