公开(公告)号：US08799901B2

公开(公告)日：2014-08-05

申请号：US10850131

申请日：2004-05-20

申请人： Harumi Kuno ,  Alan Hersh Karp

发明人： Harumi Kuno ,  Alan Hersh Karp

IPC分类号： G06F9/46 ,  G06F9/44 ,  G06F15/173

CPC分类号： G06Q10/10 ,  G06Q10/06

摘要： Methods associated with a service are identified. Select ones of the methods are matched to generic methods of a conversation. A new service is established from the conversation that includes the select ones of the methods.

摘要翻译： 识别与服务相关联的方法。 选择一种方法与通用对话方法相匹配。 从包含选择方法的会话建立新的服务。

公开(公告)号：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.

摘要翻译： 提供了一种减少数据库拥塞的计算机装置和相关方法。 一方面，如果分层数据结构中存储的密钥值的分布有利于一系列关键值，则计算机设备和方法可以在互连节点的分层数据结构内生成新分区。

公开(公告)号：US08719722B2

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

申请号：US12721431

申请日：2010-03-10

申请人： Harumi Kuno ,  Umeshwar Dayal ,  William K. Wilkinson

发明人： Harumi Kuno ,  Umeshwar Dayal ,  William K. Wilkinson

IPC分类号： G06F3/00 ,  G06F7/00

CPC分类号： G06F17/30445 ,  G06F17/30463

摘要： A method of producing a representation of the progress of a process being performed on a database may be embodied in a data processing system. The method may include obtaining for each of a plurality of subprocesses included in the database process an estimated rate of using a system resource during execution of the subprocess and an estimated volume of data to be processed. The actual rate of using the first system resource and the actual volume of data processed during execution of the at least one subprocess may be determined for at least one of the plurality of subprocesses. An output signal may be generated that is representative of the estimated and actual rates and the estimated and actual volumes of data for the at least one subprocess.

摘要翻译： 可以在数据处理系统中实现产生对数据库执行的进程的进展的表示的方法。 该方法可以包括：在包含在数据库处理过程中的多个子过程中的每一个获取在子处理的执行期间使用系统资源的估计速率和估计的要处理的数据量。 可以为多个子处理中的至少一个确定使用第一系统资源的实际速率和在执行至少一个子过程期间处理的数据的实际体积。 可以生成代表估计和实际速率以及至少一个子过程的估计和实际数据量的输出信号。

公开(公告)号：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.

摘要翻译： 实现树数据结构的方法包括在第一节点和第二节点之间创建父和子关系，其中第一节点和第二节点处于树数据结构的相同层级，并且仅维护一个传入指针 对于树数据结构中的每个节点始终是。 一种树数据结构，其中树数据结构中的每个节点具有单个输入指针，并且其中树数据结构包括从与本地溢出节点相同层级的节点指向本地溢出节点的指针。

公开(公告)号：US20110016107A1

公开(公告)日：2011-01-20

申请号：US12505503

申请日：2009-07-19

申请人： Harumi Kuno ,  Murali Mallela Krishna ,  Umeshwar Dayal ,  Meichun Hsu

发明人： Harumi Kuno ,  Murali Mallela Krishna ,  Umeshwar Dayal ,  Meichun Hsu

IPC分类号： G06F17/30

CPC分类号： G06F16/24542

摘要： A database query is submitted to a first query optimizer to receive a first query plan from the first query optimizer. The first query plan is set as a current query plan. As an entry point, the current query plan is executed against the database within a given environment of the database. Where execution of the current query plan within the given environment is problematic, the execution of the current query plan is prematurely terminated, and the database query is submitted to a second query optimizer. Where a second query plan that is different than any previous query plan for the database query has been received from the second query optimizer, the second query plan is set as the current query plan, and a risk to the database in executing the current query plan is determined. Where the risk is less than a threshold, the entry point is proceeded to.

摘要翻译： 数据库查询被提交给第一个查询优化器以从第一个查询优化器接收第一个查询计划。 第一个查询计划被设置为当前查询计划。 作为入口点，在数据库的给定环境内，针对数据库执行当前查询计划。 在给定环境中执行当前查询计划有问题的情况下，当前查询计划的执行过早终止，并将数据库查询提交给第二个查询优化程序。 在从第二个查询优化器接收到与数据库查询的任何先前查询计划不同的第二个查询计划的情况下，将第二个查询计划设置为当前查询计划，并在数据库执行当前查询计划时承担风险 决心，决意，决定。 如果风险小于阈值，则进入入口点。

公开(公告)号：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.

摘要翻译： 计算机实现的系统和相关的操作方法进行与鲁棒性映射关联的测量和界标，并执行评估数据库引擎的操作员实现和/或查询组件的鲁棒性的测试。 说明性计算机实现的系统包括逻辑，其接收在预定运行时间条件范围内在数据库执行期间获取的测量数据库系统性能的一个或多个鲁棒性映射，并使用来自鲁棒性映射或映射的信息来优先化改善数据库鲁棒性的潜在变化 系统实现，其中鲁棒性映射或映射中的地标被操作为鲁棒性错误，其描述数据库运算符或查询组件的预定实现以与预定预期方式不同的方式降级的条件。

公开(公告)号：US20050261920A1

公开(公告)日：2005-11-24

申请号：US10850131

申请日：2004-05-20

申请人： Harumi Kuno ,  Alan Karp

发明人： Harumi Kuno ,  Alan Karp

IPC分类号： G06F7/00 ,  G06F15/16 ,  G06F15/173 ,  G06F17/00 ,  G06Q10/00 ,  G06F17/60

CPC分类号： G06Q10/10 ,  G06Q10/06

摘要： Methods associated with a service are identified. Select ones of the methods are matched to generic methods of a conversation. A new service is established from the conversation that includes the select ones of the methods.

摘要翻译： 识别与服务相关联的方法。 选择一种方法与通用对话方法相匹配。 从包含选择方法的对话中建立新的服务。

公开(公告)号：US10929399B2

公开(公告)日：2021-02-23

申请号：US12364170

申请日：2009-02-02

申请人： Goetz Graefe ,  Harumi Kuno ,  Janet L. Wiener

发明人： Goetz Graefe ,  Harumi Kuno ,  Janet L. Wiener

IPC分类号： G06F16/245 ,  G06F16/2453

摘要： 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.

公开(公告)号：US09606746B2

公开(公告)日：2017-03-28

申请号：US14349113

申请日：2011-10-27

申请人： Goetz Graefe ,  Terence P. Kelly ,  Harumi Kuno ,  Robert E. Tarjan

发明人： Goetz Graefe ,  Terence P. Kelly ,  Harumi Kuno ,  Robert E. Tarjan

IPC分类号： G06F3/00 ,  G06F7/00 ,  G06F3/06 ,  G11C15/04 ,  G11C19/00 ,  G11C19/18 ,  G11C19/28

CPC分类号： G06F3/0647 ,  G06F3/0604 ,  G06F3/0673 ,  G11C15/04 ,  G11C19/00 ,  G11C19/188 ,  G11C19/287

摘要： A shiftable memory supporting in-memory data structures employs built-in data shifting capability. The shiftable memory includes a memory having built-in shifting capability to shift a contiguous subset of data from a first location to a second location within the memory. The shiftable memory further includes a data structure defined on the memory to contain data comprising the contiguous subset. The built-in shifting capability of the memory to facilitate one or more of movement of the data, insertion of the data and deletion of the data within the data structure.

公开(公告)号：US20140040208A1

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

申请号：US13562906

申请日：2012-07-31

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

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

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

CPC分类号： G06F16/2343

摘要： A computing system is associated with a first transaction and a second transaction. The first transaction is associated with an update to data and a release of at least one lock on the data prior to the first transaction being durable. The at least one lock is associated with and/or replaced with at least one tag. The computing system is to identify that the second transaction is to acquire the at least one tag based on a read of the data, determine whether the first transaction is durable based on the at least one tag, and delay a transaction commit for the second transaction until the first transaction is durable.

摘要翻译： 计算系统与第一事务和第二事务相关联。 第一个事务与数据的更新相关联，并且在第一个事务持久之前释放数据上的至少一个锁。 至少一个锁与至少一个标签相关联和/或与至少一个标签相关联。 所述计算系统是基于所述数据的读取来识别所述第二事务是获取所述至少一个标签，基于所述至少一个标签来确定所述第一事务是否持久，并且延迟所述第二事务的事务提交 直到第一笔交易持久。