公开(公告)号：US20080120300A1

公开(公告)日：2008-05-22

申请号：US11820556

申请日：2007-06-20

申请人： David Detlefs ,  John Joseph Duffy ,  Goetz Graefe ,  Vinod K. Grover ,  Michael M. Magruder ,  Lingli Zhang

发明人： David Detlefs ,  John Joseph Duffy ,  Goetz Graefe ,  Vinod K. Grover ,  Michael M. Magruder ,  Lingli Zhang

IPC分类号： G06F17/30

CPC分类号： G06F9/3842

摘要： Various technologies and techniques are disclosed for handling exceptions in sequential statements that are executed in parallel. A transactional memory system is provided with a contention manager. The contention manager is responsible for managing exceptions that occur within statements that were designed to be executed in an original sequential order, and that were transformed into ordered transactions for speculative execution in parallel. The contention manager ensures that any exceptions that are thrown from one or more speculatively executed blocks while the statements are being executed speculatively in parallel are handled in the original sequential order.

摘要翻译： 公开了用于处理并行执行的顺序语句中的异常的各种技术和技术。 交易内存系统与竞争管理器一起提供。 竞争管理器负责管理在原始顺序中被设计为执行的语句中发生的异常，并且被并行转换为有序事务以进行投机执行。 争用管理器确保在以并行方式推测性地执行语句时从一个或多个推测执行的块抛出的任何异常以原始顺序的顺序进行处理。

公开(公告)号：US06356887B1

公开(公告)日：2002-03-12

申请号：US09340596

申请日：1999-06-28

申请人： Harold R. Berenson ,  Peter A. Carlin ,  Nigel R. Ellis ,  Cesar A. Galindo-Legaria ,  Goetz Graefe ,  Ajay Kalhan ,  Craig C. Peeper ,  Samuel H. Smith

发明人： Harold R. Berenson ,  Peter A. Carlin ,  Nigel R. Ellis ,  Cesar A. Galindo-Legaria ,  Goetz Graefe ,  Ajay Kalhan ,  Craig C. Peeper ,  Samuel H. Smith

IPC分类号： G06F1730

CPC分类号： G06F17/30433 ,  Y10S707/99932 ,  Y10S707/99934

摘要： An auto-parameterization process transforms a database query into a parameterized basic query form by replacing any constant values in the query with parameters. The auto-parameterization process attempts to generate a safe execution plan from the basic query form if there is currently no such plan available. A safe execution plan is defined as an execution plan that is optimal over a range of values for the parameters. If a safe execution plan can be generated, it is passed for execution, along with the constant values that were present in the query. If a safe execution plan cannot be generated, the auto-parameterization process passes a specific execution plan for execution. The safe execution plan is cached either at the time it is created or at the time it is executed. The cache is searched each time a parameterized basic query plan is generated by the auto-parameterization process. The auto-parameterization process also evaluates the query before creating the corresponding parameterized basic query form to determine if it is likely that a safe execution plan can be generated for the query.

摘要翻译： 自动参数化过程通过用参数替换查询中的任何常量值，将数据库查询转换为参数化的基本查询表单。 如果当前没有此类计划可用，则自动参数化过程将尝试从基本查询表单生成安全执行计划。 一个安全的执行计划被定义为在参数值范围内最佳的执行计划。 如果可以生成安全的执行计划，则将其传递给执行，以及查询中存在的常量值。 如果无法生成安全执行计划，则自动参数化过程将通过特定的执行计划执行。 安全执行计划在创建时或执行时缓存。 每次通过自动参数化过程生成参数化的基本查询计划时，将搜索缓存。 在创建相应的参数化基本查询表单之前，自动参数化过程还会对查询进行评估，以确定是否可能为查询生成安全的执行计划。

公开(公告)号：US06298342B1

公开(公告)日：2001-10-02

申请号：US09039728

申请日：1998-03-16

申请人： Goetz Graefe ,  Jeff Alger

发明人： Goetz Graefe ,  Jeff Alger

IPC分类号： G06F1730

CPC分类号： G06F17/30595 ,  Y10S707/99934 ,  Y10S707/99937 ,  Y10S707/99942

摘要： A “pivot” operation rotates the data items in a relational database table so that certain data values in the table become column names of the pivoted table, and the data items of a specified value column appear in corresponding rows in the new columns of the pivoted table. A pivot list specifies that only certain values of the pivot column data items participate in the operation. Additional columns of the input table appear as columns in the output table; the rows of the output table are grouped by equal data-item values in these grouping columns. An “unpivot” operation provides the inverse of the pivot operation. Both operations may be nested in an SQL user query at the algebraic level. The operations occur in the search engine of a relational database management system, and may also be invoked as part of an optimization of another query.

摘要翻译： “枢轴”操作旋转关系数据库表中的数据项，使表中的某些数据值变为枢轴表的列名，并且指定值列的数据项将显示在枢轴的新列中的相应行中 表。 枢轴列表指定只有枢轴列数据项的某些值参与操作。 输入表的其他列在输出表中显示为列; 在这些分组列中，输出表的行按照相等的数据项进行分组。 “unpivot”操作提供了枢轴操作的倒数。 这两个操作都可以嵌套在代数级的SQL用户查询中。 操作发生在关系数据库管理系统的搜索引擎中，也可以作为另一查询优化的一部分进行调用。

公开(公告)号：US6105024A

公开(公告)日：2000-08-15

申请号：US22575

申请日：1998-02-12

申请人： Goetz Graefe ,  Per-Ake Larson

发明人： Goetz Graefe ,  Per-Ake Larson

IPC分类号： G06F7/36 ,  G06F17/00

CPC分类号： G06F7/36 ,  G06F2207/224 ,  Y10S707/99937 ,  Y10S707/99938 ,  Y10S707/99942

摘要： The memory management system is operational in a database system and functions to gracefully transition data from the allocated memory space to run files on disk only as needed. The memory management system accommodates variable length input records in the workspace of a database sort operation, requires no extra copying of records in memory, and maintains memory utilization at a high level. This memory management system therefore minimizes the amount of data written to disk during run formation and enables the use of the replacement selection algorithm even with variable length input records, which improves performance of sorting and overall operational efficiency of the database system.

摘要翻译： 内存管理系统在数据库系统中可操作，并且可以根据需要正常地将数据从分配的内存空间过渡到仅在磁盘上运行文件。 存储器管理系统在数据库排序操作的工作空间中容纳可变长度的输入记录，不需要在存储器中记录的额外复制，并将存储器利用率保持在较高水平。 因此，这种内存管理系统可最大限度地减少在运行形成期间写入磁盘的数据量，并且即使使用可变长度的输入记录也能够使用替换选择算法，从而提高数据库系统的排序性能和整体运行效率。

公开(公告)号：US09836504B2

公开(公告)日：2017-12-05

申请号：US12495628

申请日：2009-06-30

申请人： Goetz Graefe ,  Harumi Kuno

发明人： Goetz Graefe ,  Harumi Kuno

IPC分类号： G06F17/30

CPC分类号： G06F17/30463

摘要： A data processing system performs query progress estimation based on processed value packets. In the illustrative data processing system, a database query processor comprises a query optimizer that creates a query plan, and a database plan executor that executes the query plan and observes intermediate result streams processed as the query plan is executed. A value packet manager anticipates value packets during query optimization, creates value packets as the intermediate result streams are processed, and compares anticipated value packets with created value packets to determine accuracy of the anticipated value packets and estimate query progress.

公开(公告)号：US09009428B2

公开(公告)日：2015-04-14

申请号：US13179261

申请日：2011-07-08

申请人： Goetz Graefe ,  Harumi Kuno

发明人： Goetz Graefe ,  Harumi Kuno

IPC分类号： G06F12/00 ,  G06F11/14

CPC分类号： G06F11/1469 ,  G06F11/1471

摘要： In one implementation, a data store page recovery process includes selecting a page reference and an update record reference at a page recovery mapping based on a page identifier, accessing a backup page via the page reference, accessing an update record via the update record reference, and modifying the backup page according to the update record. The page reference is associated with the update record reference at the page recovery mapping.

摘要翻译： 在一个实现中，数据存储页面恢复过程包括：基于页面标识符，在页面恢复映射中选择页面引用和更新记录引用，经由页面引用访问备份页面，经由更新记录引用访问更新记录， 并根据更新记录修改备份页面。 页面引用与页面恢复映射中的更新记录引用相关联。

公开(公告)号：US08892612B2

公开(公告)日：2014-11-18

申请号：US13075570

申请日：2011-03-30

申请人： Goetz Graefe ,  Harumi Kuno

发明人： Goetz Graefe ,  Harumi Kuno

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.

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

公开(公告)号：US20140040220A1

公开(公告)日：2014-02-06

申请号：US13563633

申请日：2012-07-31

申请人： Hideaki KIMURA ,  Goetz Graefe ,  Harumi Kuno

发明人： Hideaki KIMURA ,  Goetz Graefe ,  Harumi Kuno

IPC分类号： G06F17/30

CPC分类号： G06F16/1774 ,  G06F16/2308

摘要： In at least some examples, a system may include a processor core and a non-transitory computer-readable memory in communication with the processor core. The non-transitory computer-readable memory may store deadlock detection engine to determine a deadlock condition, wherein the deadlock detection engine accounts for a set of database lock modes.

摘要翻译： 在至少一些示例中，系统可以包括与处理器核心通信的处理器核心和非暂时性计算机可读存储器。 非暂时性计算机可读存储器可以存储死锁检测引擎以确定死锁状况，其中死锁检测引擎考虑一组数据库锁定模式。

公开(公告)号：US08402016B2

公开(公告)日：2013-03-19

申请号：US12473065

申请日：2009-05-27

申请人： Dimitrios Tsirogiannis ,  Stavros Harizopoulos ,  Mehul A. Shah ,  Janet L. Wiener ,  Goetz Graefe

发明人： Dimitrios Tsirogiannis ,  Stavros Harizopoulos ,  Mehul A. Shah ,  Janet L. Wiener ,  Goetz Graefe

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30498

摘要： A method of performing a multi-way join of a plurality of database relations includes executing a plurality of pipelined two-way joins with the database relations. Each two-way join has two sequential phases. In the first phase, missing attributes of the input relations that are required to evaluate a joining criterion specific to said two-way join are fetched from a non-volatile memory device, and the input relations are joined according to the criterion. In the second phase, any additional missing attributes of the input relations are fetched from the non-volatile memory device as assigned by an optimization process executed prior to commencing the multi-way join.

摘要翻译： 执行多个数据库关系的多路连接的方法包括执行具有数据库关系的多个流水线的双向连接。 每个双向连接都有两个连续的阶段。 在第一阶段，从非易失性存储器件取出评估特定于所述双向连接的连接标准所需的输入关系的缺失属性，并且根据该标准连接输入关系。 在第二阶段中，通过在开始多路连接之前执行的优化处理所指定的非易失性存储器设备，从输入关系的任何附加的缺失属性获取。

公开(公告)号：US20130013824A1

公开(公告)日：2013-01-10

申请号：US13179188

申请日：2011-07-08

申请人： Goetz Graefe

发明人： Goetz Graefe

IPC分类号： G06F5/14

CPC分类号： G06F17/3048

摘要： A parallel aggregation system includes a data analysis module to determine a unique key value of a record to be forwarded to a destination. A pre-processing module may determine existence of the record in a buffer and priority of the record in a priority queue. Based on the existence and priority, the pre-processing module may absorb the record in the buffer and selectively forward another record in the buffer to the destination.

摘要翻译： 并行聚合系统包括数据分析模块，用于确定要转发到目的地的记录的唯一密钥值。 预处理模块可以确定缓冲器中的记录的存在和优先级队列中记录的优先级。 基于存在和优先级，预处理模块可以吸收缓冲器中的记录，并选择性地将缓冲器中的另一记录转发到目的地。