Tree structured data transform, by determining whether a predicate of a rule matches a given node in a set and applying a function responsive to the match

Patent metadata

Field	Value
Publication number	US-10062030-B2
Application number	US-201715858813-A
Country	US
Kind code	B2
Filing date	Dec 29, 2017
Priority date	Nov 30, 2011
Publication date	Aug 28, 2018
Grant date	Aug 28, 2018

Abstract

A transformation process determines whether a predicate of a rule matches a given node of tree structured data containing a set of nodes and, when the predicate of a rule matches the given node, applies a function of an identified rule to the node to generate a compound result and an interim mutated output document, and when the compound result contains a next node, determines whether the next node is compared with the predicate of a next rule. The transform process includes determining that the next node is processed by a next rule, using the interim mutated output document as input, and determining whether a predicate of a rule matches the next node in a set of nodes. When the predicate of a rule matches the next node, a function of an identified rule is applied to the next node to generate a compound result and interim mutated output document. When the compound result does not contain a next node, a final mutated output document is generated.

First claim

What is claimed is:

1. A computer-implemented method for transformation of tree structured data containing a set of nodes, comprising:
generating, responsive to a determination that a predicate of a rule matches a given node in the set of nodes, a compound result and an interim mutated output document by applying a function of the rule to the given node;
determining, responsive to a determination that the compound result contains a next node, whether the next node is compared with a predicate of a next rule;
applying, responsive to a determination that the predicate of the next rule matches the next node, a function of an identified rule to next node to generate a second compound result and interim mutated output document; and
generating a final mutated output document using the interim mutated output document as input, wherein
the compound result includes a node to process next and an instruction indicating continue or break.

2. The computer-implemented method of claim 1 , wherein
responsive to a determination that the predicate of the rule does not match the given node whereby no match is identified while traversing a set of rules, a determination is made whether the next node exists in the tree structured data; and
responsive to the determination that the next node exists in the tree structured data, the next node in the set of nodes is selected.

3. The computer-implemented method of claim 1 , wherein
the rule contains information including the predicate and a function, and
the predicate indicates to which node the function is applicable, and
the function performs an operation by mutating the tree structured data and returning the compound result.

4. The computer-implemented method of claim 1 , wherein
responsive to a determination that the next node is not compared with the predicate of the next rule, a first rule in the set of rules is identified, and
the interim mutated output document is used as input.

5. The computer-implemented method of claim 1 , wherein
the compound result includes an instruction indicating processing by comparing a predicate of the next node with one of the next rule and a first rule in the set of rules.

6. The computer-implemented method of claim 1 , wherein
responsive to a determination that no rules in the set of rules matches a given node, the next node in document order is selected; and
the next node is processed commencing with a first rule of the set of rules.

7. A computer hardware system configured to manage a cloud computing environment adapted to host a virtual machine, comprising
a hardware processor configured to initiate the following executable operations:
generating, responsive to a determination that a predicate of a rule matches a given node in the set of nodes, a compound result and an interim mutated output document by applying a function of the rule to the given node;
determining, responsive to a determination that the compound result contains a next node, whether the next node is compared with a predicate of a next rule;
applying, responsive to a determination that the predicate of the next rule matches the next node, a function of an identified rule to next node to generate a second compound result and interim mutated output document; and
generating a final mutated output document using the interim mutated output document as input, wherein

the compound result includes a node to process next and an instruction indicating continue or break.

8. The system of claim 7 , wherein
responsive to a determination that the predicate of the rule does not match the given node whereby no match is identified while traversing a set of rules, a determination is made whether the next node exists in the tree structured data; and
responsive to the determination that the next node exists in the tree structured data, the next node in the set of nodes is selected.

9. The system of claim 7 , wherein
the rule contains information including the predicate and a function, and
the predicate indicates to which node the function is applicable, and
the function performs an operation by mutating the tree structured data and returning the compound result.

10. The system of claim 7 , wherein
responsive to a determination that the next node is not compared with the predicate of the next rule, a first rule in the set of rules is identified, and
the interim mutated output document is used as input.

11. The system of claim 7 , wherein
the compound result includes an instruction indicating processing by comparing a predicate of the next node with one of the next rule and a first rule in the set of rules.

12. The system of claim 7 , wherein
responsive to a determination that no rules in the set of rules matches a given node, the next node in document order is selected; and
the next node is processed commencing with a first rule of the set of rules.

13. A computer program product, comprising:
a hardware storage device having program code stored thereon for managing a cloud computing environment adapted to host a virtual machine,
generating, responsive to a determination that a predicate of a rule matches a given node in the set of nodes, a compound result and an interim mutated output document by applying a function of the rule to the given node;
determining, responsive to a determination that the compound result contains a next node, whether the next node is compared with a predicate of a next rule;
applying, responsive to a determination that the predicate of the next rule matches the next node, a function of an identified rule to next node to generate a second compound result and interim mutated output document; and
generating a final mutated output document using the interim mutated output document as input, wherein

the compound result includes a node to process next and an instruction indicating continue or break.

14. The computer program product of claim 13 , wherein
responsive to a determination that the predicate of the rule does not match the given node whereby no match is identified while traversing a set of rules, a determination is made whether the next node exists in the tree structured data; and
responsive to the determination that the next node exists in the tree structured data, the next node in the set of nodes is selected.

15. The computer program product of claim 13 , wherein
the rule contains information including the predicate and a function, and
the predicate indicates to which node the function is applicable, and
the function performs an operation by mutating the tree structured data and returning the compound result.

16. The computer program product of claim 13 , wherein
responsive to a determination that the next node is not compared with the predicate of the next rule, a first rule in the set of rules is identified, and
the interim mutated output document is used as input.

17. The computer program product of claim 13 , wherein
the compound result includes an instruction indicating processing by comparing a predicate of the next node with one of the next rule and a first rule in the set of rules.

18. The computer program product of claim 13 , wherein
responsive to a determination that no rules in the set of rules matches a given node, the next node in document order is selected; and
the next node is processed commencing with a first rule of the set of rules.

Assignees

• IBM

Inventors

• Kyle Bryan J

Classifications

• G06N5/02 Primary

  Knowledge representation; Symbolic representation · CPC title

• G06F40/154

  Tree transformation for tree-structured or markup documents, e.g. XSLT, XSL-FO or stylesheets · CPC title

• G06F40/14

  Tree-structured documents (parsing G06F40/205; validation G06F40/226) · CPC title

• G06F17/2247

  Physics · mapped topic

• G06F17/227

  Physics · mapped topic