Nested discovery and deletion of resources

Patent metadata

Field	Value
Publication number	US-12067020-B2
Application number	US-202217949965-A
Country	US
Kind code	B2
Filing date	Sep 21, 2022
Priority date	Oct 25, 2019
Publication date	Aug 20, 2024
Grant date	Aug 20, 2024

Abstract

Systems, methods, and non-transitory computer readable media are provided for recursively searching a plurality of workspaces of the system for linked data associated with the seed data, initiating an endpoint process for each the seed data and the linked data, and, upon completion of the search, delete the seed data and the linked data identified based at least in part on the endpoint process. The process may be automatically repeated at a predetermined time interval to identify and remove future data that is stored in the plurality of datasets.

First claim

What is claimed is:

1. A system for storing data, the system comprising:
one or more processors; and
a memory storing instructions that, when executed by the one or more processors, cause the system to perform operations further comprising:
storing the data in or representing the data as a plurality of containers or objects;
identifying a seed container or seed object satisfying a search criteria and flagging the seed container or seed object for deletion;
recursively searching to identify child containers or child objects linked to the seed container or seed object, wherein the child containers or child objects have a direct or an indirect child relationship to the seed container or seed object, wherein the recursive search proceeds in a direction from a parent container or parent object to a child container or child object;
flagging one or more identified child containers or child objects or dependent containers or dependent objects for deletion based on respective flag statuses of any parent containers or objects of the identified child containers or child objects or dependent containers or dependent objects;
upon completion of the search, selectively deleting the one or more child containers or child objects or dependent containers or dependent objects flagged for deletion; and

automatically executing, in response to the deleting of the child containers or child objects or the dependent containers or dependent objects, the recursive search starting from the seed container or seed object or a deleted child container or deleted child object to identify any additional container or additional object that corresponds with the search criteria and delete the any additional container or additional object.

2. The system of claim 1 , wherein the search criteria corresponds to a data retention policy, the respective flag statuses indicate whether the any parent containers are flagged for deletion, and the flagging of the identified child container is in response to the any parent containers being flagged for deletion.

3. The system of claim 1 , wherein the selectively deleting of the one or more child containers or child objects or dependent containers or dependent objects comprises deleting a child container in response to the any parent containers being flagged for deletion, and the operations further comprise:
automatically executing, in response to the deleting of the child container, the recursive search using the search criteria based on a first time interval until no new containers are flagged for deletion;
in response to no new containers being flagged for deletion, increasing the first time interval to a second time interval; and
automatically executing the recursive search using the search criteria based on the second time interval.

4. The system of claim 3 , wherein the second time interval is exponentially increased with respect to the first time interval.

5. The system of claim 3 , wherein the operations further comprise:
in response to new containers being flagged for deletion based on the second time interval, setting the second time interval to the first time interval; and
automatically executing the recursive search using the search criteria based on the first time interval.

6. The system of claim 1 , wherein the selectively deleting comprises:
modifying one or more edges connected to the child container;
removing attributes associated with the child container; or
modifying a hierarchy corresponding with a parent or a sub-child of the child container.

7. The system of claim 1 , wherein the search criteria corresponds to a version identifier of the data.

8. A method implemented by a computing system including one or more processors and storage media storing machine-readable instructions, wherein the method is performed using the one or more processors, the method comprising:
storing the data in or representing the data as a plurality of containers or objects;
identifying a seed container or seed object satisfying a search criteria and flagging the seed container or seed object for deletion;
recursively searching to identify child containers or child objects linked to the seed container or seed object, wherein the child containers or child objects have a direct or an indirect child relationship to the seed container or seed object, wherein the recursive search proceeds in a direction from a parent container or parent object to a child container or child object;
flagging one or more identified child containers or child objects or dependent containers or dependent objects for deletion based on respective flag statuses of any parent containers or objects of the identified child containers or child objects or dependent containers or dependent objects;
upon completion of the search, selectively deleting the one or more child containers or child objects or dependent containers or dependent objects flagged for deletion; and
automatically executing, in response to the deleting of the one or more child containers or objects or dependent containers or dependent objects, the recursive search using the search criteria based on a first time interval.

9. The method of claim 8 , wherein the search criteria corresponds to a data retention policy, the respective flag statuses indicate whether the any parent containers are flagged for deletion, and the flagging of the identified child container is in response to the any parent containers being flagged for deletion.

10. The method of claim 8 , wherein the selectively deleting comprises:
modifying one or more edges connected to the child container;
removing attributes associated with the child container; or
modifying a hierarchy corresponding with a parent or a sub-child of the child container.

11. The method of claim 8 , wherein the search criteria corresponds to a version identifier of the data.

12. A non-transitory computer readable medium comprising instructions that, when executed, cause one or more processors of a computing system to perform:
storing the data in or representing the data as a plurality of containers or objects;
identifying a seed container or seed object satisfying a search criteria and flagging the seed container or seed object for deletion;
recursively searching to identify child containers or child objects linked to the seed container or seed object, wherein the child containers or child objects have a direct or an indirect child relationship to the seed container or seed object, wherein the recursive search proceeds in a direction from a parent container or parent object to a child container or child object;
flagging one or more identified child containers or child objects or dependent containers or dependent objects for deletion based on respective flag statuses of any parent containers or objects of the identified child containers or child objects or dependent containers or dependent objects;
upon completion of the search, selectively deleting the one or more child containers or child objects or dependent containers or dependent objects flagged for deletion; and
automatically executing, in response to the deleting of the one or more child containers or objects or dependent containers or dependent objects, the recursive search using the search criteria based on a first time interval.

13. The non-transitory computer readable medium of claim 12 , wherein the search criteria corresponds to a data retention policy, the respective flag statuses indicate whether the any parent containers are flagged for deletion, and the flagging of the identified child container is in response to the any parent containers being flagged for deletion.

Assignees

• Palantir Technologies Inc

Inventors

• Juelich Jakob
• Baker James

Classifications

• G06F16/162

  Delete operations (erasing in storage systems G06F3/0652) · CPC title

• G06F16/953

  Querying, e.g. by the use of web search engines · CPC title

• G06F21/6227 Primary

  where protection concerns the structure of data, e.g. records, types, queries · CPC title

• G06F16/9024

  Graphs; Linked lists (G06F16/9027 takes precedence) · CPC title

• G06F16/90335

  Query processing · CPC title