Abstract: Certain aspects of the present disclosure provide techniques for enumerating relationships in an object graph using traversal context objects that are decoupled from the implementation details of an object graph and the objects stored therein. An example method generally includes receiving a request to traverse an object graph, the object graph including a plurality of objects. A root context object is generated, and a traversal context object associated with a root node of the object graph is generated. The traversal context object is linked to the root context object and added to a traversal data structure. The graph is traversed by adding and removing traversal context objects to and from the traversal data structure until a terminating event occurs.

Abstract: Certain aspects of the present disclosure provide techniques for enumerating relationships in an object graph using traversal context objects that are decoupled from the implementation details of an object graph and the objects stored therein. An example method generally includes receiving a request to traverse an object graph, the object graph including a plurality of objects. A root context object is generated, and a traversal context object associated with a root node of the object graph is generated. The traversal context object is linked to the root context object and added to a traversal data structure. The graph is traversed by adding and removing traversal context objects to and from the traversal data structure until a terminating event occurs.

Abstract: Certain aspects of the present disclosure provide techniques for enumerating relationships in an object graph using traversal context objects that are decoupled from the implementation details of an object graph and the objects stored therein. An example method generally includes receiving a request to traverse an object graph, the object graph including a plurality of objects. A root context object is generated, and a traversal context object associated with a root node of the object graph is generated. The traversal context object is linked to the root context object and added to a traversal data structure. The graph is traversed by adding and removing traversal context objects to and from the traversal data structure until a terminating event occurs.

Abstract: Techniques are disclosed to decompose a query from a client application. Embodiments include receiving a query based on a request provided by a user via a user interface. Embodiments include identifying a set of data elements requested by the query and identifying a predicate expression of a plurality of expressions in the query and a dependent expression of the plurality of expressions in the query. Embodiments include generating a first micro-service query for at least a first data element corresponding to the predicate expression and a second micro-service query for at least a second data element corresponding to the dependent expression. Embodiments include determining an order for issuing the first micro-service query and the second micro-service query based on the predicate expression and the dependent expression.

Abstract: The present disclosure relates to traversing and processing objects in an object graph. The method and system evaluate an object in the graph to identify one or more objects referenced by the first object. The second object is evaluated to determine whether it is present in a list or previously visited objects, and when it is not, the second object is added to a container of objects and the second object is added to the list of previously visited objects. The first object is processed and then the next object in the container is evaluated.

Abstract: This disclosure relates to optimizing write requests based on an object dependency graph. An example method generally includes receiving, from a client device, a write request specifying an object to be written to the data store. A gateway server determines, based on an object dependency graph associated with the specified object and identifying relationships between the specified object and one or more dependency objects, one or more dependency objects to be written to the data store. The gateway server generates a plurality of write requests for the specified object and the one or more dependency objects and generates an execution plan for the plurality of write requests based on the object dependency graph. The gateway server executes the plurality of write requests based on the execution plan.

Abstract: The present disclosure relates to processing write requests across a plurality of data sources. According to one embodiment, an example method includes determining a navigable path of nodes accessed to satisfy a write request in a graph projection of an application programming interface (API). An API service generates a plurality of subqueries, each subqueries being associated with a node in the navigable path. While traversing the navigable path to execute the write request, the API service identifies one or more nodes in the navigable path sharing an association with a data repository associated with the current node and upon which execution of a write operation associated with the current node depends. The API service coalesces a set of subqueries associated with the current node and the identified one or more nodes into a single subquery and executes the single subquery.

Abstract: Aspects of the present disclosure provide techniques for executing requests in an object schema-based application programming interface (API) based on union relationships between data objects. Embodiments include receiving an API query from a client application. The API query identifies a navigable path through a graph projection of the API and includes a plurality of nodes in the graph. One or more data objects to resolve in order to satisfy the API query are identified based on an object schema associated with each node in the query. For each respective data object of the one or more data objects, one or more services associated with properties of the respective data object are identified, and one or more subqueries are generated to the services to satisfy the properties of the respective data object. The subqueries are transmitted to the identified services for execution, and a result of the API query is returned.

Abstract: The present disclosure relates to traversing and processing objects in an object graph. The method and system evaluate an object in the graph to identify one or more objects referenced by the first object. The second object is evaluated to determine whether it is present in a list or previously visited objects, and when it is not, the second object is added to a container of objects and the second object is added to the list of previously visited objects. The first object is processed and then the next object in the container is evaluated.

Abstract: Aspects of the present disclosure provide techniques for executing requests in an object schema-based application programming interface (API) based on parent-child relationships between data objects. Embodiments include receiving an API request from a client application. The API request identifies a navigable path through a graph projection of the API and includes a plurality of nodes in the graph. In response, one or more data objects to resolve, including an ultimate parent object to be returned as a response to the query, are identified based on an object schema associated with each node in the query. A dependency graph identifying an order in which the data objects are to be resolved is generated based on parent-child relationships between the identified one or more data objects. The data objects are resolved based on the dependency graph, and the ultimate parent object is returned to the client application.

Abstract: Techniques are disclosed to decompose a query from a client application. A micro-service storing each object and property requested by the query is identified. A micro-service query is generated for each micro-service. Upon receiving a response from each micro-service query, the responses are joined into a single response and returned to the client application.

Abstract: This disclosure relates to optimizing write requests based on an object dependency graph. An example method generally includes receiving, from a client device, a write request specifying an object to be written to the data store. A gateway server determines, based on an object dependency graph associated with the specified object and identifying relationships between the specified object and one or more dependency objects, one or more dependency objects to be written to the data store. The gateway server generates a plurality of write requests for the specified object and the one or more dependency objects and generates an execution plan for the plurality of write requests based on the object dependency graph. The gateway server executes the plurality of write requests based on the execution plan.

Abstract: The present disclosure relates to traversing and processing objects in an object graph. The method and system evaluate an object in the graph to identify one or more objects referenced by the first object. The second object is evaluated to determine whether it is present in a list or previously visited objects, and when it is not, the second object is added to a container of objects and the second object is added to the list of previously visited objects. The first object is processed and then the next object in the container is evaluated.