Emc Corporation

Cohesity, Inc.

Suchit Kaura

Hsing Yuan

Hymanand Nellore

Ravi Venkata Batchu

Sandeep Joshi

Sivanarayana Gaddam

Moiz Haidry

Jeff Miller

Gyan Prakash

Joseph Jobi

Narain Coimbatore Ramadass

Techniques are described for protected data restoration using confidential computing. An example method comprises receiving, by a data platform implemented by a computing system, a request to restore an encrypted chunk of data, the encrypted chunk stored with first encrypted key data and second encrypted key data, receiving, by an enclave implemented in a trusted execution environment, first encrypted key data and second encrypted key data from the storage cluster, decrypting, by the enclave, the first encrypted key data to obtain the first key data and the second encrypted key data to obtain the second key data, generating, by the storage cluster, a derived data encryption key corresponding to the data encryption key based on the first key data and the second key data, and decrypting, by the storage cluster, the encrypted chunk with the derived data encryption key to generate a decrypted chunk.

Protected data restoration using confidential computing

Implementations are provided herein for incremental backup using a change tree. A change tree is a database file for tracking file system changes of a specific dataset, such as a directory of a file system. A backup process can create and/or initiate a change tree when creating a backup snapshot of a dataset. After the change tree is created, all file system changes inside the dataset can be tracked. The next incremental backup can then take advantage of the change tree to backup changes without traversing the entire dataset. Thus, incremental backups can be more efficient and are better able to keep up with tape streaming speed.

Change tree incremental backup

The subject disclosure is directed towards the parallel backing up of a file system. A file system tree structure is walked by parallel workers that write file system data to data storage devices in parallel streams. Work assigned to one worker may be split to an idle worker to provide parallel operation. Relationship data that maintains relationships between the streams is persisted (e.g., via reference data inserted into the streams) so that a restore mechanism is able to stitch the streams together back into the file system data. Also persisted is location data that maintains storage locations of the streams. A file's data also may be written into parallel streams.

Parallelizing backup and restore for network-attached storage

Growing community of inventors

San Ramon, CA, United States of America

Suchit Kaura