Abstract: Techniques for obtaining a support package status associated with a software component executing on a computing system include receiving a transport request that comprises metadata associated with a software component, and a support package start point that defines an updated support package status of the software component for receiving an updated support package for the software component; in response to receiving the transport request, creating a correction transport that comprises the support package start point and metadata associated with the updated support package; distributing the correction transport to a computing system; in response to distributing the correction transport, identifying a current support package status of the software component; comparing the current support package status of the software component with the updated support package status of the support package start point; and based on the comparison, updating the support package status of the software component.

Abstract: Systems and processes may access data in various graph structures. An interface for a business application to access data stored in a memory may be provided. The interface may retrieve the data independent of whether the graph structure of the data is an anonymous graph or an identified graph. The interface may utilize a generic graph structure to access data without identifying the graph structure of the data. For example, software may be operable to accessing a first graph structure using a first graph service, where the first graph structure comprises an anonymous graph structure. The software can then access a second graph structure using the same first graph service, where the second structure comprising an identified graph structure.

Abstract: Systems and processes may apply a filter to data in a graph structure using an interface. The filter may be applied upon request from a business application. The interface may determine which portions of the graph structure satisfy the filter criteria. The interface may replace nodes and/or relations that do not satisfy filter criteria with skip nodes or functions. For example, software can be operable to apply a filter to a graph structure that includes nodes and relations between the nodes and evaluating the graph structure according to the filter. The software then replaces a first of the nodes that does not satisfy the filter with a first skip node.

Abstract: System and methods are described for automatically determining the responsible agent for a given task. Using a task grammar, a task constructor constructs a request description. A responsibility request, including the request description, is formulated. A rules engine queries a database and determines, given the request description, the responsible agent for the given task by matching the request description with a task description in the database and returning the responsible agent associated with the task description.