Abstract: Examples include compressed extent versions. Examples may create an empty target virtual volume tree having a tree structure of a source virtual volume tree of a source storage system, the source virtual volume tree comprising source base and source snapshot virtual volumes, each representing respective versions of a plurality of extents, wherein each of the extents corresponds to a different portion of an address space of the source base virtual volume. Examples may include compressed extent collections, each comprising a compressed representation of multiple populated versions of a single extent from the source base and snapshot virtual volumes, the multiple populated versions compressed relative to one another.

Abstract: Examples include compressed extent versions. Examples may create an empty target virtual volume tree having a tree structure of a source virtual volume tree of a source storage system, the source virtual volume tree comprising source base and source snapshot virtual volumes, each representing respective versions of a plurality of extents, wherein each of the extents corresponds to a different portion of an address space of the source base virtual volume. Examples may include compressed extent collections, each comprising a compressed representation of multiple populated versions of a single extent from the source base and snapshot virtual volumes, the multiple populated versions compressed relative to one another.

Abstract: A method for migrating data in a storage system includes generating a first set of logical disks (LDs), the LDs being mapped to physical storage space in the storage system, generating a temporary virtual volume (VV) mapped to the first set of LDs, generating a second set of LDs mapped to the temporary VV, and migrating data between the second set of LDs and a third set of LDs.

Abstract: A method for migrating data in a storage system includes generating a first set of logical disks (LDs), the LDs being mapped to physical storage space in the storage system, generating a temporary virtual volume (VV) mapped to the first set of LDs, generating a second set of LDs mapped to the temporary VV, and migrating data between the second set of LDs and a third set of LDs.

Abstract: A region of a node is searched to find a content-defined split point. A split point of a node is determined based at least in part on hashes of entries in the node and the node is split based on the determined split point. The search region is searched for the first encountered split point and the node is split based on that split point. That split point is based on a predetermined bitmask of the hashes of the entries in the node satisfying a predetermined condition.