System and method for performing an image level snapshot and for restoring partial volume data -> Monitor Keywords
Fresh Patents
Monitor Patents Patent Organizer How to File a Provisional Patent Browse Inventors Browse Industry Browse Agents Browse Locations
     new ** File a Provisional Patent ** 
site info Site News  |  monitor Monitor Keywords  |  monitor archive Monitor Archive  |  organizer Organizer  |  account info Account Info  |  
08/09/07 | 75 views | #20070185940 | Prev - Next | USPTO Class 707 | About this Page  707 rss/xml feed  monitor keywords

System and method for performing an image level snapshot and for restoring partial volume data

USPTO Application #: 20070185940
Title: System and method for performing an image level snapshot and for restoring partial volume data
Abstract: The present invention relates to a method for performing an image level copy of an information store. The present invention comprises performing a snapshot of an information store that indexes the contents of the information store, retrieving data associated with the contents of the information store from a file allocation table, copying the contents of the information store to a storage device based on the snapshot, and associating the retrieved data with the copied contents to provide file system information for the copied contents.
(end of abstract)
Agent: Perkins Coie LLP Patent-sea - Seattle, WA, US
Inventors: Anand Prahlad, David Ngo, Prakash Varadharajan, Rahual Pawar, Avinash Kumar
USPTO Applicaton #: 20070185940 - Class: 707204000 (USPTO)
Related Patent Categories: Data Processing: Database And File Management Or Data Structures, File Or Database Maintenance, Coherency (e.g., Same View To Multiple Users), Archiving Or Backup
The Patent Description & Claims data below is from USPTO Patent Application 20070185940.
Brief Patent Description - Full Patent Description - Patent Application Claims  monitor keywords

[0001] Applicant(s) hereby claim the benefit of provisional patent application Ser. Nos. 60/519,876 and 60/519,576, entitled "SYSTEM AND METHOD FOR PERFORMING A SNAPSHOT AND FOR RESTORING DATA," and "SYSTEM AND METHOD FOR PERFORMING AN IMAGE LEVEL SNAPSHOT AND FOR RESTORING PARTIAL VOLUME DATA," respectively, each filed on Nov. 13, 2003, attorney docket Nos. 4982/41PROV and 4982/47PROV, respectively. These applications are incorporated by reference herein in their entirety.

COPYRIGHT NOTICE

[0002] A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosures, as it appears in the Patent and Trademark Office patent files or records, but otherwise reserves all copyright rights whatsoever.

RELATED APPLICATIONS

[0003] This application is related to the following patents and pending patent applications, each of which is hereby incorporated herein by reference in its entirety: [0004] U.S. Pat. No. 6,418,478, entitled "PIPELINED HIGH SPEED DATA TRANSFER MECHANISM," issued Jul. 9, 2002, attorney docket number 4982/6; [0005] Application Ser. No. 09/610,738, entitled "MODULAR BACKUP AND RETRIEVAL SYSTEM USED IN CONJUNCTION WITH A STORAGE AREA NETWORK," filed Jul. 6, 2000, attorney docket number 4982/8; [0006] Application Ser. No. 09/744,268, entitled "LOGICAL VIEW AND ACCESS TO PHYSICAL STORAGE IN MODULAR DATA AND STORAGE MANAGEMENT SYSTEM," filed Jan. 30, 2001, attorney docket number 4982/10; [0007] Application Ser. No. 60/409,183, entitled "DYNAMIC STORAGE DEVICE POOLING IN A COMPUTER SYSTEM," filed Sep. 9, 2002, attorney docket number 4982/18PROV; [0008] Application Ser. No. 10/681,386 entitled "SYSTEM AND METHOD FOR MANAGING STORED DATA," filed Oct. 7, 2003, attorney docket number 4982/29; and [0009] Application Ser. No. 60/460,234, entitled "SYSTEM AND METHOD FOR PERFORMING STORAGE OPERATIONS IN A COMPUTER NETWORK," filed Apr. 3, 2003, attorney docket number 4982/35PROV.

BACKGROUND OF THE INVENTION

[0010] The invention disclosed herein relates generally to a system and method for performing a snapshot and for restoring data. More particularly, the present invention relates to a system and method for performing snapshots of an information store, which are stored across multiple storage devices, and for restoring partial or full snapshots.

[0011] To obtain a more thorough understanding of the present invention, the following discussion provides additional understanding regarding the manner is which magnetic media is used to store information. Using traditional techniques, copies of an information store are performed using the operating system's file system. Copying is done by accessing the operating system's (OS) file system for the information store to be backed-up, such as the Windows NTFS file system. The file allocation system of the operating system typically uses a file allocation table to keep track of the physical or logical clusters across which each file in the information store is stored. Also called an allocation unit, a cluster is a given number of disk sectors that are treated as a unit, each disk sector storing a number of bytes of data. This unit, the cluster, is the smallest unit of storage the operating system can manage. For example, on a computer running Microsoft's Windows 95 operating system, the OS uses the Windows FAT32 32-bit file allocation table having a cluster size to 4K. The number of sectors is determined when the disk is formatted by a formatting program, generally, but not necessarily, when the OS is installed.

[0012] The operating system allocates disk space for a file only when needed. That is, the data space is not preallocated but allocated dynamically. The space is allocated one cluster at a time, where a cluster is a given number of consecutive disk sectors. The clusters for a file are chained together, and kept track of, by entries in a file allocation table (FAT).

[0013] The clusters are arranged on the disk to minimize the disk head movement. For example, all of the space on a track is allocated before moving on to the next track. This is accomplished by using the sequential sectors on the lowest-numbered cylinder of the lowest numbered platter, then all sectors in the cylinder on the next platter, and so on, until all sectors on all platters of the cylinder are used. This is performed sequentially across the entire disk, for example, the next sector to be used will be sector 1 on platter 0 of the next cylinder.

[0014] For a hard (fixed) disk, FAT, sector, cluster, etc. size is determined when a disk formatting program formats the disk, and are based on the size of the partition. To locate all of the data that is associated with a particular file stored on a hard disk, the starting cluster of the file is obtained from the directory entry, then the FAT is referenced to locate the next cluster associated with the file. Essentially, the FAT is a linked list of pointers to clusters on the disk, e.g., each 16-bit FAT entry for a file points to the next sequential cluster used for that file. The last entry for a file in the FAT has a number indicating that no more clusters follow. This number can be from FFF8 to FFFF (base 16) inclusive.

[0015] FIG. 1 shows an example directory entry 2 of a Windows-formatted hard disk and accompanying FAT 20. The exemplary directory entry 2 consists of 32 bytes of data. The name of the file and its extension are stored in the first eleven bytes 4 of the directory entry 2 and a file attribute byte 6 is provided. By definition, ten bytes 8 are reserved for future use and four bytes are provided to store time 10 and date 12 information (two bytes each). Two cluster bytes 14 point to the first cluster of sectors used to store the file information. The last four bytes 18 of the directory entry 2 are used to store the size of the file.

[0016] A sixteen-byte section of a FAT 20 is depicted. The first four bytes 21 store system information. A two-byte pair, bytes four and five (16), are the beginning bytes of the FAT 20 used to track file information. The first cluster for data space on all disks is cluster "02." Therefore, bytes four and five (16) are associated with the first cluster of disk sectors "02" used to store file information. Bytes six and seven (22) are associated with cluster "03" . . . and bytes fourteen and fifteen (24) are associated with cluster "07."

[0017] This example illustrates how sectors associated with a file referenced in a directory are located. The cluster information bytes 14 in the directory 2 point to cluster number "02." The sectors in cluster "02" (not shown), contain the initial sector of data for the referenced file. Next, the FAT is referenced to see if additional clusters are used to store the file information. FAT bytes four and five (16) were pointed to by the cluster information bytes 14, and the information stored in bytes four and five (16) in the FAT 20 point to the next cluster used for the file. Here, the next cluster is "05". Accordingly, cluster "05" contains the next sector of data for the referenced file. FAT bytes ten and eleven (26) contain an end-of-file flag, "FFFF," indicating there are no more clusters associated with the referenced file. All of the information comprising the referenced file, therefore, is contained in clusters "02" and "05" on the disk.

[0018] As with other applications running on the computer, a typical backup application provides a read request to the operating system, which handles interpretation of the information contained in the FAT and reading of each file for the backup application. A file system is provided on the storage device that is used by the backup application to write files that are copied to the device. Similarly, the recovery portion of the backup application, or a separate recovery application, may read files from the storage device for recovery of the information.

[0019] Inherent problems and disadvantages have been discovered with currently available systems and methods for archiving data contained in an information store. One technique is to perform a full copy of the data contained in the information store. Utilizing this technique results in two separate copies of the information store, and the length of time it takes to make this kind of copy is related to the amount of data copied and the speed of the disk subsystem. For example, assuming a transfer rate of 25 MB/sec, the approach will take one hour to copy 90 GB of data. These techniques, however, in addition to other disadvantages, require the applications on the information store to be quiesced during the copy routine. This places a significant burden on system administrators to complete copying and get critical systems back into the production environment as, absent a high-speed data bus, the copying may consume a significant amount of time to complete.

[0020] Administrators typically keep multiple copies of a given information store. Unfortunately, this has the drawback of requiring n times the amount of space of the information store to maintain n copies, which can be quite expensive to store, in addition to requiring complex and time consuming techniques for restoration of the copied data.

[0021] One currently available alternative is to perform snapshots of an information store. With current snapshot systems and methods, administrators create an incremental copy that is an exact point-in-time replica of the source volume each time a snapshot is taken. A series of snapshot are stored locally on the information store from which it was taken and track incremental changes to the data in the information store. Furthermore, changed data is written to a new location in the information store as tracked by the snapshot. With knowledge regarding the change, as well as the changed data, the snapshot can be used to "roll back" changes to an information store to the point in time when the snapshot was taken. If there should be any logical corruption in the information store's data that went un-detected for a period of time, however, these incremental updates faithfully replicate that logical corruption to the data when copying. Additionally, other drawbacks are associated with currently know snapshot techniques, including the significant drawback of preventing restoration from the snapshot in the event that the information store fails, as both the snapshot and the information store become unavailable.

[0022] Systems and methods are needed, therefore, that overcome problems associated with currently known techniques for taking, maintaining and restoring snapshots.

SUMMARY OF THE INVENTION

[0023] The present invention addresses, among other things, the problems discussed above with copying up data using systems and methods known to those of skill in the art. The invention provides systems and methods for performing n snapshots of an information store, without requiring n times the space of the information store, and storing those snapshots in multiple destinations across a network.

[0024] One embodiment of the system of the present invention creates the snapshots by taking a snapshot that indexes only clusters for files that were created or changed since the last snapshot. A snapshots, t.sub.n, is restored by restoring the clusters from the snapshot t.sub.n. The clusters that were not restored from snapshot t.sub.n are restored from snapshot t.sub.n-1, etc., until the remaining clusters are restored from the first snapshot, snapshot t.sub.0.

[0025] In accordance with some aspects of the present invention, multiple snapshots are kept on a storage device, without requiring n times the space of the total volume of the information store. The system creates snapshots at various points in time that index only clusters for files that were created or changed since the last snapshot, and creates a copy of the data that has been changed or created. This allows users to keep several snapshots without requiring n times the space of the total volume of the information store.

[0026] In some embodiments, the system stores a map, which may be part of a snapshot, to track specific files and folders with their corresponding copied clusters. The map created by reading data from the file allocation table of the information store and associates files and folders with the clusters stored in the snapshots. In this way, even though the snapshot was performed at the cluster level, individual or groups of files and/or folders may be restored without unnecessarily restoring the entire information store.

Continue reading...
Full patent description for System and method for performing an image level snapshot and for restoring partial volume data

Brief Patent Description - Full Patent Description - Patent Application Claims
Click on the above for other options relating to this System and method for performing an image level snapshot and for restoring partial volume data patent application.
###
monitor keywords

How KEYWORD MONITOR works... a FREE service from FreshPatents
1. Sign up (takes 30 seconds). 2. Fill in the keywords to be monitored.
3. Each week you receive an email with patent applications related to your keywords.  
Start now! - Receive info on patent apps like System and method for performing an image level snapshot and for restoring partial volume data or other areas of interest.
###


Previous Patent Application:
Scalable file replication and web-based access
Next Patent Application:
Systems and methods for monitoring application data in a data replication system
Industry Class:
Data processing: database and file management or data structures

###

FreshPatents.com Support
Thank you for viewing the System and method for performing an image level snapshot and for restoring partial volume data patent info.
IP-related news and info


Results in 1.4496 seconds


Other interesting Feshpatents.com categories:
Tyco , Unilever , Warner-lambert , 3m