首页> 外国专利> 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

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

机译:通过确定规则的谓词是否匹配集合中的给定节点并响应于该匹配应用函数来对树进行数据转换

摘要

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.
机译:转换过程确定规则的谓词是否与包含一组节点的树状结构数据的给定节点匹配,并且当规则的谓词与给定节点匹配时,将标识的规则的功能应用于该节点以生成复合词结果和临时突变的输出文档,并在复合结果包含下一个节点时,确定是否将下一个节点与下一个规则的谓词进行比较。变换过程包括:使用临时变异的输出文档作为输入,确定下一个节点由下一个规则处理,以及确定规则的谓词是否与一组节点中的下一个节点匹配。当规则的谓词与下一个节点匹配时,将已标识规则的功能应用于下一个节点,以生成复合结果和临时变异的输出文档。当复合结果不包含下一个节点时,将生成最终的突变输出文档。

著录项

  • 公开/公告号US10062030B2

    专利类型

  • 公开/公告日2018-08-28

    原文格式PDF

  • 申请/专利权人 INTERNATIONAL BUSINESS MACHINES CORPORATION;

    申请/专利号US201715858813

  • 发明设计人 BRYAN J. KYLE;

    申请日2017-12-29

  • 分类号G06N5/02;G06F17/22;

  • 国家 US

  • 入库时间 2022-08-21 13:03:08

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号