利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

5 条记录 (耗时 0.021 秒)

    Streaming XPath algorithm for XPath value index key generation
    1.
    发明申请
    Streaming XPath algorithm for XPath value index key generation 失效
    用于XPath值索引密钥生成的流XPath算法

    公开(公告)号：US20060106758A1

    公开(公告)日：2006-05-18

    申请号：US10990834

    申请日：2004-11-16

    申请人： Yao-Ching Chen ,  Irene Liu ,  Demai Ni ,  Guogen Zhang ,  Qinghua Zou

    发明人： Yao-Ching Chen ,  Irene Liu ,  Demai Ni ,  Guogen Zhang ,  Qinghua Zou

    IPC分类号： G06F17/00

    CPC分类号： G06F17/30595 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99936

    摘要： A method generates hierarchical path index keys for single and multiple indexes with one scan of a document. Each data node of the document is scanned and matches to query nodes are identified. A data node matches a query node if the three conditions hold: if it is not the root step, there is a match for the query node in the previous step of the query; the data node matches the query node of the current step; and the edges of the data and query nodes match. A sub-tree of a data node can be skipped if the data node is not matched and its level is less than the fixed levels of the query. The matched data node is then placed in the match stacks corresponding to the match query nodes. The method uses transitivity properties among matching units to reduce the number of states that need to be tracked and to improve the evaluation of path expressions significantly.

    摘要翻译： 一种方法是通过文档的一次扫描为单索引和多索引生成分层路径索引键。 对文档的每个数据节点进行扫描，并与查询节点进行匹配。 如果三个条件成立，则数据节点与查询节点相匹配：如果不是根步骤，则查询前一步骤中的查询节点匹配; 数据节点匹配当前步骤的查询节点; 数据和查询节点的边缘匹配。 如果数据节点不匹配且其级别小于查询的固定级别，则可以跳过数据节点的子树。 然后将匹配的数据节点放置在与匹配查询节点相对应的匹配堆栈中。 该方法使用匹配单位之间的传递属性来减少需要跟踪的状态数量，并显着提高路径表达式的评估。

    Streaming XPath algorithm for XPath value index key generation
    2.
    发明授权
    Streaming XPath algorithm for XPath value index key generation 失效
    用于XPath值索引密钥生成的流XPath算法

    公开(公告)号：US07346609B2

    公开(公告)日：2008-03-18

    申请号：US10990834

    申请日：2004-11-16

    申请人： Yao-Ching Stephen Chen ,  Irene Ching-Hua Liu ,  Demai Ni ,  Guogen Zhang ,  Qinghua Zou

    发明人： Yao-Ching Stephen Chen ,  Irene Ching-Hua Liu ,  Demai Ni ,  Guogen Zhang ,  Qinghua Zou

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30595 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99936

    摘要： A method generates hierarchical path index keys for single and multiple indexes with one scan of a document. Each data node of the document is scanned and matches to query nodes are identified. A data node matches a query node if the three conditions hold: if it is not the root step, there is a match for the query node in the previous step of the query; the data node matches the query node of the current step; and the edges of the data and query nodes match. A sub-tree of a data node can be skipped if the data node is not matched and its level is less than the fixed levels of the query. The matched data node is then placed in the match stacks corresponding to the match query nodes. The method uses transitivity properties among matching units to reduce the number of states that need to be tracked and to improve the evaluation of path expressions significantly.

    摘要翻译： 一种方法是通过文档的一次扫描为单索引和多索引生成分层路径索引键。 对文档的每个数据节点进行扫描，并与查询节点进行匹配。 如果三个条件成立，则数据节点与查询节点相匹配：如果不是根步骤，则查询前一步骤中的查询节点匹配; 数据节点匹配当前步骤的查询节点; 数据和查询节点的边缘匹配。 如果数据节点不匹配且其级别小于查询的固定级别，则可以跳过数据节点的子树。 然后将匹配的数据节点放置在与匹配查询节点相对应的匹配堆栈中。 该方法使用匹配单位之间的传递属性来减少需要跟踪的状态数量，并显着提高路径表达式的评估。