Abstract: Described are embodiments of an invention for prioritizing data items for backup in a computing environment. The computing environment includes a plurality of clients coupled through a network to a backup system for backing up items stored locally on the client. Each client includes a continuous data protection (CDP) module that prioritizes the order of files transmitted to the backup system for storage on one or more storage devices based on policy. The CDP module builds an initial backup list and a CDP backup list. The initial backup list includes any item that meets the criteria of the initial backup profile. The CDP backup list includes items that have been modified since the initial backup process began. The data that is the most critical to a user is often the most recently modified data. Thus, the CDP module preferentially performs a backup of items on the CDP backup list.

Abstract: Techniques for adjusting the frequency of data backups and initiating event-driven backups in a storage system are disclosed herein. In one embodiment, a self-adjusting backup frequency, known as a “Change Rate Objective,” is defined to conduct or delay backups for one or more volumes in the storage system on the basis of an associated policy value. The Change Rate Objective may be tied to one or more business or data activity events, such as the amount and type of data changes since a last backup. The storage system may also be tailored to conduct or delay full or incremental backups on the basis of a Change Rate Objective that measures whether a full or incremental or differential backup is more appropriate. Various data or system failures, or data or business events may also be used to adjust the retention periods of continuous data protection (CDP) data and delay a rollup of CDP data.

Abstract: Embodiments of the present invention provide a scalable, efficient way to backup data in a block-level incremental-forever backup system such that backup and expiration of data can be achieved at the granularity of a single backup version, without having to read or move data that is stored in backup storage.

Abstract: One aspect of the present invention includes a configuration of a storage management system that enables the performance of deduplication activities at both the client (source) and at the server (target) locations. The location of deduplication operations can then be optimized based on system conditions or predefined policies. In one embodiment, seamless switching of deduplication activities between the client and the server is enabled by utilizing uniform deduplication process algorithms and accessing the same deduplication index (containing information on the hashed data chunks). Additionally, any data transformations on the chunks are performed subsequent to identification of the data chunks. Accordingly, with use of this storage configuration, the storage system can find and utilize matching chunks generated with either client- or server-side deduplication.

Abstract: Described are embodiments of an invention for prioritizing data items for backup in a computing environment. The computing environment includes a plurality of clients coupled through a network to a backup system for backing up items stored locally on the client. Each client includes a continuous data protection (CDP) module that prioritizes the order of files transmitted to the backup system for storage on one or more storage devices based on policy. The CDP module builds an initial backup list and a CDP backup list. The initial backup list includes any item that meets the criteria of the initial backup profile. The CDP backup list includes items that have been modified since the initial backup process began. The data that is the most critical to a user is often the most recently modified data. Thus, the CDP module preferentially performs a backup of items on the CDP backup list.

Abstract: For block level backup, a full image level backup is created of a file system from production storage at a production server to random access storage at a backup server. A mounted image is created from the full image that exposes a block level representation of the file system of the production server for read operations in a file level format. File enumeration is performed on the mounted image for files. Block level read operations are monitored while the files are being enumerated. During monitoring, blocks that are read for the read operations are marked as meta-data blocks. Blocks that are not marked as meta-data blocks are identified as data blocks. The data blocks are migrated to sequential storage, while leaving the meta-data blocks on the random access storage, wherein the data blocks form a backup image.

Abstract: For block level backup, a full image level backup is created of a file system from production storage at a production server to random access storage at a backup server. A mounted image is created from the full image that exposes a block level representation of the file system of the production server for read operations in a file level format. File enumeration is performed on the mounted image for files. Block level read operations are monitored while the files are being enumerated. During monitoring, blocks that are read for the read operations are marked as meta-data blocks. Blocks that are not marked as meta-data blocks are identified as data blocks. The data blocks are migrated to sequential storage, while leaving the meta-data blocks on the random access storage, wherein the data blocks form a backup image.

Abstract: Embodiments of the present invention provide a scalable, efficient way to backup data in a block-level incremental-forever backup system such that backup and expiration of data can be achieved at the granularity of a single backup version, without having to read or move data that is stored in backup storage.

Abstract: For block level backup, a full image level backup is created of a file system from production storage at a production server to random access storage at a backup server. A mounted image is created from the full image that exposes a block level representation of the file system of the production server for read operations in a file level format. File enumeration is performed on the mounted image for files. Block level read operations are monitored while the files are being enumerated. During monitoring, blocks that are read for the read operations are marked as meta-data blocks. Blocks that are not marked as meta-data blocks are identified as data blocks. The data blocks are migrated to sequential storage, while leaving the meta-data blocks on the random access storage, wherein the data blocks form a backup image.

Abstract: For block level backup, a full image level backup is created of a file system from production storage at a production server to random access storage at a backup server. A mounted image is created from the full image that exposes a block level representation of the file system of the production server for read operations in a file level format. File enumeration is performed on the mounted image for files. Block level read operations are monitored while the files are being enumerated. During monitoring, blocks that are read for the read operations are marked as meta-data blocks. Blocks that are not marked as meta-data blocks are identified as data blocks. The data blocks are migrated to sequential storage, while leaving the meta-data blocks on the random access storage, wherein the data blocks form a backup image.

Abstract: A markup language document representing computing elements of a computing architecture, such as data storage elements of a data storage architecture, is constructed and analyzed. A first computing element contained by a second computing element is represented; a first tag of the document corresponding to the first computing element is nested within a second tag of the markup language document corresponding to the second computing element. A non-containing/contained relationship from the first computing element to a third computing element is also represented; a pointer tag of the document corresponding to the data access path is nested within the first tag, and references a third tag of the document corresponding to the third computing element. Get-pointer-node and get-child-node application programming interfaces for the markup language are called to traverse among containing/contained relationships. Pointer tags are followed to traverse among non-containing/contained relationships.

Abstract: Provided are a computer program product, system, and method for restoring a restore set of files from backup objects stored in sequential backup devices. Backup objects are stored in at least one sequential backup device. A client initiates a restore request to restore a restore set of data in a volume as of a restore point-in-time. A determination is made of backup objects stored in at least one sequential backup device including the restore set of data for the restore point-in-time, wherein the determined backup objects are determined from a set of backup objects including a full volume backup and delta backups providing data in the volume at different points-in-time, and wherein extents in different backup objects providing data for blocks in the volume at different points-in-time are not stored contiguously in the sequential backup device. A determination is made of extents stored in the at least one sequential backup device for the determined backup objects.

Abstract: Provided are a computer program product, system, and method for restoring a restore set of files from backup objects stored in sequential backup devices. Backup objects are stored in at least one sequential backup device. A client initiates a restore request to restore a restore set of data in a volume as of a restore point-in-time. A determination is made of backup objects stored in at least one sequential backup device including the restore set of data for the restore point-in-time, wherein the determined backup objects are determined from a set of backup objects including a full volume backup and delta backups providing data in the volume at different points-in-time, and wherein extents in different backup objects providing data for blocks in the volume at different points-in-time are not stored contiguously in the sequential backup device. A determination is made of extents stored in the at least one sequential backup device for the determined backup objects.

Abstract: Techniques for adjusting the frequency of data backups and initiating event-driven backups in a storage system are disclosed herein. In one embodiment, a self-adjusting backup frequency, known as a “Change Rate Objective,” is defined to conduct or delay backups for one or more volumes in the storage system on the basis of an associated policy value. The Change Rate Objective may be tied to one or more business or data activity events, such as the amount and type of data changes since a last backup. The storage system may also be tailored to conduct or delay full or incremental backups on the basis of a Change Rate Objective that measures whether a full or incremental or differential backup is more appropriate. Various data or system failures, or data or business events may also be used to adjust the retention periods of continuous data protection (CDP) data and delay a rollup of CDP data.

Abstract: A markup language document representing computing elements of a computing architecture, such as data storage elements of a data storage architecture, is constructed and analyzed. A first computing element contained by a second computing element is represented; a first tag of the document corresponding to the first computing element is nested within a second tag of the markup language document corresponding to the second computing element. A non-containing/contained relationship from the first computing element to a third computing element is also represented; a pointer tag of the document corresponding to the data access path is nested within the first tag, and references a third tag of the document corresponding to the third computing element. Get-pointer-node and get-child-node application programming interfaces for the markup language are called to traverse among containing/contained relationships. Pointer tags are followed to traverse among non-containing/contained relationships.

Abstract: Estimating a recovery time for a data asset is provided. A request is received to project a recovery time for a data asset that uses a repository. A determination is made as to whether there are one or more existing recovery times for other data assets and other repositories that have characteristics similar to the data asset and the repository of the request. The recovery time for the data asset is projected using the one or more existing recovery times in response to an existence of the one or more existing recovery times.

Abstract: A markup language document representing computing elements of a computing architecture, such as data storage elements of a data storage architecture, is constructed and analyzed. A first computing element contained by a second computing element is represented; a first tag of the document corresponding to the first computing element is nested within a second tag of the markup language document corresponding to the second computing element. A non-containing/contained relationship from the first computing element to a third computing element is also represented; a pointer tag of the document corresponding to the data access path is nested within the first tag, and references a third tag of the document corresponding to the third computing element. Get-pointer-node and get-child-node application programming interfaces for the markup language are called to traverse among containing/contained relationships. Pointer tags are followed to traverse among non-containing/contained relationships.

Abstract: One aspect of the present invention includes a configuration of a storage management system that enables the performance of deduplication activities at both the client (source) and at the server (target) locations. The location of deduplication operations can then be optimized based on system conditions or predefined policies. In one embodiment, seamless switching of deduplication activities between the client and the server is enabled by utilizing uniform deduplication process algorithms and accessing the same deduplication index (containing information on the hashed data chunks). Additionally, any data transformations on the chunks are performed subsequent to identification of the data chunks. Accordingly, with use of this storage configuration, the storage system can find and utilize matching chunks generated with either client- or server-side deduplication.

Abstract: A markup language document representing computing elements of a computing architecture, such as data storage elements of a data storage architecture, is constructed and analyzed. A first computing element contained by a second computing element is represented; a first tag of the document corresponding to the first computing element is nested within a second tag of the markup language document corresponding to the second computing element. A non-containing/contained relationship from the first computing element to a third computing element is also represented; a pointer tag of the document corresponding to the data access path is nested within the first tag, and references a third tag of the document corresponding to the third computing element. Get-pointer-node and get-child-node application programming interfaces for the markup language are called to traverse among containing/contained relationships. Pointer tags are followed to traverse among non-containing/contained relationships.

Abstract: Estimating a recovery time for a data asset is provided. A request is received to project a recovery time for a data asset that uses a repository. A determination is made as to whether there are one or more existing recovery times for other data assets and other repositories that have characteristics similar to the data asset and the repository of the request. The recovery time for the data asset is projected using the one or more existing recovery times in response to an existence of the one or more existing recovery times.