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

    公开(公告)号:US20050228768A1

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

    申请号:US10944171

    申请日:2004-09-16

    IPC分类号: G06F9/44 G06F17/21 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)传递给另一个要运行的节点的结果。 直到没有节点保持执行才发生。

    Techniques for increasing efficiency while servicing requests for database services
    83.
    发明授权
    Techniques for increasing efficiency while servicing requests for database services 有权
    在提供服务数据库服务请求时提高效率的技术

    公开(公告)号:US06950822B1

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

    申请号:US10304478

    申请日:2002-11-25

    IPC分类号: H04L29/08 G06R17/30

    摘要: Techniques for servicing requests for database services include maintaining at a database server an available set of one or more database session data structures. Each database session data structure holds information to support one session of one or more requests for database services over a communication connection that persists for one or more communications from one client. A database session data structure in the available set is not associated with any client currently connected to the database server. These techniques allow a database server to more efficiently service more numerous requests for database services, such as generated by communications using a stateless protocol like HTTP.

    摘要翻译: 用于处理对数据库服务的请求的技术包括在数据库服务器处维护一个或多个数据库会话数据结构的可用集合。 每个数据库会话数据结构保存信息,以通过持续来自一个客户端的一个或多个通信的通信连接来支持对数据库服务的一个或多个请求的一个会话。 可用集合中的数据库会话数据结构与当前连接到数据库服务器的任何客户端都不相关联。 这些技术允许数据库服务器更有效地服务更多的数据库服务请求,例如使用无状态协议(如HTTP)的通信生成的服务。

    Method and mechanism for efficient access to nodes in XML data
    84.
    发明申请
    Method and mechanism for efficient access to nodes in XML data 审中-公开
    有效访问XML数据中的节点的方法和机制

    公开(公告)号:US20050055629A1

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

    申请号:US10656097

    申请日:2003-09-05

    IPC分类号: G06F17/00 G06F17/30

    CPC分类号: G06F16/84

    摘要: Disclosed is a method and mechanism for accessing XML data. In one approach, in the case of a schema based document, the structure of the XML document is known apriori and this information can be exploited to store and retrieve the data more efficiently. A Named Access interface or procedure can be defined and associated with elements of the schema. The need for datatype conversions can be eliminated by allowing direct mapping to the intended datatype or the closest matching datatype in the system to which the invention is directed. The storage information can be exploited to provide “direct” access to data based on offset in lieu of a linear traversal. Another aspect is that only the relevant portions need to be even loaded into memory.

    摘要翻译: 公开了一种访问XML数据的方法和机制。 在一种方法中,在基于模式的文档的情况下,XML文档的结构是已知的,并且可以利用该信息来更有效地存储和检索数据。 命名访问接口或过程可以定义并与模式的元素相关联。 可以通过直接映射到本发明所针对的系统中的预期数据类型或最接近的匹配数据类型来消除对数据类型转换的需要。 可以利用存储信息来提供基于偏移代替线性遍历的“直接”访问数据。 另一方面是只有相关部分需要被均匀地加载到存储器中。

    Direct loading of semistructured data
    86.
    发明授权
    Direct loading of semistructured data 有权
    直接加载半结构化数据

    公开(公告)号:US07814047B2

    公开(公告)日:2010-10-12

    申请号:US10648600

    申请日:2003-08-25

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30917

    摘要: Techniques and systems are disclosed for directly storing semistructured data in a database. According to one aspect, a client application reads data that comprises instances of a parent type. The client application invokes routines associated with the parent type. An array is created for storing instances of the parent type. These routines invoke routines associated with a child type of the parent type. An array is created for storing instances of the child type. The arrays are populated with values specified in the data. According to one aspect, some columns of the arrays may be populated with other values to be stored in hidden columns of database tables. The client application converts the arrays into a data stream that conforms to the format of the database's data blocks. The client application then streams the data to a database server, which writes the data blocks directly into one or more data blocks in the database.

    摘要翻译: 公开了用于将半结构化数据直接存储在数据库中的技术和系统。 根据一个方面,客户端应用读取包含父类型的实例的数据。 客户端应用程序调用与父类型相关联的例程。 创建一个数组来存储父类型的实例。 这些例程调用与父类型的子类型相关联的例程。 创建一个数组来存储子类型的实例。 数组用数据中指定的值填充。 根据一个方面,阵列的一些列可以用其他值填充以存储在数据库表的隐藏列中。 客户端应用程序将阵列转换为符合数据库数据块格式的数据流。 然后,客户端应用程序将数据流传输到数据库服务器,数据库服务器将数据块直接写入数据库中的一个或多个数据块。

    Handling uniqueness constraints in a database system with versioned data
    87.
    发明申请
    Handling uniqueness constraints in a database system with versioned data 有权
    在具有版本化数据的数据库系统中处理唯一性约束

    公开(公告)号:US20070043783A1

    公开(公告)日:2007-02-22

    申请号:US11295310

    申请日:2005-12-05

    IPC分类号: G06F17/30

    摘要: A version history of each of a plurality of resources is stored in a table. The version history for each resource comprises a set of one or more values for the resource, wherein each value in the version history of a resource indicates the value that the resource had in a particular version of the resource. In response to a request to perform an operation that causes a given resource that is subject to a uniqueness constraint to have a particular value, it is determined whether the uniqueness constraint is violated based on whether any version of any resource other than the given resource has the particular value. The uniqueness constraint is determined to be violated if any version of any resource other than the given resource has the particular value. The uniqueness constraint is not violated by existence of a version of the given resource that has the particular value.

    摘要翻译: 多个资源中的每一个的版本历史被存储在表中。 每个资源的版本历史包括用于资源的一个或多个值的集合,其中资源的版本历史中的每个值指示资源在资源的特定版本中具有的值。 响应于执行导致受到唯一性约束的给定资源具有特定值的操作的请求,基于是否具有给定资源的任何资源的任何版本的任何版本是否被确定是否违反唯一性约束 具体的价值。 如果给定资源以外的任何资源的任何版本具有特定值,则唯一性约束被确定为违反。 唯一性约束不被存在具有特定值的给定资源的版本所抵触。

    In-place evolution of XML schemas
    88.
    发明申请
    In-place evolution of XML schemas 有权
    XML模式的就地演进

    公开(公告)号:US20050050105A1

    公开(公告)日:2005-03-03

    申请号:US10648749

    申请日:2003-08-25

    IPC分类号: G06F12/00 G06F17/30

    CPC分类号: G06F17/30297 G06F17/30908

    摘要: A method and system for the in-place evolution of XML schemas is disclosed. To automatically evolve an existing XML schema, a schema evolver receives both an existing XML schema and an XML document as input. The XML document indicates changes to be made to the existing XML schema. Based on the existing XML schema and the XML document, the schema evolver evolves the existing XML schema into a new XML schema that incorporates the changes indicated in the XML document. According to one aspect, the schema evolver generates one or more SQL statements based on the new XML schema. The SQL statements, when executed by a database server, cause the database server to evolve database structures that were based on the formerly existing XML schema so that the database structures conform to the new XML schema. This is accomplished “in place,” without copying the data in the database structures.

    摘要翻译: 公开了一种用于XML模式的就地演化的方法和系统。 为了自动演进现有的XML模式,模式演进器接收现有的XML模式和XML文档作为输入。 XML文档指示对现有XML模式进行的更改。 基于现有的XML架构和XML文档,架构演进者将现有的XML架构演变为新的XML架构,其中包含XML文档中指示的更改。 根据一个方面,模式演进者基于新的XML模式生成一个或多个SQL语句。 SQL语句在由数据库服务器执行时,会导致数据库服务器发展基于以前存在的XML模式的数据库结构,以便数据库结构符合新的XML模式。 这完成了“到位”,而不复制数据库结构中的数据。

    Efficient loading of data into a relational database
    89.
    发明申请
    Efficient loading of data into a relational database 有权
    将数据高效加载到关系数据库中

    公开(公告)号:US20050050074A1

    公开(公告)日:2005-03-03

    申请号:US10718823

    申请日:2003-11-21

    IPC分类号: G06F17/00

    摘要: Described is a method and system for storing data into a database, where a determination is made if schema metadata that is used to load the data into the database already exists, and where the existing schema metadata is used to load the data into the database if the schema metadata already exists. If the appropriate schema metadata does not exist, then it is generated and cached so that a later load operation for the same schema type will not need to re-generate this information. In this way, the cost to generate the schema metadata is amortized over multiple load operations to load data of the same schema type. The approach is protocol neutral so that multiple different protocol-based loads can operate with the same schema metadata information and load structures.

    摘要翻译: 描述了一种用于将数据存储到数据库中的方法和系统,其中确定用于将数据加载到数据库中的模式元数据是否已经存在,并且使用现有模式元数据将数据加载到数据库中,如果 模式元数据已经存在。 如果相应的模式元数据不存在,那么它将被生成和缓存,以便相同模式类型的后续加载操作将不需要重新生成此信息。 以这种方式,生成架构元数据的成本将通过多个加载操作进行分摊,以加载相同模式类型的数据。 该方法是协议中性的,以便多个不同的基于协议的负载可以使用相同的模式元数据信息和负载结构进行操作。

    Efficient mechanism for managing hierarchical relationships in a relational database system

    公开(公告)号:US10089361B2

    公开(公告)日:2018-10-02

    申请号:US11932423

    申请日:2007-10-31

    IPC分类号: G06F7/00 G06F17/30

    摘要: A method and apparatus for managing hierarchical relationships in a relational database system is provided. An “orderkey” data type, which is native within a relational database system, is disclosed. The orderkey type is designed to contain values that represent the position of an entity relative to the positions of other entities within a hierarchy. Such values represent hierarchical relationships between those entities. Values that are of the orderkey type have properties that allow hierarchy-oriented functions to be performed in an especially efficient manner. Database functions, which operate on and/or produce values that are of the orderkey type, are also disclosed. Such functions can be placed within SQL statements that a database server executes, for example. In response to executing SQL statements that contain such functions, the database server performs hierarchy-oriented operations in a highly efficient manner.