专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

41. 发明申请

US20050097100A1 System and method for segmented evaluation of database queries 失效
标题翻译：数据库查询分段评估的系统和方法
公开(公告)号：US20050097100A1
公开(公告)日：2005-05-05
申请号：US10998761
申请日：2004-11-29
申请人： Cesar Galindo-Legaria , Goetz Graefe , Milind Joshi , Ross Bunker
发明人： Cesar Galindo-Legaria , Goetz Graefe , Milind Joshi , Ross Bunker
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30501 , G06F17/3046 , G06F17/30466 , G06F17/30498 , Y10S707/99933 , Y10S707/99943
摘要： A method of satsfying a database query includes evaluating certain joins on a per-segment basis. An expression tree is produced for the query, and the expression tree is evaluated to identify joins whose operands are two instances of the same relation and whose join predicate conjunctively includes an equality comparison between two instances of the same column. When such a join is identified, it may be evaluated by segmenting the operand relation according to the columns that are compared for equality in the predicate. The join is then evaluated by performing the join operation separately on each segment. Segments may be spooled separately, thereby exploiting the efficiencies obtained by spooling even where the entire relation is too large to fit in the spool. Execution iterators are provided for spooling successive segments and for applying the join to the spooled segment.
摘要翻译：饱和数据库查询的方法包括基于每个段来评估某些联接。为查询生成表达式树，并且对表达式树进行评估，以标识其操作数是相同关系的两个实例的连接，并且其连接谓词连接地包含同一列的两个实例之间的等效比较。当识别出这样的连接时，可以通过根据在谓词中的相等性进行比较的列分割操作数关系来评估操作数关系。然后通过在每个段上分别执行连接操作来评估连接。分段可以单独地卷绕，从而利用即使在整个关系太大而不能装入卷轴的情况下通过卷绕获得的效率。提供执行迭代器用于假脱机连续的段并将连接应用到假脱机段。

42. 发明授权

US06748392B1 System and method for segmented evaluation of database queries 失效
标题翻译：数据库查询分段评估的系统和方法
公开(公告)号：US06748392B1
公开(公告)日：2004-06-08
申请号：US09800379
申请日：2001-03-06
申请人： Cesar A. Galindo-Legaria , Goetz Graefe , Milind M. Joshi , Ross T. Bunker
发明人： Cesar A. Galindo-Legaria , Goetz Graefe , Milind M. Joshi , Ross T. Bunker
IPC分类号： G06F1730
CPC分类号： G06F17/30501 , G06F17/3046 , G06F17/30466 , G06F17/30498 , Y10S707/99933 , Y10S707/99943
摘要： A method of satisfying a database query includes evaluating certain joins on a per-segment basis. An expression tree is produced for the query, and the expression tree is evaluated to identify joins whose operands are two instances of the same relation and whose join predicate conjunctively includes an equality comparison between two instances of the same column. When such a join is identified, it may be evaluated by segmenting the operand relation according to the columns that are compared for equality in the predicate. The join is then evaluated by performing the join operation separately on each segment. Segments may be spooled separately, thereby exploiting the efficiencies obtained by spooling even where the entire relation is too large to fit in the spool. Execution iterators are provided for spooling successive segments and for applying the join to the spooled segment.
摘要翻译：满足数据库查询的方法包括基于每个段来评估某些联接。为查询生成表达式树，并且对表达式树进行评估，以标识其操作数是相同关系的两个实例的连接，并且其连接谓词连接地包含同一列的两个实例之间的等效比较。当识别出这样的连接时，可以通过根据在谓词中的相等性进行比较的列分割操作数关系来评估操作数关系。然后通过在每个段上分别执行连接操作来评估连接。分段可以单独地卷绕，从而利用即使在整个关系太大而不能装入卷轴的情况下通过卷绕获得的效率。提供执行迭代器用于假脱机连续的段并将连接应用到假脱机段。

43. 发明授权

US06598044B1 Method for choosing optimal query execution plan for multiple defined equivalent query expressions 有权
标题翻译：为多个定义的等效查询表达式选择最优查询执行计划的方法
公开(公告)号：US06598044B1
公开(公告)日：2003-07-22
申请号：US10183190
申请日：2002-06-25
申请人： Florian Waas , Cesar Galindo-Legaria , Goetz Graefe
发明人： Florian Waas , Cesar Galindo-Legaria , Goetz Graefe
IPC分类号： G06F1730
CPC分类号： G06F17/30463 , Y10S707/99933
摘要： A query formulates choices of multiple equivalent forms. A choice is represented by a CHOOSE operator having multiple arguments representing the equivalent forms. A lookup table is generated to include a group for each node other than CHOOSE arguments. For CHOOSE arguments, the generated table includes a single equivalence group having all choose arguments as members. The enumeration algorithm of the optimizer is applied to generate additional members and/or groups, whereby for each group, every member thereof is an equivalent. A cost value is assigned to each member of each group and a member of each group is selected as a lowest cost value member. The lowest cost value members of the groups define an optimized tree and optimization of the query.
摘要翻译：查询制定了多个等效形式的选择。选择由具有表示等效形式的多个参数的CHOOSE运算符表示。生成查找表以包括除CHOOSE参数之外的每个节点的组。对于CHOOSE参数，生成的表包括一个具有所有选择参数作为成员的等价组。应用优化器的枚举算法来生成附加成员和/或组，由此对于每个组，其每个成员是等效的。成本值分配给每个组的每个成员，并且每个组的成员被选择为最低成本值成员。组的最低成本值成员定义优化树和查询的优化。

44. 发明授权

US09836504B2 Query progress estimation based on processed value packets 有权
公开(公告)号：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.

45. 发明授权

US09009428B2 Data store page recovery 有权
标题翻译：数据存储页面恢复
公开(公告)号：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.
摘要翻译：在一个实现中，数据存储页面恢复过程包括：基于页面标识符，在页面恢复映射中选择页面引用和更新记录引用，经由页面引用访问备份页面，经由更新记录引用访问更新记录，并根据更新记录修改备份页面。页面引用与页面恢复映射中的更新记录引用相关联。

46. 发明授权

US08892612B2 Exploitation of correlation between original and desired data sequences during run generation 有权
标题翻译：在运行生成期间利用原始数据序列和期望数据序列之间的相关性
公开(公告)号：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.
摘要翻译：一种在运行生成期间利用原始数据序列与期望数据序列之间的相关性的计算机执行方法包括：利用处理器，将来自数据源的多个数据值添加到第一存储器设备，所述第一存储器设备定义工作空间，确定数据工作空间中的值应当以多个运行的升序或降序输出，并以确定的顺序将多个数据值作为运行写入第二个存储器件。

47. 发明申请

US20140040220A1 METHODS AND SYSTEMS FOR DEADLOCK DETECTION 审中-公开
标题翻译：用于死锁检测的方法和系统
公开(公告)号：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.
摘要翻译：在至少一些示例中，系统可以包括与处理器核心通信的处理器核心和非暂时性计算机可读存储器。非暂时性计算机可读存储器可以存储死锁检测引擎以确定死锁状况，其中死锁检测引擎考虑一组数据库锁定模式。

48. 发明申请

US20130262423A1 CONTROLLED LOCK VIOLATION FOR DATA TRANSACTIONS 有权
标题翻译：数据交易的控制锁定
公开(公告)号：US20130262423A1
公开(公告)日：2013-10-03
申请号：US13434744
申请日：2012-03-29
申请人： Goetz GRAEFE , Harumi Kuno
发明人： Goetz GRAEFE , Harumi Kuno
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.
摘要翻译：提出了一种用于为数据交易提供受控锁定冲突的系统，方法和非暂时性计算机可读介质。该系统包括用于执行第一数据事务和第二数据事务的处理器，第一和第二数据事务在多个数据资源上运行。控制的锁定违规模块向第二个事务授予对具有锁定的第一事务锁定的数据资源的冲突锁定，当第一个事务保持其锁定时，冲突锁被授予第二个事务。受控锁定违规模块可以应用于两阶段提交和罐头交易中的分布式事务。

49. 发明授权

US08402016B2 Fetching optimization in multi-way pipelined database joins 有权
标题翻译：在多路流水线数据库联接中获取优化
公开(公告)号：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.
摘要翻译：执行多个数据库关系的多路连接的方法包括执行具有数据库关系的多个流水线的双向连接。每个双向连接都有两个连续的阶段。在第一阶段，从非易失性存储器件取出评估特定于所述双向连接的连接标准所需的输入关系的缺失属性，并且根据该标准连接输入关系。在第二阶段中，通过在开始多路连接之前执行的优化处理所指定的非易失性存储器设备，从输入关系的任何附加的缺失属性获取。

50. 发明申请

US20130013824A1 PARALLEL AGGREGATION SYSTEM 有权
标题翻译：并行聚合系统
公开(公告)号：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.
摘要翻译：并行聚合系统包括数据分析模块，用于确定要转发到目的地的记录的唯一密钥值。预处理模块可以确定缓冲器中的记录的存在和优先级队列中记录的优先级。基于存在和优先级，预处理模块可以吸收缓冲器中的记录，并选择性地将缓冲器中的另一记录转发到目的地。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式