Nested discovery and deletion of resources

US11481399B1 · US · B1

Patent metadata
FieldValue
Publication numberUS-11481399-B1
Application numberUS-202016870335-A
CountryUS
Kind codeB1
Filing dateMay 8, 2020
Priority dateOct 25, 2019
Publication dateOct 25, 2022
Grant dateOct 25, 2022

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.

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

Opening claim text (preview).

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: receive search criteria associated with the data, wherein the data are stored in a plurality of datasets at a plurality of workspaces of the system; apply the search criteria to the data, wherein the application of the search criteria identifies seed data in the plurality of datasets; recursively search the plurality of workspaces of the system for linked data associated with the seed data; initiate an endpoint process that flags the seed data and the linked data for deletion; upon completion of the search, delete the seed data and the linked data identified based at least in part on the endpoint process; and automatically repeat, in response to the deletion, the recursive search starting from the deleted seed data and the linked data to identify any additional data that corresponds with the search criteria and remove the any additional data. 2. The system of claim 1 , wherein the search criteria comprises a threshold date, identification of new data, or version identifier associated with the seed data. 3. The system of claim 1 , wherein the linked data comprises data files derived from the seed data. 4. The system of claim 1 , wherein the linked data comprises data permissions of users permitted to access the seed data. 5. The system of claim 1 , further configured to: send one or more notifications of the deletion to one or more administrators. 6. The system of claim 1 , wherein deleting the seed data and the linked data comprises an automated process performed by the system. 7. The system of claim 1 , wherein deleting the seed data and the linked data comprises highlighting at least one data entry in a database. 8. The system of claim 1 , wherein the seed data is stored as an object in an object graph. 9. The system of claim 8 , wherein the object corresponds with a node identifier, description of data corresponding with the node, and a link to other nodes implemented by pointers. 10. The system of claim 8 , wherein a linked object to the object in the object graph inherits a data property of the object. 11. 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: receiving search criteria associated with the data, wherein the data are stored in a plurality of datasets at a plurality of workspaces of the system; applying the search criteria to the data, wherein the application of the search criteria identifies seed data in the plurality of datasets; recursively searching the plurality of workspaces of the system for linked data associated with the seed data; initiating an endpoint process that flags the seed data and the linked data for deletion; upon completion of the search, deleting the seed data and the linked data identified based at least in part on the endpoint process; and automatically repeat, in response to the deletion, the recursive search starting from the deleted seed data and the linked data to identify any additional data that corresponds with the search criteria and remove the any additional data. 12. The method of claim 11 , wherein the search criteria comprises a threshold date, identification of new data, or version identifier associated with the seed data. 13. The method of claim 11 , wherein the linked data comprises data files derived from the seed data. 14. The method of claim 11 , wherein the linked data comprises data permissions of users permitted to access the seed data. 15. The method of claim 11 , further comprising: sending one or more notifications of the deletion to one or more administrators. 16. A non-transitory computer readable medium comprising instructions that, when executed, cause one or more processors to perform: receiving search criteria associated with the data, wherein the data are stored in a plurality of datasets at a plurality of workspaces of the system; applying the search criteria to the data, wherein the application of the search criteria identifies seed data in the plurality of datasets; recursively searching the plurality of workspaces of the system for linked data associated with the seed data; initiating an endpoint process that flags the seed data and the linked data for deletion; upon completion of the search, deleting the seed data and the linked data identified based at least in part on the endpoint process; and automatically repeat, in response to the deletion, the recursive search starting from the deleted seed data and the linked data to identify any additional data that corresponds with the search criteria and remove the any additional data. 17. The non-transitory computer readable medium of claim 16 , wherein the search criteria comprises a threshold date, identification of new data, or version identifier associated with the seed data. 18. The non-transitory computer readable medium of claim 16 , wherein the linked data comprises data files derived from the seed data. 19. The non-transitory computer readable medium of claim 16 , wherein the linked data comprises data permissions of users permitted to access the seed data. 20. The non-transitory computer readable medium of claim 16 , further causing the one or more processors to perform: sending one or more notifications of the deletion to one or more administrators.

Assignees

Inventors

Classifications

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

  • Query processing · CPC title

  • Clearing memory, e.g. to prevent the data from being stolen · CPC title

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

  • Querying, e.g. by the use of web search engines · 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 US11481399B1 cover?
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.…
Who is the assignee on this patent?
Palantir Technologies Inc
What technology area does this patent fall under?
Primary CPC classification G06F21/6227. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Oct 25 2022 00:00:00 GMT+0000 (Coordinated Universal Time) (B1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 1 related publication on this page (citations in our corpus or others sharing the same primary CPC).