US 12,481,632 B1
Payload size reduction and reassembly of recursively parsable structures
Arno Schneuwly, Effretikon (CH); Felix Schmidt, Baden-Dattwil (CH); Saeid Allahdadian, Vancover (CA); and Matteo Casserini, Zurich (CH)
Assigned to Oracle International Corporation, Redwood Shores, CA (US)
Filed by Oracle International Corporation, Redwood Shores, CA (US)
Filed on May 22, 2024, as Appl. No. 18/671,192.
Int. Cl. G06F 16/22 (2019.01); G06F 16/81 (2019.01)
CPC G06F 16/2246 (2019.01) [G06F 16/81 (2019.01)] 25 Claims
OG exemplary drawing
 
1. A method comprising:
generating a plurality of parse trees that include a first parse tree that represents a first message and a second parse tree that represents a second message, wherein:
the plurality of parse trees comprises a sequence of tree levels and a plurality of tree nodes,
each tree node of the plurality of tree nodes is contained in exactly one parse tree of the plurality of parse trees,
each tree node of the plurality of tree nodes that is a leaf node contains a value, and
each tree node of the plurality of tree nodes that is not a leaf node contains a key;
generating a merged tree by performing without processing the plurality of tree nodes that are leaf nodes:
first merging, into a first merged node in a first tree level, a tree node of the plurality of tree nodes in the first tree level that contains a first key, and
second merging, into a second merged node in a second tree level, a tree node of the plurality of tree nodes in the second tree level that contains a second key, wherein said performing has at least one capability selected from a group consisting of:
the first tree level and the second tree level can be identical, and
the first key and the second key can be identical;
parsing a new message into a new parse tree that consists of a new plurality of tree nodes; and
compressing, based on the new parse tree and the merged tree, the new message into a compressed message.