Patent classifications
G06F16/27
METADATA OBJECT IDENTIFIER REGISTRY
Various examples are directed to systems and methods for administering data model metadata for a plurality of data models. A metadata service may receive a first retrieval request from a requesting system. The first retrieval request may comprise an indication of a first local object identifier referencing a definition of a first local object from a first data model and an indication of a target data model. The metadata service may retrieve a first record from a metadata identifier registry, where the first record comprises an indication of the first local object identifier and an indication of a first global object identifier corresponding to the first local object identifier. The metadata service may determine a second local object identifier referencing a definition of a second local object identifier referencing a definition of a second local object in the target data model and return the second local object identifier.
EMPLOYEE DATA REPLICATION SYSTEM
Disclosed herein are various embodiments for an employee data replication system. An embodiment operates by receiving a request to replicate employee data hosted by a host system. At least one of: a live date corresponding to when the employee data is to be live on the enterprise system or a selection of one or more applications to be used on the enterprise system is identified. A cutoff date for the employee data is calculated based on one or more of the live date and the selection of one or more applications, the cutoff date indicating an oldest date for which the employee data is to be replicated to the enterprise system. Employee data is replicated from the host system to the enterprise system based on the cutoff date, and an indication is provided that the replication has completed.
SYSTEMS, METHODS, AND APPARATUS FOR HIERARCHICAL AGGREGATION FOR COMPUTATIONAL STORAGE
A method for computational storage may include storing, at a storage device, two or more portions of data, wherein a first one of the two or more portions of data comprises a first fragment of a record and a second one of the two or more portions of data comprises a second fragment of the record, and performing, by the storage device, an operation on the first and second fragments of the record. The method may further include performing, by the storage node, a second operation on first and second fragments of a second record. The operation may include a data selection operation, and the method may further include sending a result of the data selection operation to a server. The method may further include sending a result of a first data selection operation to a server.
SYSTEMS AND METHODS FOR MATCHING ELECTRONIC ACTIVITIES WITH RECORD OBJECTS BASED ON ENTITY RELATIONSHIPS
The present disclosure relates to systems and methods for matching electronic activities with record objects based on entity relationships. The method can include accessing a plurality of electronic activities, identifying an electronic activity, identifying a first participant associated with a first entity and a second participant associated with a second entity, determining whether a record object identifier is included in the electronic activity, identifying a first record object of the system of record that includes an instance of the record object identifier, and storing an association between the electronic activity and the first record object. The method can include determining a second record object corresponding to the second entity, identifying, using a matching policy, a third record object linked to the second record object and identifying a third entity, and storing, by the one or more processors, an association between the electronic activity and the third record object.
SYSTEMS AND METHODS FOR MATCHING ELECTRONIC ACTIVITIES WITH RECORD OBJECTS BASED ON ENTITY RELATIONSHIPS
The present disclosure relates to systems and methods for matching electronic activities with record objects based on entity relationships. The method can include accessing a plurality of electronic activities, identifying an electronic activity, identifying a first participant associated with a first entity and a second participant associated with a second entity, determining whether a record object identifier is included in the electronic activity, identifying a first record object of the system of record that includes an instance of the record object identifier, and storing an association between the electronic activity and the first record object. The method can include determining a second record object corresponding to the second entity, identifying, using a matching policy, a third record object linked to the second record object and identifying a third entity, and storing, by the one or more processors, an association between the electronic activity and the third record object.
SELF-MANAGING DATABASE SYSTEM USING MACHINE LEARNING
A self-managing database system includes a metrics collector to collect metrics data from one or more databases of a computing system and an anomaly detector to analyze the metrics data and detect one or more anomalies. The system includes a causal inference engine to mark one or more nodes in a knowledge representation corresponding to the metrics data for the one or more anomalies and to determine a root cause with a highest probability of causing the one or more anomalies using the knowledge representation. The system includes a self-healing engine, to take at least one remedial action for the one or more databases in response to determination of the root cause.
SELF-MANAGING DATABASE SYSTEM USING MACHINE LEARNING
A self-managing database system includes a metrics collector to collect metrics data from one or more databases of a computing system and an anomaly detector to analyze the metrics data and detect one or more anomalies. The system includes a causal inference engine to mark one or more nodes in a knowledge representation corresponding to the metrics data for the one or more anomalies and to determine a root cause with a highest probability of causing the one or more anomalies using the knowledge representation. The system includes a self-healing engine, to take at least one remedial action for the one or more databases in response to determination of the root cause.
AGGREGATION IN DYNAMIC AND DISTRIBUTED COMPUTING SYSTEMS
Aggregation in a computing system can include receiving, at a service node of the computing system, a first query specifying aggregation and translating the first query into a second query having a first canonical format and specifying the aggregation. The method can include forwarding the second query to a first subset of a plurality of endpoint nodes and translating, at each endpoint node of the first subset, the second query into a third query having a format executable by a data source connected to the endpoint node. The third query can specify a level of the aggregation to be performed by the data source determined based upon a processing capability of the data source. The endpoint nodes can initiate execution of the third query by the data sources and provide an aggregated result including a result from the data source(s) to the service node.
AGGREGATION IN DYNAMIC AND DISTRIBUTED COMPUTING SYSTEMS
Aggregation in a computing system can include receiving, at a service node of the computing system, a first query specifying aggregation and translating the first query into a second query having a first canonical format and specifying the aggregation. The method can include forwarding the second query to a first subset of a plurality of endpoint nodes and translating, at each endpoint node of the first subset, the second query into a third query having a format executable by a data source connected to the endpoint node. The third query can specify a level of the aggregation to be performed by the data source determined based upon a processing capability of the data source. The endpoint nodes can initiate execution of the third query by the data sources and provide an aggregated result including a result from the data source(s) to the service node.
SYSTEM AND METHOD FOR AN ULTRA HIGHLY AVAILABLE, HIGH PERFORMANCE, PERSISTENT MEMORY OPTIMIZED, SCALE-OUT DATABASE
A shared-nothing database system is provided in which parallelism and workload balancing are increased by assigning the rows of each table to “slices”, and storing multiple copies (“duplicas”) of each slice across the persistent storage of multiple nodes of the shared-nothing database system. When the data for a table is distributed among the nodes of a shared-nothing system in this manner, requests to read data from a particular row of the table may be handled by any node that stores a duplica of the slice to which the row is assigned. For each slice, a single duplica of the slice is designated as the “primary duplica”. All DML operations (e.g. inserts, deletes, updates, etc.) that target a particular row of the table are performed by the node that has the primary duplica of the slice to which the particular row is assigned. The changes made by the DML operations are then propagated from the primary duplica to the other duplicas (“secondary duplicas”) of the same slice.