Cost-based optimizer for an XML data repository within a database
    2.
    发明授权
    Cost-based optimizer for an XML data repository within a database 有权
    数据库中XML数据存储库的基于成本的优化器

    公开(公告)号:US07930277B2

    公开(公告)日:2011-04-19

    申请号:US10830211

    申请日:2004-04-21

    IPC分类号: G06F7/00 G06F17/00

    CPC分类号: G06F17/30935

    摘要: Cost-based optimizer functionality for an XML database repository provides means for optimizing the execution of database queries that access XML resources in the database repository. Statistics about XML resources that are stored in the database repository are gathered, stored and utilized by a query optimizer to compute computational costs associated with each of multiple methods of accessing particular XML resources requested in a database query. Hence, the optimizer is able to select the most efficient query execution plan based on the costs of possible access paths. In one embodiment, specific statistics about the hierarchical structure of XML resources stored in the XML database repository are gathered, stored in a relational table in the database management system, and used to compute the selectivity of query predicates and the index cost associated with traversing one or more indexes to access requested XML resources.

    摘要翻译: 用于XML数据库的基于成本的优化器功能提供了优化访问数据库存储库中的XML资源的数据库查询的执行的方法。 存储在数据库存储库中的关于XML资源的统计信息由查询优化器收集,存储和使用,以计算与访问数据库查询中请求的特定XML资源的多种方法中的每一种相关联的计算成本。 因此,优化器能够基于可能的访问路径的成本来选择最有效的查询执行计划。 在一个实施例中,收集存储在XML数据库存储库中的XML资源的层次结构的具体统计信息,存储在数据库管理系统中的关系表中,并用于计算查询谓词的选择性和与遍历一个相关联的索引成本 或更多的索引来访问所请求的XML资源。

    Techniques for managing hierarchical data with link attributes in a relational database
    3.
    发明授权
    Techniques for managing hierarchical data with link attributes in a relational database 有权
    用于使用关系数据库中的链接属性来管理分层数据的技术

    公开(公告)号:US06965903B1

    公开(公告)日:2005-11-15

    申请号:US10306485

    申请日:2002-11-26

    IPC分类号: G06F17/30

    摘要: Techniques for managing hierarchical data include managing a link table in a relational database. The hierarchical data includes data about a hierarchy of nodes related by multiple links. The link table includes first information, second information and link information, for each link. First information indicates a first node in the hierarchical data. Second information indicates a second node that is associated with the first node by the link. Link information indicates values for link attributes of the link between the first node and the second node, and does not indicate a value for any attribute of the first node alone or any attribute of the second node alone. The techniques support directing a single SQL statement to a path database object, constructed based on the link table, in order to obtain paths that satisfy a search on link attributes.

    摘要翻译: 用于管理分级数据的技术包括管理关系数据库中的链接表。 层次数据包括关于多个链路相关节点的层次结构的数据。 链路表包括每个链路的第一信息,第二信息和链路信息。 第一信息表示层次数据中的第一节点。 第二信息指示通过链路与第一节点相关联的第二节点。 链接信息指示第一节点和第二节点之间的链接的链接属性的值,并且不指示单独的第一节点的任何属性或仅第二节点的任何属性的值。 这些技术支持将单个SQL语句定向到基于链接表构建的路径数据库对象,以便获得满足链接属性搜索的路径。

    Cost-based optimizer for an XML data repository within a database
    4.
    发明申请
    Cost-based optimizer for an XML data repository within a database 有权
    数据库中XML数据存储库的基于成本的优化器

    公开(公告)号:US20050240624A1

    公开(公告)日:2005-10-27

    申请号:US10830211

    申请日:2004-04-21

    IPC分类号: G06F17/00 G06F17/30

    CPC分类号: G06F17/30935

    摘要: Cost-based optimizer functionality for an XML database repository provides means for optimizing the execution of database queries that access XML resources in the database repository. Statistics about XML resources that are stored in the database repository are gathered, stored and utilized by a query optimizer to compute computational costs associated with each of multiple methods of accessing particular XML resources requested in a database query. Hence, the optimizer is able to select the most efficient query execution plan based on the costs of possible access paths. In one embodiment, specific statistics about the hierarchical structure of XML resources stored in the XML database repository are gathered, stored in a relational table in the database management system, and used to compute the selectivity of query predicates and the index cost associated with traversing one or more indexes to access requested XML resources.

    摘要翻译: 用于XML数据库的基于成本的优化器功能提供了优化访问数据库存储库中的XML资源的数据库查询的执行的方法。 存储在数据库存储库中的关于XML资源的统计信息由查询优化器收集,存储和利用,以计算与访问数据库查询中请求的特定XML资源的多种方法中的每一种相关联的计算成本。 因此,优化器能够基于可能的访问路径的成本来选择最有效的查询执行计划。 在一个实施例中,收集存储在XML数据库存储库中的XML资源的层次结构的具体统计信息,存储在数据库管理系统中的关系表中,并用于计算查询谓词的选择性和与遍历一个相关联的索引成本 或更多的索引来访问所请求的XML资源。

    Flexible storage of XML collections within an object-relational database
    5.
    发明授权
    Flexible storage of XML collections within an object-relational database 有权
    将XML集合灵活存储在对象关系数据库中

    公开(公告)号:US09367642B2

    公开(公告)日:2016-06-14

    申请号:US11246039

    申请日:2005-10-07

    IPC分类号: G06F17/30 G06F7/00

    CPC分类号: G06F17/30923 G06F7/00

    摘要: A database server determines, on an element-level of granularity, what form of VARRAY storage to map collections of elements defined by a XML schema. A collection element may be mapped to an in-line VARRAY or an out-of-line VARRAY. The determination may based on a variety of factors, including the database type mapped to the collection element, database limitations that limit the form storage for certain database types, and annotations (“mapping annotations”) embedded within that XML schema that specifying a database type for database representation of a collection element or a form of VARRAY storage.

    摘要翻译: 数据库服务器根据粒度级别确定使用什么形式的VARRAY存储来映射由XML模式定义的元素集合。 集合元素可以被映射到串联的VARRAY或者行外的VARRAY。 确定可以基于各种因素,包括映射到集合元素的数据库类型,限制某些数据库类型的表单存储的数据库限制,以及嵌入在指定数据库类型的XML模式中的注释(“映射注释”) 用于收集元素或VARRAY存储的形式的数据库表示。

    Mechanism for efficiently evaluating operator trees
    6.
    发明授权
    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)传递给另一个要运行的节点的结果。 直到没有节点保持执行才发生。