Method, system and computer program product for object serialization and de-serialization
First Claim
Patent Images
1. A method comprising:
- receiving an object graph comprising a first plurality of objects;
serializing the object graph to generate a map tree comprising a plurality of maps, wherein each map of the plurality of maps comprises dyads of first and second elements, and wherein the dyads of the first and second elements representing primitive fields are populated as name-value pairs and the dyads of the first and second elements representing non-primitive fields are populated as name-map pairs;
causing transmission of the map tree to a disparate system; and
de-serializing the map tree to populate a second plurality of objects compatible with the disparate system, wherein de-serializing the map tree comprises preventing de-serialization of at least one particular map of the map tree in an instance a particular name associated with the at least one particular map of the map tree does not match any class available to the disparate system.
6 Assignments
0 Petitions
Accused Products
Abstract
A method, apparatus and computer program product are provided for serializing and de-serializing objects such that data may be transmitted between disparate systems otherwise having incompatible object definitions. The disparate systems may include different versions of the same system or completely different systems. Object graphs may be recursively broken down into primitive components, and the data may be reformatted as maps of primitive data chained together. The data may be transmitted to a disparate recipient system and reassembled into objects recognizable by the disparate recipient system. Various systems can then communicate with each other regardless of underlying data formats.
7 Citations
18 Claims
-
1. A method comprising:
-
receiving an object graph comprising a first plurality of objects; serializing the object graph to generate a map tree comprising a plurality of maps, wherein each map of the plurality of maps comprises dyads of first and second elements, and wherein the dyads of the first and second elements representing primitive fields are populated as name-value pairs and the dyads of the first and second elements representing non-primitive fields are populated as name-map pairs; causing transmission of the map tree to a disparate system; and de-serializing the map tree to populate a second plurality of objects compatible with the disparate system, wherein de-serializing the map tree comprises preventing de-serialization of at least one particular map of the map tree in an instance a particular name associated with the at least one particular map of the map tree does not match any class available to the disparate system. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A system comprising:
-
(a) a first apparatus comprising at least a first processor and at least one memory storing computer program code, the at least one memory and the computer program code configured to, with the at least the first processor, cause the first apparatus to at least; receive an object graph comprising a first plurality of objects; serialize the object graph to generate a map tree comprising a plurality of maps, wherein each map of the plurality of maps comprises dyads of first and second elements, and wherein the dyads of the first and second elements representing primitive fields are populated as name-value pairs and the dyads of the first and second elements representing non-primitive fields are populated as name-map pairs; and cause transmission of the map tree to a second apparatus; and (b) the second apparatus, wherein the second apparatus is configured by at least a second processor to cause the second apparatus to at least; de-serialize the map tree to populate a second plurality of objects compatible with the second apparatus, wherein de-serializing the map tree comprises preventing de-serialization of at least one particular map of the map tree in an instance a particular name associated with the at least one particular map of the map tree does not match any class available to the disparate system. - View Dependent Claims (8, 9, 10, 11, 12)
-
-
13. A computer program product comprising at least one non-transitory computer-readable storage medium having computer-executable program code instructions stored therein, the computer-executable program code instructions comprising program code instructions to:
-
receive an object graph comprising a first plurality of objects; serialize the object graph to generate a map tree comprising a plurality of maps, wherein each map of the plurality of maps comprises dyads of first and second elements, and wherein the dyads of the first and second elements representing primitive fields are populated as name-value pairs and the dyads of the first and second elements representing non-primitive fields are populated as name-map pairs; cause transmission of the map tree to a disparate system; and de-serialize the map tree to populate a second plurality of objects compatible with the disparate system, wherein de-serializing the map tree comprises preventing de-serialization of at least one particular map of the map tree in an instance a particular name associated with the at least one particular map of the map tree does not match any class available to the disparate system. - View Dependent Claims (14, 15, 16, 17, 18)
-
Specification