Adp, Inc.

Kuntal Roy

Michael Hirawady

Lohit J Sarma

Jason F Melo

Meir Rosner

Shia Kaufman

Lucky Ratanlal Jain

Dennis Peter Mohan

Lauren Miller

Robert Stephen Tucker

Siobhan Loughman Sabino

John Benlin Lee

Kevin A Miller

Ruchi Jinendra Jain

Xinpeng Liao

Meng-Yi Hsu

Annelise Levitt

Michael F Brown

Edgardo Aviles Lopez

Osman Ozdemir

Adrian Michael Garza

Predicting cacheable queries is provided. For example, a system integrates one or more processors with a cache store to execute one or more microservices. The system receives a first request including an identifier and a set of key-value pairs. The system predicts a set of requests based on the identifier and the set of key-value pairs. The system identifies based on a comparison with a threshold metric, a subset of predicted requests from the set of requests indicative of one or more subsequent requests. The system constructs a set of labels. The system retrieves, via the set of labels and from a data repository remote from the client service, data for the subset of predicted requests. The system transmits a cache value from the cache store that corresponds to the subsequent request.

Prediction of cacheable queries

A system and method of performing a cross-datasource query to provide a cross-datasource query result. A composite shape comprises a composite shape query and a plurality of shape identifiers identifying a plurality of shapes. Each of the plurality of shapes comprises a datasource identifier identifying a datasource and a shape query defining a query to be performed on the datasource. The composite shape is used to perform the composite shape query across the datasources identified in the plurality of shapes to provide the cross-datasource query result.

Cross-datasource querying using composite shapes

A computer-implemented method of improving data access in an organization by a computer. The computer receives a command from an individual to perform an action on a data element to the organization. Responsive to receiving the command, the computer reads an authorization object assigned to the data element. Responsive to reading the authorization object, the computer creates list of individuals authorized to perform the action on the data element in accordance with the authorization object. Responsive to creating the list, the computer permits the action on the data element only if the individual is on the list.

Information access in a graph database

A system and method for communicating events between applications. A first application receives event information for an event. A first action is performed by the first application in response to receiving the event information. The first application generates an event message comprising an event name and a message payload. The message payload comprises at least a portion of the event information. The first application publishes the event message by sending the event message to an event message pipeline. A second application may listen for the event message in the event message pipeline, receive the event message from the event message pipeline, and use the message payload to perform a second action, wherein the second action is different from the first action.

Event communication between applications

Improving data retrieval by a computer, the data stored exclusively in the computer as a structure comprising a plurality of nodes connected by edges, wherein the edges indicate relationships among the plurality of nodes, and wherein the structure further comprise properties which store information that relate to the plurality of nodes. Metadata is stored as part of the structure, the metadata defining rules for updating the relationships among the plurality of nodes. A command is received to update at least one of the nodes, the edges, or the properties. The at least one of the nodes, the edges, or the properties, are updated according to the rules defined by the metadata.

Dynamic data relationships in a graph database

A computer-implemented method of enabling distributed computers to communicate more effectively in an enterprise that provides flexible approval notifications in an organization, wherein at least one of the distributed computers stores a graph database in which attributes regarding individuals of the organization are stored. The computer-implemented method includes receiving, at a server computer in the distributed computers, a request for a task to be performed, wherein the task requires approval by at least a first person in the organization who has authority to approve the request. The computer-implemented method also includes traversing, by the server computer, the graph database, to determine an identity of the first person, wherein traversing is performed based on criteria determined at least partially by information automatically extracted from the request. The computer-implemented method also includes transmitting, automatically by the server computer, the request to a client computer to which the first person has access.

Methods and devices for enabling distributed computers to communicate more effectively in an enterprise requiring flexible approval notifications

Growing community of inventors

North Brunswick, NJ, United States of America

Kuntal Roy