Restoring from a temporary backup target in an intelligent destination target selection system for remote backups

US2024020200A1 · US · A1

Patent metadata
FieldValue
Publication numberUS-2024020200-A1
Application numberUS-202318304046-A
CountryUS
Kind codeA1
Filing dateApr 20, 2023
Priority dateJul 12, 2022
Publication dateJan 18, 2024
Grant date

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A system that automatically determines ideal temporary backup targets (TBTs) to store and restore backup data. For multiple TBTs, backup data is saved with location information to restore incremental backup data from these multiple targets. Hashes of each file are stored in a Merkle tree to enable data restore workflows and minimizing an amount of storage required to hold backup data. The lowest tree level comprises hashes of the backup data chunks, and higher levels contain hashes of the next lower levels. A backup target location value is added to non-data chunk hash records in the higher levels to identify where any piece of backup data is located so that restore operations can occur when the backup data is spread across multiple backup targets.

First claim

Opening claim text (preview).

What is claimed is: 1 . A computer-implemented method of restoring data from one or more temporary backup targets, comprising: accessing data of files backed up in a series of periodic backups, wherein each backup is referenced by a hash value that indicates a location of a temporary backup target storing a respective backup; examining and checking the location of the temporary backup target; identifying hashes of a specific file version for the checked location; performing a restore operation on data chunks referenced by the identified hashes, wherein some data chunks may be stored locally on a primary backup target and others may be retrieved from a temporary backup target. 2 . The method of claim 1 wherein the restore operation comprises: obtaining the hashes of the data chunks; computing hashes of locally stored data chunks; accessing a list of missing data chunks; breaking a missing data chunk by backup target ID; retrieving the missing data chunk from the backup target corresponding to the backup target ID; and constructing the file to be restored using the retrieved and locally stored data chunks. 3 . The method of claim 1 further comprising: defining a cost threshold for the restore operation; and determining if the restore operation exceeds the cost threshold, and if so, providing a user with an option to cancel the restore operation, otherwise proceeding with the restore operation, and wherein the cost threshold computed by factoring a number of data chunks to retrieve and an estimate of a transfer size of the backup. 4 . The method of claim 1 further comprising storing hashes of each file in a Merkle tree is used to enable data restore workflows and minimizing an amount of storage required to hold backup data. 5 . The method of claim 4 wherein a lowest level of the Merkle tree comprises hashes of data chunks of the backup, and higher levels of the Merkle tree contain hashes of immediately lower levels of the Merkle tree. 6 . The method of claim 5 further comprising adding a backup target location value to non-data chunk hash records in the higher levels to identify where any piece of backup data is located so that restore operations can occur when the backup data is spread across multiple backup targets. 7 . The method of claim 6 further comprising: consolidating data chunks from the temporary backup target to the primary backup target; updating the location of the consolidated data chunks; and modifying remaining hash values in the Merkle tree for the consolidation. 8 . The method of claim 1 wherein the location information comprises a Uniform Resource Locator (URL). 9 . The method of claim 8 further comprising storing the URL in a database associating the backup target location with one of a primary or temporary backup target type and corresponding location ID. 10 . The method of claim 1 wherein the database further stores cost information for read operations from a corresponding backup target and transfer costs from the corresponding backup target for cost estimations of the restore operation. 11 . The method of claim 1 wherein each backup is performed by a backup operation comprising: selecting an optimum destination storage for mobile data assets, comprising: automatically determining a primary backup target to send backup data of the data asset; sending incremental backups of the data asset to the primary storage target and the temporary backup targets based on movement of the data asset from one geolocation to another geolocation; first maintaining, in the data asset, a backup location catalog (BLC) and a change record catalog (CRC); second maintaining, in a temporary backup target, a copy of the CRC for a backup written to the temporary backup target; updating the BLC and CRC in the data asset upon the backup to the temporary backup target; and combining, during a restore operation, data and metadata of the backup from the primary backup target and the temporary backup target, wherein the updating allows the primary backup target to access the temporary backup based on a most recent updated BLC. 12 . The method of claim 1 wherein each backup is performed by a backup operation comprising: initiating a backup of the data to a backup system through a backup agent; automatically determining a storage target for the backup agent to send the data; automatically creating and destroying the temporary backup targets in order to accommodate current backup traffic levels and to provide optimal throughput of the backup data to the storage target; sending, from the backup agent, incremental backups of the data asset to one or more temporary backup targets based on movement of the data asset from one geolocation to another geolocation; and transferring the incremental backups from the one or more temporary backup targets for consolidation and storage on the storage target. 13 . A computer-implemented method of backing up and restoring data in a deduplication backup system, comprising: initiating a backup of a data asset to the backup system through a backup agent; automatically determining a storage target for the backup agent to send backup data of the data asset; automatically creating and destroying temporary backup targets in order to accommodate current backup traffic levels and to provide optimal throughput of the backup data to the storage target, wherein each temporary backup target is referenced by a unique locator ID; sending, from the backup agent, incremental backups of the data asset to one or more temporary backup targets based on movement of the data asset from one geolocation to another geolocation; transferring the incremental backups from the one or more temporary backup targets for consolidation and storage on the storage target, wherein the backups comprise data chunks referenced by respective hashes; checking, upon a restore operation, the location of a temporary backup target; identifying hashes of a specific file version for the checked location; and performing a restore sequence on data chunks referenced by the identified hashes. 14 . The method of claim 13 further comprising storing hashes of the data chunks in a Merkle tree is used to enable data restore workflows and minimizing an amount of storage required to hold backup data. 15 . The method of claim 14 wherein a lowest level of the Merkle tree comprises hashes of data chunks of the backup, and higher levels of the Merkle tree contain hashes of immediately lower levels of the Merkle tree. 16 . The method of claim 15 further comprising adding a backup target location value to non-data chunk hash records in the higher levels to identify where any piece of backup data is located so that restore operations can occur when the backup data is spread across multiple backup targets. 17 . The method of claim 13 wherein the restore sequence comprises: obtaining the hashes of the data chunks; computing hashes of locally stored data chunks; accessing a list of missing data chunks; breaking a missing data chunk by backup target ID; retrieving the missing data chunk from the backup target corresponding to the backup target ID; and constructing the file to be restored using the retrieved and locally stored data chunks. 18 . The method of claim 13 further comprising: defining a cost threshold for the restore operation; and determining if the restore operation exceeds the cost threshold, and if so, providing a user with an option to cancel the restore operation, otherwise proce

Assignees

Inventors

Classifications

  • by selection of backup contents · CPC title

  • using de-duplication of the data · CPC title

  • Backup restoration techniques · CPC title

  • for networked environments · CPC title

  • using file system or storage system metadata · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US2024020200A1 cover?
A system that automatically determines ideal temporary backup targets (TBTs) to store and restore backup data. For multiple TBTs, backup data is saved with location information to restore incremental backup data from these multiple targets. Hashes of each file are stored in a Merkle tree to enable data restore workflows and minimizing an amount of storage required to hold backup data. The lowes…
Who is the assignee on this patent?
Dell Products Lp
What technology area does this patent fall under?
Primary CPC classification G06F11/1464. Mapped technology areas include Physics.
When was this patent published?
Publication date Thu Jan 18 2024 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 2 related publications on this page (citations in our corpus or others sharing the same primary CPC).