Abstract: The disclosure herein describes generating a protected entity of a VCI. A state document is generated based on the metadata state of the VCI and an entity data stream is set to a URI associated with the data of the VCI. Components and associated URIs of the VCI are identified. A combined data stream is set to a URI configured to provide access to the state document, the entity data stream, and the URIs of the components of the VCI. A snapshot API for providing a snapshot of the state of the protected entity, a serialization API for providing a serialized version of the protected entity, and a de-serialization API for converting a serialized version of the protected entity into a de-serialized version of the protected entity are defined. The protected entity is configured to enable the data and metadata of the VCI to be efficiently backed up.

Abstract: The disclosure herein describes generating a protected entity of a VCI. A state document is generated based on the metadata state of the VCI and an entity data stream is set to a URI associated with the data of the VCI. Components and associated URIs of the VCI are identified. A combined data stream is set to a URI configured to provide access to the state document, the entity data stream, and the URIs of the components of the VCI. A snapshot API for providing a snapshot of the state of the protected entity, a serialization API for providing a serialized version of the protected entity, and a de-serialization API for converting a serialized version of the protected entity into a de-serialized version of the protected entity are defined. The protected entity is configured to enable the data and metadata of the VCI to be efficiently backed up.

Abstract: The subject matter described herein is generally directed to detecting and managing collisions in storage. A hash identifier (ID) for a first block of data is calculated and a determination is made whether the calculated hash ID matches hash IDs associated with a storage. If the calculated hash ID matches at least one of the hash IDs, the first block of data is compared with a second block of data, associated with the hash IDs, in the storage. If the first block of data is different from the second block of data based on the comparison, a hash number is associated with the calculated hash ID and the first block of data is stored in storage using the calculated hash ID and associated hash number as an index to the first block of data in the storage. In this manner, collision between data blocks is detected and prevented.

Abstract: The subject matter described herein is generally directed to detecting and managing collisions in storage. A hash identifier (ID) for a first block of data is calculated and a determination is made whether the calculated hash ID matches hash IDs associated with a storage. If the calculated hash ID matches at least one of the hash IDs, the first block of data is compared with a second block of data, associated with the hash IDs, in the storage. If the first block of data is different from the second block of data based on the comparison, a hash number is associated with the calculated hash ID and the first block of data is stored in storage using the calculated hash ID and associated hash number as an index to the first block of data in the storage. In this manner, collision between data blocks is detected and prevented.