Transforming query results into hierarchical information
    1.
    发明授权
    Transforming query results into hierarchical information 有权
    将查询结果转换为层次信息

    公开(公告)号:US07444321B2

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

    申请号:US10765348

    申请日:2004-01-27

    IPC分类号: G06F17/30

    摘要: A computerized system and method for transforming the results of a query into a hierarchical information stream, such as an eXtensible Markup Language (XML) data stream is disclosed. A database server receives a query and generates a rowset. A rowset processor, using the mode specified in the query, processes the rowset and query to generate the XML data stream. For the “auto1” mode, the rowset processor transforms a rowset into an XML data stream using primary-foreign key information specified in the query to determine nesting. For the “auto2” mode, the rowset processor transforms a rowset into an XML data stream using table ordering information included in the query to determine nesting. For the “explicit” mode, the rowset processor transforms a rowset into an XML data stream using the explicit organizational information specified in the query.

    摘要翻译: 公开了一种用于将查询的结果转换成诸如可扩展标记语言(XML)数据流之类的层级信息流的计算机化系统和方法。 数据库服务器接收查询并生成行集。 行集处理器使用查询中指定的模式,处理行集和查询以生成XML数据流。 对于“auto1”模式,行集处理器使用查询中指定的主外键信息将行集转换为XML数据流,以确定嵌套。 对于“auto2”模式,行集处理器使用查询中包含的表排序信息将行集转换为XML数据流,以确定嵌套。 对于“显式”模式,行集处理器使用查询中指定的显式组织信息将行集转换为XML数据流。

    Transforming query results into heirarchical information
    2.
    发明申请
    Transforming query results into heirarchical information 有权
    将查询结果转换为历史信息

    公开(公告)号:US20050004896A1

    公开(公告)日:2005-01-06

    申请号:US10765348

    申请日:2004-01-27

    IPC分类号: G06F15/00 G06F17/30

    摘要: A computerized system and method for transforming the results of a query into a hierarchical information stream, such as an eXtensible Markup Language (XML) data stream is disclosed. A database server receives a query and generates a rowset. A rowset processor, using the mode specified in the query, processes the rowset and query to generate the XML data stream. For the “auto 1” mode, the rowset processor transforms a rowset into an XML data stream using primary-foreign key information specified in the query to determine nesting. For the “auto2” mode, the rowset processor transforms a rowset into an XML data stream using table ordering information included in the query to determine nesting. For the “explicit” mode, the rowset processor transforms a rowset into an XML data stream using the explicit organizational information specified in the query.

    摘要翻译: 公开了一种用于将查询的结果转换成诸如可扩展标记语言(XML)数据流之类的层级信息流的计算机化系统和方法。 数据库服务器接收查询并生成行集。 行集处理器使用查询中指定的模式,处理行集和查询以生成XML数据流。 对于“自动1”模式,行集处理器使用查询中指定的主外键信息将行集转换为XML数据流,以确定嵌套。 对于“auto2”模式,行集处理器使用查询中包含的表排序信息将行集转换为XML数据流,以确定嵌套。 对于“显式”模式,行集处理器使用查询中指定的显式组织信息将行集转换为XML数据流。

    Transforming query results into hierarchical information
    3.
    发明授权
    Transforming query results into hierarchical information 有权
    将查询结果转换为层次信息

    公开(公告)号:US06708164B1

    公开(公告)日:2004-03-16

    申请号:US09528078

    申请日:2000-03-17

    IPC分类号: G06F1730

    摘要: A computerized system and method for transforming the results of a query into a hierarchical information stream, such as an extensible Markup Language (XML) data stream is disclosed. A database server receives a query and generates a rowset. A rowset processor, using the mode specified in the query, processes the rowset and query to generate the XML data stream. For the “auto1” mode, the rowset processor transforms a rowset into an XML data stream using primary-foreign key information specified in the query to determine nesting. For the “auto2” mode, the rowset processor transforms a rowset into an XML data stream using table ordering information included in the query to determine nesting. For the “explicit” mode, the rowset processor transforms a rowset into an XML data stream using the explicit organizational information specified in the query.

    摘要翻译: 公开了一种用于将查询的结果转换成诸如可扩展标记语言(XML)数据流之类的分级信息流的计算机化系统和方法。 数据库服务器接收查询并生成行集。 行集处理器使用查询中指定的模式,处理行集和查询以生成XML数据流。 对于“auto1”模式,行集处理器使用查询中指定的主外键信息将行集转换为XML数据流,以确定嵌套。 对于“auto2”模式,行集处理器使用查询中包含的表排序信息将行集转换为XML数据流,以确定嵌套。 对于“显式”模式,行集处理器使用查询中指定的显式组织信息将行集转换为XML数据流。

    Tree data structure
    5.
    发明授权

    公开(公告)号:US09626398B2

    公开(公告)日:2017-04-18

    申请号:US13477789

    申请日:2012-05-22

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30327

    摘要: A method of implementing a tree data structure comprises creating a parent and child relationship between a first node and a second node, in which the first node and second node are at the same hierarchical level of the tree data structure, and maintaining only one incoming pointer for each of the nodes in the tree data structure at all times. A tree data structure in which each node in the tree data structure has a single incoming pointer, and in which the tree data structure comprises a pointer directed to a local overflow node from a node at the same hierarchical level as the local overflow node.

    Controlled lock violation for data transactions
    6.
    发明授权
    Controlled lock violation for data transactions 有权
    数据交易受到锁定违规

    公开(公告)号:US09396227B2

    公开(公告)日:2016-07-19

    申请号:US13434744

    申请日:2012-03-29

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30362

    摘要: A system, method, and non-transitory computer readable medium for providing controlled lock violation for data transactions are presented. The system includes a processor for executing a first data transaction and a second data transaction, the first and second data transactions operating on a plurality of data resources. A controlled lock violation module grants to the second transaction a conflicting lock to a data resource locked by the first transaction with a lock, the conflicting lock granted to the second transaction while the first transaction holds its lock. The controlled lock violation module can be applied to distributed transactions in a two-phase commit and to canned transactions.

    摘要翻译: 提出了一种用于为数据交易提供受控锁定冲突的系统,方法和非暂时性计算机可读介质。 该系统包括用于执行第一数据事务和第二数据事务的处理器,第一和第二数据事务在多个数据资源上运行。 控制的锁定违规模块向第二个事务授予对具有锁定的第一事务锁定的数据资源的冲突锁定,当第一个事务保持其锁定时,冲突锁被授予第二个事务。 受控锁定违规模块可以应用于两阶段提交和罐头交易中的分布式事务。

    Adaptive merging in database indexes
    7.
    发明授权
    Adaptive merging in database indexes 有权
    数据库索引中的自适应合并

    公开(公告)号:US09298761B2

    公开(公告)日:2016-03-29

    申请号:US12433418

    申请日:2009-04-30

    申请人: Goetz Graefe

    发明人: Goetz Graefe

    IPC分类号: G06F7/00 G06F17/30

    CPC分类号: G06F17/30327

    摘要: A method for implementing adaptive merging in database indexes includes selecting a key range from a database query having a range predicate and searching a database for data matching the key range. The data matching the key range is merged to form a collected dataset which is stored for future retrieval. A method for optimizing B-tree representation of a database using actual queries is also provided.

    摘要翻译: 一种用于在数据库索引中实现自适应合并的方法包括从具有范围谓词的数据库查询中选择密钥范围,并在数据库中搜索与密钥范围匹配的数据。 匹配关键范围的数据被合并以形成收集的数据集,存储以供将来检索。 还提供了使用实际查询优化数据库的B树表示的方法。

    DYNAMIC REORDERING OF OPERATIONS IN A QUERY PLAN
    8.
    发明申请
    DYNAMIC REORDERING OF OPERATIONS IN A QUERY PLAN 有权
    查询计划中的动作重新运行

    公开(公告)号:US20130054567A1

    公开(公告)日:2013-02-28

    申请号:US13218898

    申请日:2011-08-26

    申请人: Goetz Graefe

    发明人: Goetz Graefe

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30463

    摘要: There is provided a computer-implemented method of dynamically reordering operations in a query plan. An exemplary method comprises processing a first set of tuples according to a first operation. The query plan is pipelined and specifies that the first operation generates input for a second operation. The query plan further specifies that the second operation is executed after the first operation. The computer-implemented method further includes determining that the second operation is to precede the first operation based on a specified policy. The computer-implemented method further includes executing the second operation for a second set of tuples before executing the first operation for the second set of tuples. The second operation generates an input for the first operation. The first operation is executed after the second operation.

    摘要翻译: 提供了一种在查询计划中动态重新排序操作的计算机实现的方法。 一种示例性方法包括根据第一操作来处理第一组元组。 查询计划是流水线的,并指定第一个操作为第二个操作生成输入。 查询计划还指定在第一操作之后执行第二操作。 计算机实现的方法还包括基于指定的策略来确定第二操作在第一操作之前。 计算机实现的方法还包括在为第二组元组执行第一操作之前对第二组元组执行第二操作。 第二操作产生用于第一操作的输入。 在第二操作之后执行第一操作。

    MERGE OPTIMIZATION SYSTEM
    9.
    发明申请
    MERGE OPTIMIZATION SYSTEM 审中-公开
    合并优化系统

    公开(公告)号:US20120254199A1

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

    申请号:US13077460

    申请日:2011-03-31

    IPC分类号: G06F17/30

    CPC分类号: G06F7/32

    摘要: A merge optimization system to optimize a run merge process for runs including keys from a data source. The system may include a run generation module to generate a run of the keys in a predetermined order. The system may further include a key characterization module to characterize a distribution of the keys across the run at run generation time, and a run merge module executed by a computer system to selectively associate the runs based on the characterization.

    摘要翻译: 合并优化系统,用于优化运行合并进程,包括数据源中的密钥。 系统可以包括运行生成模块,以按预定顺序生成密钥的运行。 系统还可以包括密钥表征模块,用于表征在运行生成时间的运行中的密钥的分布,以及由计算机系统执行的运行合并模块,以基于表征选择性地关联运行。

    Exploitation of Correlation Between Original and Desired Data Sequences During Run Generation
    10.
    发明申请
    Exploitation of Correlation Between Original and Desired Data Sequences During Run Generation 有权
    运行生成期间原始和期望数据序列之间的相关性的利用

    公开(公告)号:US20120254171A1

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

    申请号:US13075570

    申请日:2011-03-30

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30 G06F7/24

    摘要: A computer executed method of exploiting correlations between original and desired data sequences during run generation comprises, with a processor, adding a number of data values from a data source to a first memory device, the first memory device defining a workspace, determining whether the data values within the workspace should be output in ascending or descending order for a number of runs, and writing a number of the data values as a run to a second memory device in the determined order.

    摘要翻译: 一种在运行生成期间利用原始数据序列与期望数据序列之间的相关性的计算机执行方法包括:利用处理器,将来自数据源的多个数据值添加到第一存储器设备,所述第一存储器设备定义工作空间,确定数据 工作空间中的值应当以多个运行的升序或降序输出,并以确定的顺序将多个数据值作为运行写入第二个存储器件。