XML sub-document versioning method in XML databases using record storages
    1.
    发明授权
    XML sub-document versioning method in XML databases using record storages 失效
    使用记录存储的XML数据库中的XML子文档版本控制方法

    公开(公告)号:US08161004B2

    公开(公告)日:2012-04-17

    申请号:US12126712

    申请日:2008-05-23

    IPC分类号: G06F17/30

    摘要: A new sub-document versioning method for record storages of XML documents which uses virtual cutting points to ensure that a search tree is able to support multiple versions of sub-documents and provide efficient mechanisms for XML updating. Record boundaries and virtual cut points divide the two-dimensional space, the horizontal axis representing node identifiers in document order and vertical axis representing version numbers, into rectangles. The bottom corner of the rectangle is used to represent the rectangles and the corresponding information of the corner is added to the search tree index.

    摘要翻译: 一种用于记录XML文档存储的新的子文档版本控制方法,它使用虚拟切割点来确保搜索树能够支持多个版本的子文档,并为XML更新提供有效的机制。 记录边界和虚拟切点将二维空间分开,横轴表示文档顺序中的节点标识符和表示版本号的垂直轴,成矩形。 矩形的底角用于表示矩形,并将角的相应信息添加到搜索树索引。

    XML SUB-DOCUMENT VERSIONING METHOD IN XML DATABASES USING RECORD STORAGES
    2.
    发明申请
    XML SUB-DOCUMENT VERSIONING METHOD IN XML DATABASES USING RECORD STORAGES 失效
    使用记录存储的XML数据库中的XML子文档版本方法

    公开(公告)号:US20080256045A1

    公开(公告)日:2008-10-16

    申请号:US12126712

    申请日:2008-05-23

    IPC分类号: G06F7/06 G06F17/30

    摘要: A new sub-document versioning method for record storages of XML documents which uses virtual cutting points to ensure that a search tree is able to support multiple versions of sub-documents and provide efficient mechanisms for XML updating. Record boundaries and virtual cut points divide the two-dimensional space, the horizontal axis representing node identifiers in document order and vertical axis representing version numbers, into rectangles. The bottom corner of the rectangle is used to represent the rectangles and the corresponding information of the corner is added to the search tree index.

    摘要翻译: 一种用于记录XML文档存储的新的子文档版本控制方法,它使用虚拟切割点来确保搜索树能够支持多个版本的子文档,并为XML更新提供有效的机制。 记录边界和虚拟切点将二维空间分开,横轴表示文档顺序中的节点标识符和表示版本号的垂直轴,成矩形。 矩形的底角用于表示矩形,并将角的相应信息添加到搜索树索引。

    XML sub-document versioning method in XML databases using record storages
    3.
    发明授权
    XML sub-document versioning method in XML databases using record storages 失效
    使用记录存储的XML数据库中的XML子文档版本控制方法

    公开(公告)号:US07529726B2

    公开(公告)日:2009-05-05

    申请号:US11161908

    申请日:2005-08-22

    IPC分类号: G06F17/30

    摘要: A new sub-document versioning method for record storages of XML documents which uses virtual cutting points to ensure that a search tree is able to support multiple versions of sub-documents and provide efficient mechanisms for XML updating. Record boundaries and virtual cut points divide the two-dimensional space, the horizontal axis representing node identifiers in document order and vertical axis representing version numbers, into rectangles. The bottom corner of the rectangle is used to represent the rectangles and the corresponding information of the corner is added to the search tree index.

    摘要翻译: 一种用于记录XML文档存储的新的子文档版本控制方法,它使用虚拟切割点来确保搜索树能够支持多个版本的子文档,并为XML更新提供有效的机制。 记录边界和虚拟切点将二维空间分开,横轴表示文档顺序中的节点标识符和表示版本号的垂直轴,成矩形。 矩形的底角用于表示矩形,并将角的相应信息添加到搜索树索引。

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

    公开(公告)号:US07346609B2

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

    申请号:US10990834

    申请日:2004-11-16

    IPC分类号: G06F17/30

    摘要: 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 expressions with predicates
    6.
    发明申请
    Streaming XPath algorithm for XPath expressions with predicates 审中-公开
    具有谓词的XPath表达式的流式XPath算法

    公开(公告)号:US20070198479A1

    公开(公告)日:2007-08-23

    申请号:US11356366

    申请日:2006-02-16

    IPC分类号: G06F17/30

    CPC分类号: G06F16/8373

    摘要: A method and system for evaluating a path query are disclosed. The path query corresponds to a query tree including a plurality of query nodes. At least one query node corresponds to at least one predicate and is at a level. The predicate(s) are evaluated for previous query node(s). The method and system include scanning data nodes of a document and determining if the data nodes match the query nodes. The method and system also include placing data related to the data node in match stacks corresponding to matched query nodes. The data for the query node(s) include attribute(s) corresponding to the predicate(s). The method and system further include propagating a matching of the at least one query node backward to a matching of the at least one previous query node.

    摘要翻译: 公开了一种用于评估路径查询的方法和系统。 路径查询对应于包括多个查询节点的查询树。 至少一个查询节点对应于至少一个谓词并处于一个级别。 对先前的查询节点评估谓词。 该方法和系统包括扫描文档的数据节点并确定数据节点是否匹配查询节点。 该方法和系统还包括将与数据节点相关的数据放置在与匹配查询节点相对应的匹配堆栈中。 查询节点的数据包括对应于谓词的属性。 所述方法和系统还包括将所述至少一个查询节点的匹配向后传播到所述至少一个先前查询节点的匹配。

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

    公开(公告)号:US20060106758A1

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

    申请号:US10990834

    申请日:2004-11-16

    IPC分类号: G06F17/00

    摘要: 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.

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

    Order-preserving encoding formats of floating-point decimal numbers for efficient value comparison
    8.
    发明申请
    Order-preserving encoding formats of floating-point decimal numbers for efficient value comparison 有权
    浮点十进制数的订单保留编码格式,用于有效的价值比较

    公开(公告)号:US20070050436A1

    公开(公告)日:2007-03-01

    申请号:US11213551

    申请日:2005-08-26

    IPC分类号: G06F7/00

    摘要: A method for conversion between a decimal floating-point number and an order-preserving format has been disclosed. The method encodes numbers in the decimal floating-point format into a format which preserves value ordering. This encoding allows for fast and direct string comparison of two values. Such an encoding provides normalized representations for decimal floating-point numbers and supports type-insensitive comparisons. Type-insensitive comparisons are often used in database management systems, where the data type is not specified for values to compare. In addition, the original decimal floating-point format can be recovered from the order-preserving format.

    摘要翻译: 已经公开了用于在十进制浮点数和订单保留格式之间进行转换的方法。 该方法将十进制浮点格式的数字编码为保留值排序的格式。 该编码允许对两个值进行快速和直接的字符串比较。 这样的编码提供十进制浮点数的归一化表示,并且支持类型不敏感的比较。 类型不敏感的比较通常用于数据库管理系统,其中数据类型未指定用于比较的值。 另外,原始的十进制浮点格式可以从订单保留格式中恢复。

    STREAMING XPATH ALGORITHM FOR XPATH EXPRESSIONS WITH PREDICATES
    9.
    发明申请
    STREAMING XPATH ALGORITHM FOR XPATH EXPRESSIONS WITH PREDICATES 审中-公开
    用XPATH表达式预测XPATH算法

    公开(公告)号:US20080222176A1

    公开(公告)日:2008-09-11

    申请号:US12122963

    申请日:2008-05-19

    IPC分类号: G06F17/30

    CPC分类号: G06F16/8373

    摘要: A method and system for evaluating a path query are disclosed. The path query corresponds to a query tree including a plurality of query nodes. At least one query node corresponds to at least one predicate and is at a level. The predicate(s) are evaluated for previous query node(s). The method and system include scanning data nodes of a document and determining if the data nodes match the query nodes. The method and system also include placing data related to the data node in match stacks corresponding to matched query nodes. The data for the query node(s) include attribute(s) corresponding to the predicate(s). The method and system further include propagating a matching of the at least one query node backward to a matching of the at least one previous query node.

    摘要翻译: 公开了一种用于评估路径查询的方法和系统。 路径查询对应于包括多个查询节点的查询树。 至少一个查询节点对应于至少一个谓词并处于一个级别。 对先前的查询节点评估谓词。 该方法和系统包括扫描文档的数据节点并确定数据节点是否匹配查询节点。 该方法和系统还包括将与数据节点相关的数据放置在与匹配查询节点相对应的匹配堆栈中。 查询节点的数据包括对应于谓词的属性。 所述方法和系统还包括将所述至少一个查询节点的匹配向后传播到所述至少一个先前查询节点的匹配。

    Extraction of rich search information from index servers via an alternative asynchronous data path
    10.
    发明授权
    Extraction of rich search information from index servers via an alternative asynchronous data path 有权
    通过备用异步数据路径从索引服务器提取丰富的搜索信息

    公开(公告)号:US08306964B2

    公开(公告)日:2012-11-06

    申请号:US12840281

    申请日:2010-07-20

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30864

    摘要: A search engine system is described herein that provides an alternative data path for collecting results provided by index servers. The alternative data path collects the results in a direct and asynchronous manner; this is in contrast to a synchronous path used to deliver search results to end users via one or more aggregator modules. An analysis system can use the alternative data path to collect a large amount of richly descriptive information regarding the performance of the search engine system, circumventing bottlenecks and other constraints that would otherwise be imposed by the synchronous data path. The analysis system can analyze the information collected from the index servers to improve the performance of the search engine system.

    摘要翻译: 本文描述的搜索引擎系统提供用于收集由索引服务器提供的结果的替代数据路径。 替代数据路径以直接和异步的方式收集结果; 这与用于通过一个或多个聚合器模块向最终用户传递搜索结果的同步路径形成对比。 分析系统可以使用替代数据路径来收集关于搜索引擎系统的性能的大量富描述性信息,以避免由同步数据路径施加的瓶颈和其他约束。 分析系统可以分析从索引服务器收集的信息,提高搜索引擎系统的性能。