利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

37 条记录 (耗时 0.03 秒)

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

    公开(公告)号：US07603347B2

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

    申请号：US10944171

    申请日：2004-09-16

    申请人： Ashish Thusoo ,  Ravi Murthy ,  Sivasankaran Chandrasekar ,  Eric Sedlar ,  Nipun Agarwal

    发明人： Ashish Thusoo ,  Ravi Murthy ,  Sivasankaran Chandrasekar ,  Eric Sedlar ,  Nipun Agarwal

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30917 ,  G06F17/30911 ,  Y10S707/99934

    摘要： 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）传递给另一个要运行的节点的结果。 直到没有节点保持执行才发生。

    Efficient query processing of XML data using XML index
    14.
    发明授权
    Efficient query processing of XML data using XML index 有权
    使用XML索引对XML数据进行高效查询处理

    公开(公告)号：US07398265B2

    公开(公告)日：2008-07-08

    申请号：US10944170

    申请日：2004-09-16

    申请人： Ashish Thusoo ,  Ravi Murthy ,  Sivasankaran Chandrasekar ,  Nipun Agarwal ,  Eric Sedlar

    发明人： Ashish Thusoo ,  Ravi Murthy ,  Sivasankaran Chandrasekar ,  Nipun Agarwal ,  Eric Sedlar

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30914 ,  G06F17/2205 ,  G06F17/2229 ,  G06F17/2247 ,  G06F17/30911 ,  Y10S707/99932 ,  Y10S707/99935 ,  Y10S707/99945

    摘要： A method and apparatus is provided for translating queries, such as path expressions and SQL/XML constructs, into SQL statements to be executed against an XML index, which improves processor time as opposed to applying path expressions directly to the original XML documents to extract the desired information. Simple path expressions, filter expressions, descendant axes, wildcards, logical expressions, relational expressions, literals, and other path expressions are all translated into SQL for efficient querying of an XML index. Similarly, rules for translating SQL/XML constructs into SQL are provided.

    摘要翻译： 提供了一种方法和装置，用于将诸如路径表达式和SQL / XML结构之类的查询转换为针对XML索引执行的SQL语句，这样可以提高处理器时间，而不是将路径表达式直接应用于原始XML文档来提取 所需信息。 简单的路径表达式，过滤器表达式，后代轴，通配符，逻辑表达式，关系表达式，文字和其他路径表达式都被转换为SQL，以便有效地查询XML索引。 同样，提供了将SQL / XML结构转换为SQL的规则。

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

    公开(公告)号：US20050228768A1

    公开(公告)日：2005-10-13

    申请号：US10944171

    申请日：2004-09-16

    申请人： Ashish Thusoo ,  Ravi Murthy ,  Sivasankaran Chandrasekar ,  Eric Sedlar ,  Nipun Agarwal

    发明人： Ashish Thusoo ,  Ravi Murthy ,  Sivasankaran Chandrasekar ,  Eric Sedlar ,  Nipun Agarwal

    IPC分类号： G06F9/44 ,  G06F17/21 ,  G06F17/30

    CPC分类号： G06F17/30917 ,  G06F17/30911 ,  Y10S707/99934

    摘要： 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）传递给另一个要运行的节点的结果。 直到没有节点保持执行才发生。