Nested discovery and deletion of resources

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.

FIELD OF THE INVENTION

This disclosure relates to approaches for providing nested discovery and deletion of resources in a distributed system architecture.

BACKGROUND

Data management systems can store and manage data and data relationships. Some of this data should no longer be used for various reasons, including when data are older than a threshold date, when new data are added that would replace old data, when only the most recent number of versions would be required for retention, or when an entire dataset must be deleted (e.g., client request, privacy concerns, etc.). When data comprise various electronic resources, including a digital folder, comments, reports or other analysis, or files stored within the system, the possibility of data that references other data becomes massive.

SUMMARY

The storage and management of the data and data relationships may require deletion of the data. One solution is to access a dataset that stores the data in the data management system and merely delete the data within it. However, some data management systems comprise millions of data references across datasets, including related data, derived objects from original data, reports referencing the data, and data dependencies. When data are deleted, the derived or referenced data must be deleted as well. As such, if something is merely deleted from a dataset, some of these data references may remain. Additionally, data streams may continuously provide data that is stored with the system. The goal is to fully delete the data, which is very difficult in a large data management system.

Various embodiments of the present disclosure may include systems, methods, and non-transitory computer readable media configured to provide nested discovery and deletion of resources in a distributed system architecture. Resource data can be identified, recursively traversed, and deleted through a methodical process that includes adding an endpoint to help identify all seed data and its linked data for deletion.

In some embodiments, search criteria may be received by a system. The search criteria may be associated with data that is stored and may be deleted in the system. The data may be stored in a plurality of datasets at a plurality of workspaces of the system. The search criteria may be applied to the data so that the application of the search criteria identifies seed data in the plurality of datasets. The system may recursively search the plurality of workspaces of the system for linked data associated with the seed data. An endpoint process may be initiated for each the seed data and the linked data. In some examples, the endpoint process may flag the seed data and the linked data for deletion. Upon completion of the search, the seed data and the linked data may be deleted based at least in part on the endpoint process. In some examples, the recursive search may be automatically repeated at a predetermined time interval to identify and remove future data that are stored in the plurality of datasets. The future data may correspond with the search criteria associated with the data.

In some embodiments, the search criteria may comprise a threshold date, identification of new data, or version identifier associated with the seed data.

In some embodiments, the linked data may comprise data files derived from the seed data.

In some embodiments, the linked data may comprise data permissions of users permitted to access the seed data.

In some embodiments, the system may further comprise instructions to send one or more notifications of the deletion to one or more administrators.

DETAILED DESCRIPTION

Under conventional approaches, various types of data can be stored and represented using an object model. The object graph created based on the object model may include a number of objects that serve as containers for data. Each object can include a number of object components. The data represented by such objects may itself reside on various data sources (e.g., federated data sources, conventional databases, etc.). In some instances, conventional approaches for managing objects and data represented by those objects may be inadequate. For example, conventional approaches may not be sufficient to implement data retention policies that manage the retention of both objects and data represented by those objects.

A claimed solution rooted in computer technology overcomes problems specifically arising in the realm of computer technology. In various embodiments, data are identified, recursively traversed, and deleted through a methodical process that includes adding an endpoint to help identify all seed data and its linked data for deletion.

To identify the seed data, the claimed solution may generate a filter to find the seed data in a dataset that matches particular criteria. The criteria may include basic filtering rules, including identifying data by a term or threshold date, version identifier, or any data that may be stored in association with the particular data store location. The identification of the seed data may correspond with a filtering mechanism that identifies data that corresponds with a particular search function associated with the identified criteria.

Linked data may also be identified. For example, the claimed solution may implement the filter to identify the linked data corresponding with the seed data. In a sample illustration, seed data may be stored with a first dataset and permissions of users that can access the seed data may be stored in a separate dataset. In another example, a first service with multiple datasets may comprise the first dataset and a second service with multiple different datasets may comprise the second dataset. Each of these data locations of seed data and linked data may be identified through the traversal process.

Additionally, the data management system may comprise a micro-services architecture without a central repository where resources are stored. For example, different services may be tasked with managing different types of data. The different types of data can be represented based on an ontology and subsequently linked based on their relationships to one another. The search for linked data may comprise querying hundreds of services in a recursive process. In some embodiments, an API may be implemented that can receive an object identifier of the seed data and request services tasked with managing various datasets to search for a matching datatype of the object identifier (e.g., using subscribing logic). In the search process, the system may initiate the search at a seed node and traverse through the edges of the object graph. When additional data are found, the object identifiers and/or the object type associated with each node may be updated to identify the future deletion status.

The data identified through the traversal process may be marked or flagged for deletion through the use of an endpoint. The endpoint can correlate the data with an identification (e.g., tag, flag, identifier, etc.) to delete it at a later time. For example, when a list of data entries or data tags identifies the data object for deletion by associating an endpoint for each data object, the system can query the list to identify further dependencies from this data without altering the deletion process for the data.

The traversal may be ended when there are no more nodes in an object graph. For example, the system may continue searching through browse nodes until an object node is identified as anonymized data or comprises a restriction on access of the corresponding data.

Upon completion of the traversal, the system may delete all seed data and linked data that were identified through the traversal process (e.g., marked or flagged for deletion). The deletion process may generate an error log that may document any failure encountered when attempting to delete the seed data or linked data.

At some time frame, for example at the end of the day, the system can send notifications of imminent or upcoming object deletions to a designated administrator. In some examples, the notification may include a confirmation that all deletion tasks are completed and that all data has been successfully purged from the system.

In some instances, new data may be added to the system that is related to the first dataset. For example, the new data may include a report (e.g., linked data) that relies on aggregated data (e.g., linked data or seed data) that was deleted. The identification process may be repeated constantly at predetermined intervals. In some examples, the predetermined intervals may include one hour, five hours, 125 hours (e.g., multipliers and iterations of five, etc.) to check for any caching systems or constant streams of data that are received from external sources. The constant scanning of the system may help identify receiving data that should have been deleted. In some examples, the system may stop initiating the identification process when no data are returned that match the search criteria.

The approaches disclosed herein enable a recursive discovery and deletion of resources in a distributed, data management system architecture. Rather than merely accessing a single dataset in the system, the recursive process may identify related data, derived data objects from original data, reports referencing the data, analyses of the data, and other data dependencies. Additionally, data streams that continuously provide data may be identified and the data corresponding with the continuous data stream may be deleted at a predetermined interval of time. The automatic monitoring of future data may help improve data compliance according to various data privacy restrictions and efficiently maintain data structures for improved system maintenance. Further, deletion of data may reclaim disk space, help ensure individual files are timely removed from the distributed system, and help further limit derived data or referenced data to further increase data security.

FIG. 1illustrates an example environment100for providing nested discovery and deletion of resources in a distributed system architecture, in accordance with various embodiments. Example environment100may include computing system102. Computing system102may include one or more processors and memory. The processor(s) may be configured to perform various operations by interpreting machine-readable instructions stored in the memory. Environment100may also include one or more datastores that are accessible to computing system102(e.g., via one or more network(s)). In some embodiments, the datastore(s) may include various databases, application functionalities, application/data packages, and/or other data that are available for download, installation, and/or execution.

In some embodiments, computing system102may comprise a micro-services architecture without a central repository where resources are stored. For example, different services may be tasked with managing different types of data. The different types of data can be represented based on an ontology, including nodes in an object graph, and subsequently linked based on their relationships to one another. Additional details describing the micro-services architecture and/or object graph will be provided in reference toFIGS. 2-3.

In some embodiments, computing system102may store and manage various data as objects in one or more object graphs. In some embodiments, an object graph may be made up of a number of objects that serve as containers for data. The object graph can also identify various relationships between objects, for example, using edges (or links) that connect objects. Each object can include a number of object components including, for example, a properties component that includes structured pieces of information, a media component that includes binary attachments of data (e.g., text documents, images, videos, etc.), a notes component (e.g., a free text container), and one or more respective links (or edges) that associate the object with other objects in the object graph. In some instances, the object graph can include different types of objects. For example, an object may represent an entity (e.g., person(s), place(s), thing(s), etc.), an activity (e.g., event, incident, etc.), a document, or multimedia, to name some examples. In some embodiments, objects can be associated with properties (or states) that can be used to manage retention of those objects in the object graph and/or data represented by those objects in one or more data sources. These data sources may include federated data stores, databases, or any other type of data source from which data can be ingested and represented as objects, for example. In some embodiments, data corresponding to populated object graphs is stored and accessible through one or more data stores130.

In some embodiments, computing system102may include process engine104. Process engine104may include node engine106, dependence engine108, deletion engine110, and recursion engine112. Process engine104may be executed by the processor(s) of computing system102to perform various operations including those operations described in reference to node engine106, dependence engine108, deletion engine110, and recursion engine112. In general, process engine104may be implemented, in whole or in part, as software that is capable of running on one or more computing devices or systems. In one example, process engine104may be implemented as or within a software application running on one or more computing devices (e.g., user or client devices) and/or one or more servers (e.g., network servers or cloud servers). In some instances, various aspects of node engine106, dependence engine108, deletion engine110, and recursion engine112may be implemented in one or more computing systems and/or devices.

Environment100may also include one or more data stores130accessible to computing system102. Data stores130may be accessible to computing system102either directly or over network150. In some embodiments, data stores130may store data that may be accessed by the process engine104to provide the various features described herein. In some instances, the data stores130may include federated data stores, databases, or any other type of data source from which data may be stored and retrieved, for example. In some implementations, data stores130may include various types of datasets on which determinations of accuracy or consistency with other information can be made. In general, a user operating computing device120can interact with computing system102over network150, for example, through one or more graphical user interfaces and/or application programming interfaces.

Node engine106may be configured to identify one or more basic units of a data structure associated with computing system102. For example, a set of objects (e.g., nodes) may represent data stored on one or more data sources. Data may comprise an identifier, description, and any other data described in reference to the object graph.

Node engine106may identify one or more data sources. A data source may correspond to, for example, a text file (e.g., a CSV file) that includes rows of values separated by commas. In this example, an object may be created to represent a row of values and properties of the object can each correspond to a comma separated value in the row. The identification of an endpoint or other data retention configurations may also be applied to data that is represented by these objects. Such data may be stored and accessed through data sources. For example, each object can be associated with various components (e.g., properties) as defined by an object-based data model. An object can, therefore, represent data that remains stored and accessible through a given data source.

Node engine106may identify one or more data nodes that correspond with an object represented by a single node in an object graph. Attributes of data nodes may include a node identifier, description of data corresponding with the data node object, and links to other nodes, implemented by pointers. Data nodes may be related to other data nodes in the object graph. For example, a first data node (e.g., parent node) may reference one or more second data nodes (e.g., children nodes) or vice versa. The linked relationships between these data nodes may be identified in the attributes of each node.

Data nodes may comprise any data stored with computing system102. In some examples, a data object can inherit data properties and methods from other nodes including a parent node and child node. One or more data nodes may be stored in a plurality of datasets at a plurality of workspaces of computing system102, including in data stores130.

When a new node is added to computing system102, a data index may be updated to include an object identifier associated with the new data node. Node engine106may write the object identifier to the data index. Linked relationships between these data nodes may also be updated with the data index, including object identifiers that identify links to parent nodes and children nodes of the new node and with existing data objects. The data index may be stored with data stores130.

Node engine106may be configured to receive search criteria associated with data. In some examples, the search criteria may correspond with one or more attributes of the data nodes in the object graph structure. Node engine106may apply the search criteria through a search or filtering feature of the datasets. The one or more data nodes that match the search criteria may be identified as seed data in the plurality of datasets. In some examples, the seed data may be associated with one or more attributes that match the search criteria. The search criteria may include basic filtering rules, including identifying data by a term or threshold date, version identifier, or any data that may be stored in association with the particular data store location, such that the node objects that match the search criteria would include the threshold date, identification of new data, or version identifier included with the search criteria.

The search criteria may correspond with one or more policies of computing system102. The policy may correspond with electronic-based rules that determine a duration of time allowed to store data with computing system102. The policy may be used to generate the search criteria. For example, the policy may correspond with an age-based retention of the data, a version identifier of the data, or any other filtering identifiers received by node engine106.

Node engine106may be configured to apply the search criteria to the data to identify the seed data. Data may be identified by comparing metadata or other data tags associated with data stored in data stores130with the search criteria. Upon matching the search criteria with the metadata or other data tags associated with the data, a data identifier may be identified. The data corresponding with the match can be identified as corresponding with the search criteria and or data policy.

In some embodiments, node engine106may be configured to query a plurality of services in a recursive process through the micro services architecture of computer system102. In some embodiments, an application programming interface (API) may be implemented that can receive the search criteria and request services tasked with managing various datasets to search for matching data types of the search criteria (e.g., using subscribing logic).

In some examples, subscribing logic is used. For example, one or more microservices implement an interface that correspond with an endpoint. A traversal service calls the endpoint associated with the interface and records the response to the calls. As an illustrative example, the call may comprise a request for a binary response from the endpoint (e.g., requesting a confirmation if a resource is of a particular type). In some examples, the response may implement a set of filters that determine which kind of resources the microservice can subscribe to as part of the subscribing logic.

Dependence engine108may be configured to recursively search the plurality of workspaces of computing system102associated with the seed data to determine one or more linked object nodes. For example, dependence engine108may query the data index to identify any object identifiers that identify a linked relationship between the object identifier of the seed node and one or more child or parent nodes (e.g., the linked data).

In some embodiments, objects can be identified based on their relationships to other objects. For example, relationships between objects in the object graph can be represented using corresponding edges (or links). In some instances, these object relationships can be used to identify additional related objects on which actions can be performed. For example, a set of objects may relate to a project (or case). In this example, dependence engine108can be instructed to perform some action on all objects that relate to the project. Here, dependence engine108can use existing object relationships to identify such objects. In some embodiments, edge distance can be used to identify related objects that may otherwise not be identified using some specified criteria. For example, the criteria may specify that objects corresponding to a first case be scheduled for deletion (or some other action). The criteria may also specify that any other objects linked to objects corresponding to the first case with an edge distance of two also be deleted, such that a first object corresponding to the first case may be linked to a second object that corresponds to a second case. Further, the second object may be linked to a third object corresponding to a third case. In this example, the first object, the second object, and the third object can all be scheduled for deletion in view of the specified criteria.

In some embodiments, the recursive search implemented by dependence engine108may be configured to traverse through edges of the object graph. The recursive search may begin at the seed node of the object graph and traverse through the edges associated with the seed node of the object graph.

Dependence engine108may be configured to apply second search criteria to the data. For example, a first plurality of object identifiers associated with seed data may be determined. The second search criteria may identify permissions of users that can access the seed data. The data determined to be matching the second search criteria may be identified as the linked data. In another example, the first plurality of object identifiers associated with the seed data may be determined and the seed data may correspond with a first service of computing system102. A second plurality of object nodes may be identified that correspond with the a second service of computing system102. The plurality of services may correspond with a plurality of datasets stored with data stores130. Each of these data locations of seed data and linked data may be identified by dependence engine108of computing system102.

Dependence engine108may be configured to initiate an endpoint process for each the seed data and the linked data. The endpoint process may flag the seed data and the linked data for deletion. The endpoint process, for example, may associate each data node (e.g., seed data, linked data, etc.) with an endpoint (e.g., an entry point to a service, a process, or destination in a service oriented architecture of computing system102). Each of these identified endpoints may be accessed by deletion engine110for deletion at a future point of time.

In some embodiments, dependence engine108may be configured to add object identifiers and/or object types associated with each data node to a data index to identify a future deletion status. For example, the data index may comprise any object identifier associated with data that matches search criteria or is dependent on data that matches the search criteria. In some embodiments, dependence engine108may identify the seed node associated with the object identifier in the index stored in data stores130, including any seed nodes that match search criteria. Dependence engine108may also be configured to determine any child nodes associated with seed node (e.g., as linked data).

Deletion engine110may be configured to query the data index identifying seed data and linked data that has been determined to match the search criteria. The system can query the data index to identified dependencies from the data without preventing the data from being deleted. In other embodiments, deletion engine110may be configured to identify all of the endpoints associated with seed data or linked data.

Deletion engine110may be configured to determine whether any child nodes of seed node includes other parent nodes. For example, seed node may be located between a parent node and a child node in a representation of the object graph. Deletion engine110may be configured to determine whether the child node is linked to other object nodes other than the seed node, including a second parent node. When a second parent node exists that is not identified for deletion, the child node may be preserved and not deleted. When a second parent node exists that is identified for deletion, the child node may be deleted with the second parent node and the seed node.

Upon completion of the search for seed data and linked data, deletion engine110may be configured to delete the seed data and the linked data identified. For example, deletion engine110may delete the seed data and the linked data identified as each corresponding with an endpoint determined through the endpoint process. In another example, deletion engine110may delete seed data and linked data associated with object identifiers in a data index.

At some time frame, for example at the end of the day, deletion engine110may generate and transmit one or more notifications of imminent or upcoming object deletions to a designated administrator. In some examples, the notification may include a confirmation that all deletion tasks are completed and that all data has been successfully purged from the system.

In some embodiments, one or more notifications may be sent to the appropriate users (or administrators) before deleting the data. Such notifications may be sent using conventional approaches for electronically communicating information. In some embodiments, a pre-approval for deletion may be required from authorized users (or administrators) before any actions are performed. In such embodiments, deletion engine110can request such approval by the authorized users (or administrators) before performing those actions.

Recursion engine112may be configured to automatically repeat the recursive search at a predetermined time interval. In some examples, the predetermined intervals may include one hour, five hours, 125 hours (e.g., multipliers and iterations of five, etc.) to check for any caching systems or constant streams of data that are received from external sources. The constant scanning of the system may help identify receiving data that should have been deleted and/or identify and remove future data that are stored in the plurality of datasets of computing system102. In some examples, the system may stop initiating the identification process when no data are returned that match the search criteria.

Recursion engine112may also be configured to recursively search for items during and after the traversal process. For example, the traversal process may not be atomic so that users can perform operations on the system between the point in time of the traversal and the point in time of the deletion. As an illustrative example, resource A may be selected for deletion, then a user creates resource B that depends on resource A. When resource A gets deleted, resource B should have also been deleted, because it may contain data of resource A. To ensure resource B will be selected for deletion, recursion engine112may first discover resources downstream of a seed node (e.g., resource A) and delete it. Recursion engine112may restart the discovery from all nodes that have been deleted to determine whether new resources have been added in the meantime and delete those as well. Recursion engine112can repeat this process until no new resources are found. However, even if resource A is deleted, it is possible that some microservice still holds cached data about resource A; it is still possible to create a resource B that depends on resource A. Thus, even after no resources are found, recursion engine112may repeat this process further, but in exponentially growing intervals. Repeating the discovery process again and again can be used to find the resource B instances to be deleted as well.

In some embodiments, the future data may correspond with the search criteria, including a threshold date, identification of new data corresponding with the search criteria, or version identifier associated with the seed data. In some embodiments, the future data may correspond with new linked data associated with previously deleted seed data. The previously deleted seed data may be identified as corresponding with an endpoint and/or data index that may not have been deleted by deletion engine110, yet may not include the actual data to be deleted.

FIG. 2illustrates an example node resource structure, in accordance with various embodiments. In illustration200, a plurality of nodes is provided, including a seed node202and a plurality of linked nodes associated with seed node202. Each of the plurality of nodes may be associated with data, where the data are stored in a plurality of datasets in a plurality of workspaces of the system. The plurality of nodes, including seed node202and the plurality of linked nodes, may be recursively searched and associated with an endpoint to flag the data corresponding with these nodes for deletion.

The plurality of nodes may be discoverable through a variety of processes as described above. For example, seed node202may be discoverable by matching search criteria (e.g., a text string, etc.) to the data associated with seed node202. In some examples, this may include querying data to determine a description of seed node202and matching at least part of the description to the search criteria.

The linked nodes may be discoverable by analyzing relationship data associated with seed node202. For example, seed node202may correspond with a direct link to a plurality of nodes204,206,210,212,220,230, and240. Some of the nodes may comprise a plurality of links, including the relationships between linked node220and seed node202. Each of these linked nodes may correspond with linked data of the seed data.

Seed node202may correspond with one or more parent nodes or one or more children nodes. For example, seed node202may correspond with parent nodes206,210,212, and230. In some embodiments, seed node202(e.g., embodied as a child node of multiple parent nodes) may inherit dataset properties of parent nodes206,210,212, and230as well as include additional properties that may be unique to seed node202. In these instances, at least one of the data properties of seed node202may be shared with each of parent nodes206,210,212, and230and may be discoverable through a search of a plurality of workspaces of the system.

Additional linked nodes may be discoverable as well. For example, each of the identified parent nodes206,210,212, and230may correspond with additional parent nodes and/or child nodes, including nodes208,218,214,216,232,234,236,238, and222.

Seed node202and the plurality of linked nodes (e.g., directly linked nodes, linked nodes that are linked to linked nodes, etc.) may be identified through a recursive search of the plurality of workspaces of the system. Once identified, the system may initiate an endpoint process for each of the seed data and the linked data associated with the plurality of nodes identified through the search, as illustrated withFIG. 3.

FIG. 3illustrates an example node resource structure, in accordance with various embodiments. In illustration300, a plurality of nodes has been identified through a recursive search of the plurality of workspaces of the system. For example, the seed data matching the search criteria may correspond with seed node310. The recursive search may identify a plurality of linked nodes from seed node310, including nodes312,314,316,320,322. A plurality of nodes may be available in the system but not identified as linked nodes through the recursive search, including node330,340,342,344,346,348.

An endpoint process may be initiated for the seed data and the linked data corresponding with each of these nodes. For example, the endpoint process may flag the data corresponding with each node for deletion (e.g., in programming code, in one or more datasets, in a data log, etc.) by assigning a unique endpoint to the plurality of nodes corresponding with seed data or linked data. At a later point in time, the system may search for any endpoint identified in the programming code that was assigned through the endpoint process.

In an illustrative example, node310may be associated with an endpoint and the recursive search may identify any nodes associated with node310. The search may also identify nodes312,314,316as comprising a single parent node associated with node310. Nodes312,314,316may be associated with endpoints as well. Node320may be associated with an endpoint because node310is a parent node of node320with no other parent node. Node322may not be associated with an endpoint because node322is associated with two parent nodes320,330and at least one of these parent nodes (node330) has not been identified through the recursive search, there is no endpoint associated with node330. Node322may not be associated with an endpoint as well for having at least one parent not associated with an endpoint. As such, nodes310,312,314,316,320may be associated with endpoints during the endpoint process. In this example, nodes322,330,340,342,344,346,348may be preserved and not associated with an endpoint during the endpoint process. The traversal of the nodes may be ended when there are no more nodes in the object graph.

Upon completion of the search, data corresponding with each endpoint may be deleted by modifying the connectivity to the data, removing attributes associated with the data, modifying the hierarchy corresponding with parent or child nodes of the data, and the like. For example, data stored in a plurality of datasets in a plurality of workspaces of the system may be removed from the system (e.g., by highlighting at least one data entry in a database and selecting “delete” as an operation by an administrator or automated process of computing system102, etc.). In some examples, the system may initiate a deletion process that programmatically and/or automatically identifies the datasets corresponding with the data in the workspaces of the system and selects the “delete” operation. In some examples, any pointers that are directed to the data may be removed so that the data is undiscoverable in memory.

In some examples, the deletion process may generate an error log. The error log may identify any data that are not deleted yet are associated with an endpoint during the endpoint process. The error log may document any failure encountered when attempting to delete the seed data or linked data associated with these nodes.

Example Flowchart of Process

FIG. 4depicts a flowchart of an example method400for inferring relationships, in accordance with various embodiments. The operations of method400presented below are intended to be illustrative and, as such, should not be viewed as limiting. In some implementations, method400may be accomplished with one or more additional operations not described, and/or without one or more of the operations discussed. In some implementations, two or more of the operations may occur substantially simultaneously. The described operations may be accomplished using some or all of the system components described herein.

In an operation402, method400may include receiving search criteria associated with data. In some examples, the data are stored in a plurality of datasets at a plurality of workspaces of the system. In an operation404, the method400may apply the search criteria to the data to identify seed data. In an operation406, the method may recursively search the plurality of workspaces of the system for linked data associated with the seed data. Operation406may be performed recursively and/or multiple times. In an operation408, an endpoint process may be initiated for each of the seed data and the linked data. In some examples, the endpoint process may flag the seed data and the linked data for deletion. In an operation410, upon completion of the search, the seed data and the linked data may be deleted based in part on the endpoint process. In an operation412, the recursive search may be automatically repeated at a predetermined time interval to identify and remove future data corresponding with the search criteria associated with the data.

Hardware Implementation

FIG. 5depicts a block diagram of an example computer system500in which any of the embodiments described herein may be implemented. The computer system500includes a bus502or other communication mechanism for communicating information, one or more hardware processors504coupled with bus502for processing information. Hardware processor(s)504may be, for example, one or more general purpose microprocessors.

The computer system500further includes a read only memory (ROM)508or other static storage device coupled to bus502for storing static information and instructions for processor504. A storage device510, such as a magnetic disk, optical disk, or USB thumb drive (Flash drive), etc., is provided and coupled to bus502for storing information and instructions.

Various forms of media may be involved in carrying one or more sequences of one or more instructions to processor504for execution. For example, the instructions may initially be carried on a magnetic disk or solid state drive of a remote computer. The remote computer may load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system500may receive the data on the telephone line and use an infra-red transmitter to convert the data to an infra-red signal. An infra-red detector may receive the data carried in the infra-red signal and appropriate circuitry may place the data on bus502. Bus502carries the data to main memory506, from which processor504retrieves and executes the instructions. The instructions received by main memory506may retrieves and executes the instructions. The instructions received by main memory506may optionally be stored on storage device510either before or after execution by processor504.

The computer system500also includes a communication interface518coupled to bus502. Communication interface518provides a two-way data communication coupling to one or more network links that are connected to one or more local networks. For example, communication interface518may be an integrated services digital network (ISDN) card, cable modem, satellite modem, or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface518may be a local area network (LAN) card to provide a data communication connection to a compatible LAN (or WAN component to communicated with a WAN). Wireless links may also be implemented. In any such implementation, communication interface518sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.

The computer system500may send messages and receive data, including program code, through the network(s), network link and communication interface518. In the Internet example, a server might transmit a requested code for an application program through the Internet, the ISP, the local network and the communication interface518.

Engines, Components, and Logic

In some embodiments, a hardware engine may be implemented mechanically, electronically, or any suitable combination thereof. For example, a hardware engine may include dedicated circuitry or logic that is permanently configured to perform certain operations. For example, a hardware engine may be a special-purpose processor, such as a Field-Programmable Gate Array (FPGA) or an Application Specific Integrated Circuit (ASIC). A hardware engine may also include programmable logic or circuitry that is temporarily configured by software to perform certain operations. For example, a hardware engine may include software executed by a general-purpose processor or other programmable processor. Once configured by such software, hardware engines become specific machines (or specific components of a machine) uniquely tailored to perform the configured functions and are no longer general-purpose processors. It will be appreciated that the decision to implement a hardware engine mechanically, in dedicated and permanently configured circuitry, or in temporarily configured circuitry (e.g., configured by software) may be driven by cost and time considerations.

Accordingly, the phrase “hardware engine” should be understood to encompass a tangible entity, be that an entity that is physically constructed, permanently configured (e.g., hardwired), or temporarily configured (e.g., programmed) to operate in a certain manner or to perform certain operations described herein. As used herein, “hardware-implemented engine” refers to a hardware engine. Considering embodiments in which hardware engines are temporarily configured (e.g., programmed), each of the hardware engines need not be configured or instantiated at any one instance in time. For example, where a hardware engine comprises a general-purpose processor configured by software to become a special-purpose processor, the general-purpose processor may be configured as respectively different special-purpose processors (e.g., comprising different hardware engines) at different times. Software accordingly configures a particular processor or processors, for example, to constitute a particular hardware engine at one instance of time and to constitute a different hardware engine at a different instance of time.

The various operations of example methods described herein may be performed, at least partially, by one or more processors that are temporarily configured (e.g., by software) or permanently configured to perform the relevant operations. Whether temporarily or permanently configured, such processors may constitute processor-implemented engines that operate to perform one or more operations or functions described herein. As used herein, “processor-implemented engine” refers to a hardware engine implemented using one or more processors.

Language

It will be appreciated that an “engine,” “system,” “data store,” and/or “database” may comprise software, hardware, firmware, and/or circuitry. In one example, one or more software programs comprising instructions capable of being executable by a processor may perform one or more of the functions of the engines, data stores, databases, or systems described herein. In another example, circuitry may perform the same or similar functions. Alternative embodiments may comprise more, less, or functionally equivalent engines, systems, data stores, or databases, and still be within the scope of present embodiments. For example, the functionality of the various systems, engines, data stores, and/or databases may be combined or divided differently.

“Open source” software is defined herein to be source code that allows distribution as source code as well as compiled form, with a well-publicized and indexed means of obtaining the source, optionally with a license that allows modifications and derived works.

Although the invention has been described in detail for the purpose of illustration based on what is currently considered to be the most practical and preferred implementations, it is to be understood that such detail is solely for that purpose and that the invention is not limited to the disclosed implementations, but, on the contrary, is intended to cover modifications and equivalent arrangements that are within the spirit and scope of the appended claims. For example, it is to be understood that the present invention contemplates that, to the extent possible, one or more features of any embodiment may be combined with one or more features of any other embodiment.

Other implementations, uses and advantages of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. The specification should be considered to describe examples only, and the scope of the invention is accordingly intended to be limited only by the following claims.