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

1. 发明授权

US09626398B2 Tree data structure 有权
公开(公告)号：US09626398B2
公开(公告)日：2017-04-18
申请号：US13477789
申请日：2012-05-22
申请人： Goetz Graefe , Harumi Kuno , Hideaki Kimura
发明人： Goetz Graefe , Harumi Kuno , Hideaki Kimura
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.

2. 发明授权

US09396227B2 Controlled lock violation for data transactions 有权
标题翻译：数据交易受到锁定违规
公开(公告)号：US09396227B2
公开(公告)日：2016-07-19
申请号：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.
摘要翻译：提出了一种用于为数据交易提供受控锁定冲突的系统，方法和非暂时性计算机可读介质。该系统包括用于执行第一数据事务和第二数据事务的处理器，第一和第二数据事务在多个数据资源上运行。控制的锁定违规模块向第二个事务授予对具有锁定的第一事务锁定的数据资源的冲突锁定，当第一个事务保持其锁定时，冲突锁被授予第二个事务。受控锁定违规模块可以应用于两阶段提交和罐头交易中的分布式事务。

3. 发明申请

US20120254199A1 MERGE OPTIMIZATION SYSTEM 审中-公开
标题翻译：合并优化系统
公开(公告)号：US20120254199A1
公开(公告)日：2012-10-04
申请号：US13077460
申请日：2011-03-31
申请人： Harumi Kuno , Goetz Graefe
发明人： Harumi Kuno , Goetz Graefe
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.
摘要翻译：合并优化系统，用于优化运行合并进程，包括数据源中的密钥。系统可以包括运行生成模块，以按预定顺序生成密钥的运行。系统还可以包括密钥表征模块，用于表征在运行生成时间的运行中的密钥的分布，以及由计算机系统执行的运行合并模块，以基于表征选择性地关联运行。

4. 发明申请

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

5. 发明申请

US20100198809A1 DATABASE SYSTEM TESTING USING ROBUSTNESS MAPS 审中-公开
标题翻译：使用稳健性的数据库系统测试
公开(公告)号：US20100198809A1
公开(公告)日：2010-08-05
申请号：US12364170
申请日：2009-02-02
申请人： Goetz Graefe , Harumi Kuno , Janet L. Wiener
发明人： Goetz Graefe , Harumi Kuno , Janet L. Wiener
IPC分类号： G06F17/30
CPC分类号： G06F16/24549
摘要： Computer-implemented systems and associated operating methods take measurements and landmarks associated with robustness maps and perform tests evaluating the robustness of a database engine's operator implementations and/or query components. The illustrative computer-implemented system comprises logic that receives one or more robustness maps of measured database system performance acquired during database execution in a predetermined range of runtime conditions and uses information from the robustness map or maps to perform regression testing wherein landmarks in the robustness maps are operated upon as a robustness bugs describing conditions under which a predetermined implementation of a database operator or query component degrades in a manner different from a predetermined expected manner.
摘要翻译：计算机实现的系统和相关的操作方法进行与鲁棒性映射关联的测量和界标，并执行评估数据库引擎的操作员实现和/或查询组件的鲁棒性的测试。示例性计算机实现的系统包括逻辑，其接收在预定运行时间条件范围内在数据库执行期间获取的测量数据库系统性能的一个或多个鲁棒性映射，并使用来自鲁棒性映射或映射的信息来执行回归测试，其中鲁棒性映射中的地标被操作为描述以预定方式不同的方式降低数据库操作者或查询组件的预定实现的条件的鲁棒性错误。

6. 发明授权

US08738657B2 Distribution of key values 有权
标题翻译：关键价值的分配
公开(公告)号：US08738657B2
公开(公告)日：2014-05-27
申请号：US13246715
申请日：2011-09-27
申请人： Harumi Kuno , Goetz Graefe , Wojciech Golab
发明人： Harumi Kuno , Goetz Graefe , Wojciech Golab
IPC分类号： G06F17/30
CPC分类号： G06F17/30584
摘要： A computer apparatus and related method to reduce database congestion is provided. In one aspect, the computer apparatus and method may generate a new partition within a hierarchical data structure of interlinked nodes, if a distribution of key values stored in the hierarchical data structure is skewed in favor of a range of key values.
摘要翻译：提供了一种减少数据库拥塞的计算机装置和相关方法。一方面，如果分层数据结构中存储的密钥值的分布有利于一系列关键值，则计算机设备和方法可以在互连节点的分层数据结构内生成新分区。

7. 发明申请

US20130318126A1 TREE DATA STRUCTURE 有权
标题翻译：树数据结构
公开(公告)号：US20130318126A1
公开(公告)日：2013-11-28
申请号：US13477789
申请日：2012-05-22
申请人： Goetz Graefe , Harumi Kuno , Hideaki Kimura
发明人： Goetz Graefe , Harumi Kuno , Hideaki Kimura
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.
摘要翻译：实现树数据结构的方法包括在第一节点和第二节点之间创建父和子关系，其中第一节点和第二节点处于树数据结构的相同层级，并且仅维护一个传入指针对于树数据结构中的每个节点始终是。一种树数据结构，其中树数据结构中的每个节点具有单个输入指针，并且其中树数据结构包括从与本地溢出节点相同层级的节点指向本地溢出节点的指针。

8. 发明申请

US20100198808A1 DATABASE SYSTEM IMPLEMENTATION PRIORITIZATION USING ROBUSTNESS MAPS 审中-公开
标题翻译：数据库系统实现优化使用鲁棒性MAPS
公开(公告)号：US20100198808A1
公开(公告)日：2010-08-05
申请号：US12364137
申请日：2009-02-02
申请人： Goetz Graefe , Harumi Kuno , Janet L. Wiener
发明人： Goetz Graefe , Harumi Kuno , Janet L. Wiener
IPC分类号： G06F17/30
CPC分类号： G06F16/24549
摘要： Computer-implemented systems and associated operating methods take measurements and landmarks associated with robustness maps and perform tests evaluating the robustness of a database engine's operator implementations and/or query components. The illustrative computer-implemented system comprises logic that receives one or more robustness maps of measured database system performance acquired during database execution in a predetermined range of runtime conditions and uses information from the robustness map or maps to prioritize potential changes that improve robustness of a database system implementation wherein landmarks in the robustness map or maps are operated upon as a robustness bug describing conditions under which a predetermined implementation of a database operator or query component degrades in a manner different from a predetermined expected manner.
摘要翻译：计算机实现的系统和相关的操作方法进行与鲁棒性映射关联的测量和界标，并执行评估数据库引擎的操作员实现和/或查询组件的鲁棒性的测试。说明性计算机实现的系统包括逻辑，其接收在预定运行时间条件范围内在数据库执行期间获取的测量数据库系统性能的一个或多个鲁棒性映射，并使用来自鲁棒性映射或映射的信息来优先化改善数据库鲁棒性的潜在变化系统实现，其中鲁棒性映射或映射中的地标被操作为鲁棒性错误，其描述数据库运算符或查询组件的预定实现以与预定预期方式不同的方式降级的条件。

9. 发明授权

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.

10. 发明授权

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

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式