# US 2023/0273897 A1 · Managing expiration times of archived objects

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2023/0273897 A1
- Document ID: US20230273897A1
- Status: Published application
- Kind: A1
- Application number: 17/681,439
- Filed: 2022-02-25
- Published: 2023-08-31
- Earliest claimed: 2022-02-25
- Assignees: Cohesity, Inc.
- Applicants: Cohesity, Inc.
- Inventors: Dane Van Dyck; Praveen Kumar Yarlagadda
- Web page: https://patentgrep.com/patent/US20230273897A1

## CPC

- G06F 16/113: {Details of archiving (lifecycle management in storage systems G06F3/0649; point-in-time backing up or restoration of persistent data G06F11/1446)}
- G06F 16/125: {characterised by the use of retention policies (retention policies for HSM systems G06F16/185)}
- G06F 16/13: File access structures, e.g. distributed indices (arrangements of input from, or output to, record carriers G06F3/06)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

One or more objects associated with a source storage is determined to be archived to a remote storage. A corresponding minimum expiration time is stored in nodes of a tree data structure associated with an archive that represents the archived data associated with the source storage. At least a portion of the tree data structure associated with the archive is traversed to identify one or more nodes associated with one or more archived objects having a corresponding expiration time expiring before an expiration time associated with the archive.

## Claims

### Claim 1

A method, comprising:
determining to archive one or more objects associated with a source storage to a remote storage;
storing a corresponding minimum expiration time in nodes of a tree data structure associated with an archive that represents the archived data associated with the source storage; and
traversing at least a portion of the tree data structure corresponding to the archive to identify one or more nodes associated with one or more archived objects having a corresponding expiration time expiring before an expiration time associated with the archive.

### Claim 2 (depends on 1)

The method of claim 1, wherein the one or more objects associated with the source storage is determined to be archived to the remote storage based on one or more conditions associated with an archive policy being satisfied.

### Claim 3 (depends on 2)

The method of claim 2, wherein the one or more conditions associated with the archive policy are associated with at least one of: a certain amount of time passing since a previous archive; a threshold amount of data being changed since a previous backup snapshot; in response to a user command, a threshold number of incremental backup snapshots being performed since a previous archive; a frequency at which an object is modified within a particular time period;
and/or legal compliance.

### Claim 4 (depends on 1)

The method of claim 1, wherein the expiration time associated with the archive is specified by a data management policy associated with the archive.

### Claim 5 (depends on 1)

The method of claim 1, wherein the one or more archived objects are associated with one or more previous archives.

### Claim 6 (depends on 1)

The method of claim 1, wherein traversing at least the portion of the tree data structure associated with the archive includes comparing an expiration time stored by a node of the tree data structure to the expiration time associated with the archive.

### Claim 7 (depends on 6)

The method of claim 6, wherein traversing at least the portion of the tree data structure associated with the archive includes traversing the tree data structure corresponding to the archive from the node to a child node in response to a determination that the expiration time stored by the node expires before the expiration time associated with the archive.

### Claim 8 (depends on 6)

The method of claim 6, wherein traversing at least the portion of the tree data structure associated with the archive includes traversing the tree data structure corresponding to the archive from the node to a different node that is on a same hierarchy level as the node in the event the expiration time stored by the node does not expire before the expiration time associated with the archive.

### Claim 9 (depends on 1)

The method of claim 1, wherein storing the corresponding minimum expiration time in nodes of the tree data structure includes:
storing the corresponding minimum expiration time in each of the leaf nodes of the tree data structure; and
at each node above a leaf node level of the tree data structure, comparing the corresponding minimum expiration times of child leaf nodes associated with the node.

### Claim 10 (depends on 9)

The method of claim 9, wherein storing the corresponding minimum expiration time in nodes of the tree data structure further includes storing in the node a minimum of the corresponding minimum expiration times of the child leaf nodes associated with the node.

### Claim 11 (depends on 9)

The method of claim 9, wherein the corresponding minimum expiration time associated with a leaf node is based on a minimum of an expiration time associated with the archive and a minimum child retention time of a tree metadata object associated with the leaf node.

### Claim 12 (depends on 1)

The method of claim 1, further comprising archiving the tree data structure associated with archive.

### Claim 13 (depends on 1)

The method of claim 1, further comprising updating the corresponding expiration time of the one or more identified archived objects to be the expiration time associated with the archive.

### Claim 14 (depends on 1)

The method of claim 1, further comprising causing storage of the archive to a remote storage.

### Claim 15 (depends on 1)

The method of claim 1, further comprising setting an expiration time associated with the one or more objects included in the archive to be the expiration time associated with the archive.

### Claim 16 (depends on 15)

The method of claim 15, wherein the expiration time associated with the archive is based on an expiration of a data lock period.

### Claim 17 (depends on 16)

The method of claim 16, wherein a data management policy associated with the archive specified the expiration of the data lock period.

### Claim 18

A computer program product embodied in a non-transitory computer readable medium and comprising computer instructions for:
determining to archive one or more objects associated with a source storage to a remote storage;
storing a corresponding minimum expiration time in nodes of a tree data structure associated with an archive that represents the archived data associated with the source storage; and
traversing at least a portion of the tree data structure associated with the archive to identify one or more nodes associated with one or more archived objects having a corresponding expiration time expiring before an expiration time associated with the archive.

### Claim 19 (depends on 18)

The computer program product of claim 18, further comprising instructions for updating the corresponding expiration time of the one or more identified archived objects to be the expiration time associated with the archive.

### Claim 20

A system, comprising:
one or more processors configured to:
determine to archive one or more objects associated with a source storage to a remote storage;
store a corresponding minimum expiration time in nodes of a tree data structure associated with an archive that represents the archived data associated with the source storage; and
traverse at least a portion of the tree data structure associated with the archive to identify one or more nodes associated with one or more archived objects having a corresponding expiration time expiring before an expiration time associated with the archive; and
a memory coupled to the one or more processors and configured to provide the one or more processors with instructions.
