Emc IP Holding Company LLC

Gregory Skripko

Mikhail Danilov

Konstantin Buinov

Kirill Zakharov

Alexander Rakulenko

Nikita Gutsalov

Alexander Fedorov

Ivan Tchoub

Kirill Viktorovich Gusakov

Andrey Vsevolodovich Kurilov

Sergey Koyushev

Maria Gavrilova

Maxim S Trusov

Igor Medvedev

Vladimir Prikhodko

Irina Tavantseva

Establishing data reliability groups within a geographically distributed data storage environment is presented herein. A system can comprise a processor; and a memory that stores executable instructions that, when executed by the processor, facilitate performance of operations, comprising: partitioning geographically distributed data storage zones into reliability groups, in which a reliability group of the reliability groups comprises a group of storage zones comprising a defined amount of the geographically distributed data storage zones; and facilitating a replication of data of the group of storage zones using a portion of remaining data of the group of storage zones.

Establishing data reliability groups within a geographically distributed data storage environment

A method, computer program product, and computer system for determining, by a computing device, that an object of a plurality of objects is an orphan. It may be determined that the object is older than a threshold age. A capacity occupied by the object may be reclaimed based upon, at least in part, determining that the object is an orphan and determining that the object is older than the threshold age.

System and method for reference tracking garbage collector

Capacity management is provided for a plurality of search trees under multi-version concurrency control. A non-volatile memory includes a plurality of chunks that are fixed-sized blocks of the non-volatile memory, each chunk including at least one page. The non-volatile memory stores the plurality of search trees, each search tree having elements including a tree root, a tree node and a tree leaf. Each element of the tree is at a different level of the search tree: a first level including the tree root, a second level including the tree node, and a third level including the tree leaf. The plurality of chunks includes a number of chunk types, each chunk type for storing the element from a different level of the search tree, such that elements from different levels are stored in separate chunks.

Capacity management for trees under multi-version concurrency control

A computer program product, system, and method for determining containers, within a secondary storage, to transform; determining users having access to the containers to transform; synchronizing storage configuration between the secondary storage and a primary storage; enumerating objects within the containers to transform; and adding object identifiers and object metadata for the enumerated objects to an object index within the primary storage.

Transformation processing for objects between storage systems

A transformation job associated with a storage container is created. The transformation job creation includes turning specified comparison predicates into a composite filter. A transformation service is performed for the created transformation job. The transformation service performance includes enumerating content of the storage container and applying the composite filter to each found object. One or more objects that are determined to pass the composite filter are added to an object index of a primary storage.

System and method for selective storage transformation

A computer program product, system, and method for determining a list of objects, within source storage, to migrate; generating a chunk layout for the objects to migrate; and for each unencoded chunk within the chunk layout: retrieving objects from source storage specified by the unencoded chunk within the chunk layout; generating data and coded fragments for the unencoded chunk using the retrieved objects; and storing the data and coded fragments to primary storage.

Efficient migration to distributed storage

One embodiment is related to a method for promoting or demoting data objects in a multi-tier storage system, comprising: creating one or more chunks to store data objects therein at a first tier of the multi-tier storage system, wherein data objects stored in each chunk are associated with a same lifecycle policy and an approximately same creation time; and moving one of the one or more chunks to a second tier in its entirety based on the lifecycle policy associated with the data objects stored in the moved chunk.

System and method for capacity management in multi-tiered storage

One embodiment is related to a method for implementing a demoted chunk, comprising: replicating a first chunk from a first zone of a cloud storage system to a third zone of the cloud storage system; replicating a second chunk from a second zone of the cloud storage system to the third zone; creating an exclusive or (XOR) chunk at the third zone based at least in part on the replicated first chunk and the replicated second chunk; and marking the replicated first chunk and the replicated second chunk as demoted first chunk and demoted second chunk, respectively, at the third zone.

System and method for capacity and network traffic efficient data protection on distributed storage system

The described technology is generally directed towards reference tracking garbage collection, including for operating in a geographically distributed storage system. Content Addressed Storage (CAS) data objects comprising BLOBs (Binary Large Objects) are referenced by data objects comprising C-Clip Descriptor Files (CDFs). BLOBs having no remaining reference, referred to as orphan BLOBs, are deleted in a two-stage deletion operation that ensures that no new reference has been created. An alive BLOB that became an orphan is demoted to a garbage collection candidate with limited access to the BLOB. The BLOB is only deleted if the garbage collection candidate status of the BLOB is distributed across geographically distributed zones, and there is no new reference to the BLOB.

Reference tracking garbage collection for geographically distributed storage system

The disclosure relates data protection management (e.g. data recovery) for distributed storage systems. Specifically, the systems (and methods) of the disclosure provide an advanced mechanism for data recovery based on a notion of a data fragment's peer group, which may be used for 'peer' recovery. Peer recovery allows a data fragment to be recovered when all the data fragments from its peer group are available. Accordingly, the described mechanism leverages the power of erasure coding and XOR operations to support recovery of data in situations where such data would previously be considered unrecoverable.

System and method for recovery of unrecoverable data with erasure coding and geo XOR

Systems and methods for efficiently protecting data within a distributed storage system using erasure coding. Unnecessary network traffic can be eliminated by scheduling executing erasure coding tasks on storage nodes that have local copies of data. Encoding may be performed in parallel by multiple nodes to reduce elapsed encoding time.

Erasure coding for elastic cloud storage

The disclosure relates to data protection management for geographically distributed storage systems. Specifically, the present disclosure provides a mechanism for load balancing by combining the techniques of XOR Star and XOR Chain to control the protection of data internally. The load balancing is done by each zone without the need for an external load balancer. In addition, the load balancing mechanism provides the ability for native (e.g. without additional configuration) support of disaster recovery.

Growing community of inventors

Seattle, WA, United States of America

Gregory Skripko