Patent ID: 8627202
Filing Date: 2014-01-07
Classification: G06F

Abstract:
1. A computer-implemented method for updating and serialization of a document, comprising: assigning a unique ID to each node created in the document according to a global integer counter for each node built, comprising: materializing a root node start tag of the document; materializing a start tag for a first child node, a second child node, and a third child node of the root node, wherein the first child node, the second child node, and the third child node are sibling nodes, wherein the second child node is ordered between the first child node and the third child node; determining whether a data value change to the first child node, the second child node, and the third child node is required; in response to determining that the data value change to the first child node and any sub-nodes of the first child node are not required, skipping first content of the first child node and the sub-nodes of the first child node, and creating a first reference to the first skipped content; in response to determining that the data value change to the second child node is required, creating an updated node in memory to replace the second child node and creating a second reference to the updated node; in response to determining that the data value change to the third child node any sub-nodes of the third child node are not required, skipping second content of the third child content and the sub-nodes of the third child nodes, and creating a third reference to the second skipped content; pushing the first reference, the second reference, and the third reference into a mutation map; and serializing the document using the first reference, the second reference, and the third reference in the mutation map, wherein the serialized document comprises the first skipped content obtained from the document, the updated node, and the second skipped content obtained from the document.