Abstract: Implementations of the disclosure provide for unmarshalling objects from a back-end server graph database as they would be available in local memory at a client device. An apparatus is provided that comprises a memory and a processing device to inspect a graph model associated with an object comprising a plurality of node data structures. The graph model defines one or more services provided by each node of the object. Using a graph database, graph data elements are identified for at least one node data structure of the object in view of the inspected graph model. Metadata that describes the object associated with the inspected graph mode is generated. Thereupon, the metadata is provided to reconstruct using the graph data elements the one or more services associated with the object at a client device.

Abstract: Implementations of the disclosure provide for receiving, by a processing device, a request for a first data object associated with graph data elements and a metadata of a graph model, inspecting an observable data object to identify whether a copy of the first data object exists on a storage device associated with the processing device, responsive to failing to identify the copy of the first data object on the storage device, transmitting a service request to a host computer for the graph data elements, the service request comprising an identifier of the first data object, responsive to receiving the graph data elements from the host computer, retrieving, from the storage device, the metadata identified by a first reference stored in the observable data object, generating the first data object using the graph data elements and the metadata, and presenting the first data object on a display device.

Abstract: Implementations of the disclosure provide for graph modeling of applications for detection of duplicate modules. In one embodiment, an apparatus comprising: a memory to store graphs; and a processing device, operatively coupled to the memory is provided. The processing device identify a first executable code module of a plurality of executable code modules associated with an application represented by a graph data structure. The graph data structure is updated with an indicator for each of the executable code modules matching the first module. The indicator references the first executable code module. One or more corresponding modules associated with the graph data structure are selected in view of the indicator. Using the graph data structure, an amount of a computing resource to allocate for a migration of the corresponding modules of the application is determined in view of a selection criterion.

Abstract: Implementations of the disclosure provide for receiving, by a processing device, a request for a first data object associated with graph data elements and a metadata of a graph model, inspecting an observable data object to identify whether a copy of the first data object exists on a storage device associated with the processing device, responsive to failing to identify the copy of the first data object on the storage device, transmitting a service request to a host computer for the graph data elements, the service request comprising an identifier of the first data object, responsive to receiving the graph data elements from the host computer, retrieving, from the storage device, the metadata identified by a first reference stored in the observable data object, generating the first data object using the graph data elements and the metadata, and presenting the first data object on a display device.

Abstract: Implementations of the disclosure provide for graph modeling of applications for detection of duplicate modules. In one embodiment, an apparatus comprising: a memory to store graphs; and a processing device, operatively coupled to the memory is provided. The processing device identify a first executable code module of a plurality of executable code modules associated with an application represented by a graph data structure. The graph data structure is updated with an indicator for each of the executable code modules matching the first module. The indicator references the first executable code module. One or more corresponding modules associated with the graph data structure are selected in view of the indicator. Using the graph data structure, an amount of a computing resource to allocate for a migration of the corresponding modules of the application is determined in view of a selection criterion.

Abstract: Implementations of the disclosure provide for unmarshaling objects from a back-end server graph database as they would be available in local memory at a client device. An apparatus is provided that comprises a memory and a processing device to inspect a graph model associated with an object comprising a plurality of node data structures. The graph model defines one or more services provided by each node of the object. Using a graph database, graph data elements are identified for at least one node data structure of the object in view of the inspected graph model. Metadata that describes the object associated with the inspected graph mode is generated. Thereupon, the metadata is provided to reconstruct using the graph data elements the one or more services associated with the object at a client device.