Techniques for more efficient generation of XML events from XML data sources
    84.
    发明授权
    Techniques for more efficient generation of XML events from XML data sources 有权
    从XML数据源更有效地生成XML事件的技术

    公开(公告)号:US08543898B2

    公开(公告)日:2013-09-24

    申请号:US11938020

    申请日:2007-11-09

    IPC分类号: G06F17/00

    摘要: One may increase the efficiency of an XML event-generating process by reducing the number of requests to allocate or deallocate system memory. Such reduction may occur as the result of pre-allocating a memory chunk of sufficient size to contain all of the memory buffers required by a particular event-generating process. Instead of allocating new memory chunks for new memory buffers, an application may store any required buffers within the pre-allocated memory chunk. A sufficient memory size may be estimated by performing the event-generating process on a training set of XML documents. Also, an application may re-use buffers during the process or between different iterations of the process, thus avoiding the need to deallocate and reallocate memory that is essentially being used for the same purpose.

    摘要翻译: 可以通过减少分配或释放系统内存的请求数来提高XML事件生成过程的效率。 这种减少可以作为预先分配足够大小的存储器块以包含特定事件生成过程所需的所有存储器缓冲器的结果而发生。 代替为新的内存缓冲区分配新的内存块,应用程序可以在预先分配的内存块内存储任何所需的缓冲区。 可以通过对XML文档的训练集执行事件生成过程来估计足够的存储器大小。 此外,应用程序可能会在进程期间或在进程的不同迭代之间重新使用缓冲区,从而避免需要重新分配和重新分配基本上用于相同目的的内存。

    Isolation for applications working on shared XML data
    85.
    发明授权
    Isolation for applications working on shared XML data 有权
    用于共享XML数据的应用程序的隔离

    公开(公告)号:US08510292B2

    公开(公告)日:2013-08-13

    申请号:US11442106

    申请日:2006-05-25

    IPC分类号: G06F7/00 G06F17/30

    摘要: A mechanism is provided for detecting and disregarding application specific nodes contained in shared XML documents. The techniques described involve determining one or more application specific nodes within XML documents and performing path expression evaluations of the XML documents as if the nodes are not present. In one embodiment, a mechanism is provided by which a user may specify the criterion that determines which subset of nodes in XML documents are to be ignored from path expression evaluations. A query that specifies a path operation based on a path is evaluated ignoring said identified nodes when evaluating said path operation.

    摘要翻译: 提供了一种用于检测和忽略包含在共享XML文档中的应用程序特定节点的机制。 所描述的技术涉及确定XML文档内的一个或多个应用特定节点,并且如同节点不存在一样执行XML文档的路径表达式评估。 在一个实施例中,提供了一种机制,用户可以通过该机制指定确定XML文档中的节点的哪个子集将被从路径表达式评估中被忽略的标准。 在评估所述路径操作时,忽略指定基于路径的路径操作的查询,忽略所述标识的节点。

    Fast extraction of scalar values from binary encoded XML
    86.
    发明授权
    Fast extraction of scalar values from binary encoded XML 有权
    从二进制编码的XML快速提取标量值

    公开(公告)号:US08429196B2

    公开(公告)日:2013-04-23

    申请号:US12134196

    申请日:2008-06-06

    IPC分类号: G06F7/00 G06F17/30

    CPC分类号: G06F17/30923

    摘要: Techniques are provided for efficiently extracting scalar values from binary-encoded XML data. Node information is stored in association with binary-encoded XML data to indicate whether one or more nodes of an XML document are simple or complex. A node is simple if the node has no child elements and no attributes. The node information of a particular node is used to determine whether a particular node, identified in a query, is simple or complex. If the particular node is simple, then the scalar value of the particular node is identified without performing any operations other than possibly converting the scalar value to a non-binary-encoded format or converting the scalar value to a value of a different data type.

    摘要翻译: 提供了从二进制编码的XML数据高效地提取标量值的技术。 节点信息与二进制编码的XML数据相关联地存储以指示XML文档的一个或多个节点是简单还是复杂的。 如果节点没有子元素而没有属性,则节点很简单。 特定节点的节点信息用于确定在查询中标识的特定节点是简单还是复杂。 如果特定节点是简单的,则特定节点的标量值被识别,而不执行除可能将标量值转换为非二进制编码格式之外的任何操作,或者将标量值转换为不同数据类型的值。

    In-place evolution of XML schemes
    87.
    发明授权
    In-place evolution of XML schemes 有权
    XML模式的就地演进

    公开(公告)号:US08219569B2

    公开(公告)日:2012-07-10

    申请号:US10648749

    申请日:2003-08-25

    IPC分类号: G06F7/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模式。 这完成了“到位”,而不复制数据库结构中的数据。

    Techniques for efficient and scalable processing of complex sets of XML schemas
    88.
    发明授权
    Techniques for efficient and scalable processing of complex sets of XML schemas 有权
    用于高效和可扩展处理复杂的XML模式集的技术

    公开(公告)号:US08209361B2

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

    申请号:US12689729

    申请日:2010-01-19

    IPC分类号: G06F17/30

    摘要: Techniques are described herein for efficient and scalable processing of complex sets of XML schemas. The techniques described herein provide for reducing duplication of schema elements in volatile memory by building an XML schema in-memory model that stores repeating schema elements in in-memory data structures that are separate from in-memory data structures that store the parent schema elements which logically include or otherwise refer to the repeating schema elements. The techniques described herein also provide for faster generation of an in-memory model of an XML schema by pre-loading, in data structures on persistent storage, of schema elements from dependent XML schemas that are referenced and/or incorporated by the XML schema. The techniques described herein also provide for efficient processing of inter-dependent XML schemas by tracking all unresolved schema elements from dependent XML schemas and freeing the portions of volatile memory, which are used to process schema elements from the dependent XML schemas, as soon as the dependent schema elements being processed are stored in data structures on persistent storage.

    摘要翻译: 这里描述了用于复杂的XML模式集合的有效和可缩放处理的技术。 本文描述的技术提供了通过构建XML模式内存中模型来减少易失性存储器中的模式元素的重复,该模式将内存模型元素存储在与存储父模式元素的内存中数据结构分开的内存中数据结构中, 逻辑上包括或以其他方式引用重复的模式元素。 本文描述的技术还提供了通过在由XML模式引用和/或并入的依赖XML模式中预先加载在持久存储器上的模式元素的数据结构中来更快地生成XML模式的内存中模型。 本文描述的技术还提供了通过从依赖的XML模式跟踪所有未解决的模式元素并释放用于从依赖的XML模式处理模式元素的易失性存储器的部分的快速处理相互依赖的XML模式,一旦 正在处理的依赖模式元素存储在持久存储器上的数据结构中。

    Estimating cardinalities of XML table constructs within queries
    89.
    发明授权
    Estimating cardinalities of XML table constructs within queries 有权
    估计查询中XML表结构的基数

    公开(公告)号:US08200679B2

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

    申请号:US12328642

    申请日:2008-12-04

    IPC分类号: G06F17/00

    CPC分类号: G06F17/30935

    摘要: Techniques are provided for estimating the cardinality of a virtual result table that is produced by executing path-based table functions within a query, such as the XMLTABLE function. Some path-based table functions apply a path expression to input from a base table of XML documents to select rows to produce the result table. Path statistics are collected for the path expressions for the base table. The path statistics are used to estimate the cardinalities of the result table. The estimated cardinality of the result table is useful for estimating costs of query execution plans that are generated for the query.

    摘要翻译: 提供了用于估计通过在查询中执行基于路径的表函数(例如XMLTABLE函数)产生的虚拟结果表的基数的技术。 一些基于路径的表函数将路径表达式应用于从XML文档的基表中输入,以选择行以生成结果表。 针对基表的路径表达式收集路径统计信息。 路径统计信息用于估计结果表的基数。 结果表的估计基数对于为查询生成的查询执行计划的估计成本很有用。

    Operationally complete hierarchical repository in a relational database
    90.
    发明授权
    Operationally complete hierarchical repository in a relational database 有权
    关系数据库中的操作完整的分层存储库

    公开(公告)号:US08161074B2

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

    申请号:US12560242

    申请日:2009-09-15

    IPC分类号: G06F17/30

    摘要: A modular repository is described, where operational features may be implemented without the need to scan every resource included in the modular repository. A modular repository includes a dedicated set of database objects containing all information needed to access the resources in the repository. For example, the database objects of a modular repository may include those user identifier mappings and ACL mappings, etc., to which metadata in the modular repository refers. A database system may also include a mechanism through which a modular repository may be mounted under a subdirectory of a common directory in the database system. The resources of a modular repository that are mounted under the common directory may be accessed through the common directory. Further, a client may query the resources of any modular repository mounted under the common directory by making the federated repository, represented by the common directory, the context of the query.

    摘要翻译: 描述了模块化存储库,其中可以实现操作特征,而不需要扫描模块化存储库中包括的每个资源。 模块化存储库包括一组专用的数据库对象,其中包含访问存储库中资源所需的所有信息。 例如,模块化存储库的数据库对象可以包括模块化存储库中的元数据引用的那些用户标识符映射和ACL映射等。 数据库系统还可以包括机构,模块化存储库可以通过该机制安装在数据库系统中的公用目录的子目录下。 安装在公共目录下的模块化存储库的资源可以通过公共目录访问。 此外,客户端可以通过使由共同目录表示的联合存储库,查询的上下文来查询安装在公用目录下的任何模块化存储库的资源。