Abstract: Techniques and mechanisms described herein provide for verification of data across cloud-based and on-premises data storage systems. According to various embodiments, a backup client implemented on a first compute node can store a data file in a backup data repository. A data guardianship can store first data file state information describing the data file in a key-value store accessible via the internet. A data verification instance can analyze the backup data repository to verify that the data file is stored intact in the backup data repository.

Abstract: Techniques and mechanisms are provided for migrating data blocks around a cluster during node addition and node deletion. Migration requires no downtime, as a newly added node is immediately operational while the data blocks are being moved. Blockmap files and deduplication dictionaries need not be updated.

Abstract: Techniques and mechanisms described herein provide for facilitating communications between one or more client machines and one or more cloud storage providers. According to various embodiments, a virtual machine may communicate with one or more client machines via a standard data storage protocol. The virtual machine may also communicate with one or more cloud storage providers via the internet. The virtual machine may then perform operations such as receiving data from a client machine and storing it to the cloud, retrieving data from the cloud and providing it to the client machine, querying data stored in the cloud, reporting on and verifying data stored in the cloud, and transferring and/or transforming data stored in the cloud.

Abstract: Techniques and mechanisms described herein provide for verifying data across cloud-based and on-premises data storage systems. According to various embodiments, data can be received by a gateway from a client machine and stored in a file data repository accessible via the internet. The stored data can have a common master namespace. Indications of updates to the master namespace can be received. Updated namespace data and metadata can be transmitted to the gateway.

Abstract: Certain embodiments of the present disclosure provide systems and associated methods for dynamically re-serializing virtual tape library cartridges. The system comprises a first server node including a first virtual tape library residing on a deduplication file system, in which a backup data file corresponding to a first cartridge is stored in a first container with a first base prefix. A second server node includes a second virtual tape library residing on a second deduplication file system, and is configured to receive and store a replica of the backup data file corresponding to a second cartridge in a second container such that the second cartridge includes the same first base prefix as the first cartridge. An activation code is assigned to the second container, and used to re-serialize the first base prefix to form a second base prefix such that the second cartridge is presented with the second base prefix.

Abstract: Techniques and mechanisms are provided for migrating data blocks around a cluster during node addition and node deletion. Migration requires no downtime, as a newly added node is immediately operational while the data blocks are being moved. Blockmap files and deduplication dictionaries need not be updated.

Abstract: Techniques and mechanisms are provided for migrating data blocks around a cluster during node addition and node deletion. Migration requires no downtime, as a newly added node is immediately operational while the data blocks are being moved. Blockmap files and deduplication dictionaries need not be updated.

Abstract: Certain embodiments of the present disclosure provide systems and associated methods for dynamically re-serializing virtual tape library cartridges. The system comprises a first server node including a first virtual tape library residing on a deduplication file system, in which a backup data file corresponding to a first cartridge is stored in a first container with a first base prefix. A second server node includes a second virtual tape library residing on a second deduplication file system, and is configured to receive and store a replica of the backup data file corresponding to a second cartridge in a second container such that the second cartridge includes the same first base prefix as the first cartridge. An activation code is assigned to the second container, and used to re-serialize the first base prefix to form a second base prefix such that the second cartridge is presented with the second base prefix.

Abstract: Systems, methods, and devices are disclosed herein for implementing deduplicating multi-device plugin. Methods may include receiving a data storage request identifying a data block for storage in a virtual device, where the virtual device is created by a multiple device driver capable of generating a plurality of virtual devices based on a plurality of underlying physical storage devices and a plurality of remote devices. The methods may also include determining, using one or more processors, whether the data block has already been stored in the virtual device created by the multiple device driver. The methods may further include updating, using the one or more processors, a blockmap based on the determining, the blockmap representing a plurality of data blocks stored in the virtual device.

Abstract: Techniques and mechanisms are provided to allow for selective optimization, including deduplication and/or compression, of portions of files and data blocks. Data access is monitored to generate a heat index for identifying sections of files and volumes that are frequently and infrequently accessed. These frequently used portions may be left non-optimized to reduce or eliminate optimization I/O overhead. Infrequently accessed portions can be more aggressively optimized.

Abstract: Techniques and mechanisms are provided for storing data in a backup storage system. According to various embodiments, a first blockmap in a backup storage system may be identified. The first blockmap may correspond with a first restore point. The first blockmap may identify a first plurality of data segments. Each of the first plurality of data segments may have associated therewith a respective storage location in the backup storage system. The first blockmap may be compared with a designated storage system state to identify a subset of the first plurality of data segments that each correspond with a respective matching data segment in the designated storage system state. A second blockmap may be stored in the backup storage system. The second blockmap may correspond with a second restore point. The second blockmap may include the identified subset of the first plurality of data segments.

Abstract: Techniques and mechanisms are provided for migrating data blocks around a cluster during node addition and node deletion. Migration requires no downtime, as a newly added node is immediately operational while the data blocks are being moved. Blockmap files and deduplication dictionaries need not be updated.

Abstract: Techniques and mechanisms are provided for migrating data blocks around a cluster during node addition and node deletion. Migration requires no downtime, as a newly added node is immediately operational while the data blocks are being moved. Blockmap files and deduplication dictionaries need not be updated.

Abstract: Techniques and mechanisms are provided to allow for selective optimization, including deduplication and/or compression, of portions of files and data blocks. Data access is monitored to generate a heat index for identifying sections of files and volumes that are frequently and infrequently accessed. These frequently used portions may be left non-optimized to reduce or eliminate optimization I/O overhead. Infrequently accessed portions can be more aggressively optimized.

Abstract: Techniques and mechanisms are provided to allow for selective optimization, including deduplication and/or compression, of portions of files and data blocks. Data access is monitored to generate a heat index for identifying sections of files and volumes that are frequently and infrequently accessed. These frequently used portions may be left non-optimized to reduce or eliminate optimization I/O overhead. Infrequently accessed portions can be more aggressively optimized.

Abstract: Techniques and mechanisms provide a storage optimization manager. Data may be optimized and maintained on various nodes in a cluster. Particular nodes may be overburdened while other nodes remain relatively unused. Techniques are provided to efficiently optimize data onto nodes to enhance operational efficiency. Data access requests for optimized data are monitored and managed to allow for intelligent maintenance of optimized data.

Abstract: Techniques and mechanisms are provided to allow for selective optimization, including deduplication and/or compression, of portions of files and data blocks. Data access is monitored to generate a heat index for identifying sections of files and volumes that are frequently and infrequently accessed. These frequently used portions may be left non-optimized to reduce or eliminate optimization I/O overhead. Infrequently accessed portions can be more aggressively optimized.

Abstract: Techniques and mechanisms are provided to support live file optimization. Active I/O access to an optimization target is monitored during optimization. Active files need not be taken offline or made unavailable to an application during optimization and retain the ability to support file operations such as read, write, unlink, and truncate while an optimization engine performs deduplication and/or compression on active file ranges.

Abstract: Techniques and mechanisms are provided to allow for selective optimization, including deduplication and/or compression, of portions of files and data blocks. Data access is monitored to generate a heat index for identifying sections of files and volumes that are frequently and infrequently accessed. These frequently used portions may be left non-optimized to reduce or eliminate optimization I/O overhead. Infrequently accessed portions can be more aggressively optimized.

Abstract: Techniques and mechanisms are provided for storing data in a backup storage system. According to various embodiments, a first blockmap in a backup storage system may be identified. The first blockmap may correspond with a first restore point. The first blockmap may identify a first plurality of data segments. Each of the first plurality of data segments may have associated therewith a respective storage location in the backup storage system. The first blockmap may be compared with a designated storage system state to identify a subset of the first plurality of data segments that each correspond with a respective matching data segment in the designated storage system state. A second blockmap may be stored in the backup storage system. The second blockmap may correspond with a second restore point. The second blockmap may include the identified subset of the first plurality of data segments.