Mechanism for efficiently evaluating operator trees
    4.
    发明授权
    Mechanism for efficiently evaluating operator trees 有权
    有效评估操作树的机制

    公开(公告)号:US07603347B2

    公开(公告)日:2009-10-13

    申请号:US10944171

    申请日:2004-09-16

    IPC分类号: G06F17/30

    摘要: An XPath expression is converted into a tree-based representation where each node represents an operation to be performed and the links between nodes in the tree represent the flow of data between operations. The conversion may involve creating a parse tree for the XPath expression, and then converting the parse tree into an operator tree. The operator tree is constructed in such a way that execution of the XPath expression begins at the leaf nodes of the operator tree, and the results are then passed up the tree. After each node is executed, the results are either (1) passed to a filter that filters the results with a predicate statement or (2) passed to another node to be operated upon. This occurs until no nodes remain to be executed.

    摘要翻译: XPath表达式被转换为基于树的表示,其中每个节点表示要执行的操作,并且树中的节点之间的链接表示操作之间的数据流。 转换可能涉及为XPath表达式创建解析树,然后将解析树转换为运算符树。 运算符树的构造方式是在运算符树的叶节点处开始执行XPath表达式,然后将结果传递给树。 在执行每个节点后,结果将被传递给过滤器的过滤器,该过滤器使用谓词语句或(2)传递给另一个要运行的节点的结果。 直到没有节点保持执行才发生。