-
1.发明授权Method and apparatus for projecting the effect of maintaining an auxiliary database structure for use in executing database queries 有权用于预测维护辅助数据库结构以用于执行数据库查询的效果的方法和装置公开(公告)号：US07743052B2
公开(公告)日：2010-06-22
申请号：US11353515
申请日：2006-02-14
IPC分类号： G06F7/00
CPC分类号： G06F17/30289 , G06F17/30386
摘要： A database management system maintains a record of queries which can be executed against the database. For a given auxiliary database structure, an advisory function automatically reviews the query record and identifies those queries which might execute with greater efficiency using the auxiliary database structure, presenting analytical information to the user. Preferably, the auxiliary database structure is an index, and the information is used for determining whether to include the index in the database definition. Preferably, a query optimizer records potentially useful indexes when considering multiple alternative database optimizations, and this information is later retrieved to identify queries which would benefit from an index.
摘要翻译： 数据库管理系统维护可以针对数据库执行的查询记录。 对于给定的辅助数据库结构，咨询功能自动审查查询记录，并使用辅助数据库结构识别可能以更高效率执行的查询，向用户呈现分析信息。 优选地，辅助数据库结构是索引，并且该信息用于确定是否将数据包括在数据库定义中。 优选地，当考虑多个备选数据库优化时，查询优化器记录潜在有用的索引，并且稍后检索该信息以识别将从索引中受益的查询。
-
公开(公告)号：US08452756B2
公开(公告)日：2013-05-28
申请号：US11558104
申请日：2006-11-09
申请人： Mark John Anderson , Robert Joseph Bestgen , Daniel E. Beuch , Curtis Neal Boger , James Michael Flanagan , Scott Forstie , Shantan Kethireddy , Thomas Owen McKinley , Michael Donald Pfeifer
发明人： Mark John Anderson , Robert Joseph Bestgen , Daniel E. Beuch , Curtis Neal Boger , James Michael Flanagan , Scott Forstie , Shantan Kethireddy , Thomas Owen McKinley , Michael Donald Pfeifer
CPC分类号： G06F17/30471 , G06F17/30306
摘要： A database query optimizer includes an access plan storage mechanism that stores execution detail corresponding to a query statement in an access plan cache. By storing execution detail in the access plan cache along with the query statement, the execution detail is available when needed to debug database problems, even after a problem occurs. The execution detail stored in the access plan cache may be mined and analyzed after-the-fact, producing a very powerful tool for debugging database problems. Snapshots of the execution detail may also be created by a user. In addition, the user may setup autonomic snapshots and comparisons so that a user may be alerted from a degradation in database performance between two snapshots.
摘要翻译： 数据库查询优化器包括访问计划存储机制，其存储与访问计划高速缓存中的查询语句相对应的执行细节。 通过将访问计划高速缓存中的执行详细信息与查询语句一起存储，即使在发生问题后仍需要调试数据库问题，执行细节就可用。 存储在访问计划缓存中的执行细节可以在事后进行挖掘和分析，为调试数据库问题提供了非常强大的工具。 执行细节的快照也可以由用户创建。 此外，用户可以设置自主快照和比较，使得可以从两个快照之间的数据库性能的降级中提醒用户。
-
公开(公告)号：US20080114718A1
公开(公告)日：2008-05-15
申请号：US11558104
申请日：2006-11-09
申请人： Mark John Anderson , Robert Joseph Bestgen , Daniel E. Beuch , Curtis Neal Boger , James Michael Flanagan , Scott Forstie , Shantan Kethireddy , Thomas Owen McKinley , Michael Donald Pfeifer
发明人： Mark John Anderson , Robert Joseph Bestgen , Daniel E. Beuch , Curtis Neal Boger , James Michael Flanagan , Scott Forstie , Shantan Kethireddy , Thomas Owen McKinley , Michael Donald Pfeifer
IPC分类号： G06F17/30
CPC分类号： G06F17/30471 , G06F17/30306
摘要： A database query optimizer includes an access plan storage mechanism that stores execution detail corresponding to a query statement in an access plan cache. By storing execution detail in the access plan cache along with the query statement, the execution detail is available when needed to debug database problems, even after a problem occurs. The execution detail stored in the access plan cache may be mined and analyzed after-the-fact, producing a very powerful tool for debugging database problems. Snapshots of the execution detail may also be created by a user. In addition, the user may setup autonomic snapshots and comparisons so that a user may be alerted from a degradation in database performance between two snapshots.
摘要翻译： 数据库查询优化器包括访问计划存储机制，其存储与访问计划高速缓存中的查询语句相对应的执行细节。 通过将访问计划高速缓存中的执行详细信息与查询语句一起存储，即使在发生问题后仍需要调试数据库问题，执行细节就可用。 存储在访问计划缓存中的执行细节可以在事后进行挖掘和分析，为调试数据库问题提供了非常强大的工具。 执行细节的快照也可以由用户创建。 此外，用户可以设置自主快照和比较，使得可以从两个快照之间的数据库性能的降级中提醒用户。
-
4.发明申请REDUCING INSTABILITY OF A JOB WITHIN A HETEROGENEOUS STREAM PROCESSING APPLICATION 有权降低异构流程处理应用中的作业的不稳定性公开(公告)号：US20090320039A1
公开(公告)日：2009-12-24
申请号：US12145021
申请日：2008-06-24
IPC分类号： G06F9/50
CPC分类号： G06F9/5027 , G06F9/4881 , G06F9/5038 , G06F11/3404
摘要： Embodiments of the invention provide a method for reducing instability in a heterogeneous job plan of a stream processing application. In one embodiment, a job manager may be configured to select a job plan with the objective of minimizing the potential instability of the job plan. Each job plan may provide a directed graph connecting processing elements (both native and non-native). That is, each job plan illustrates data flow through the stream application framework. The job plan may be selected from multiple available job plans, or may be generated by replacing processing elements of a given job plan. Further, the job plan may be selected on the basis of other objectives in addition to an objective of minimizing the potential instability of the job plan, such as minimizing cost, minimizing execution time, minimizing resource usage, etc.
摘要翻译： 本发明的实施例提供了一种用于减少流处理应用的异构作业计划中的不稳定性的方法。 在一个实施例中，作业管理器可以被配置为选择作业计划，目的是最小化作业计划的潜在不稳定性。 每个作业计划可以提供连接处理元件（本机和非本机）的有向图。 也就是说，每个作业计划都说明了通过流应用程序框架的数据流。 可以从多个可用作业计划中选择作业计划，或者可以通过替换给定作业计划的处理元素来生成作业计划。 此外，可以基于其他目标选择作业计划，除了最小化作业计划的潜在不稳定性的目标，例如最小化成本，最小化执行时间，最小化资源使用等。
-
公开(公告)号：US20140033173A1
公开(公告)日：2014-01-30
申请号：US13469409
申请日：2012-05-11
申请人： Andrew Lawrence Frenkiel , Henrique Andrade , Bugra Gedik , Michael Donald Pfeifer , Wim De Pauw
发明人： Andrew Lawrence Frenkiel , Henrique Andrade , Bugra Gedik , Michael Donald Pfeifer , Wim De Pauw
IPC分类号： G06F9/44
摘要： An embodiment of the invention provides a method of displaying a data flow, wherein a description of a data flow application to be displayed is received. The data flow application includes nodes and edges connecting the nodes, wherein the nodes represent operators and the edges represent data connections for data flowing between the operations. A reason that a user is to view the data flow and/or a user constraint on a complexity of the data flow application to be displayed is determined with a processor; and, the time required to render a display of the data flow application is estimated. A transformed representation of the data flow application is created with the processor. The transformed representation is created based upon the user reason, the user constraint, the estimated time of rendering, and/or a layout strategy. The transformed representation is displayed on a graphical user interface.
摘要翻译： 本发明的实施例提供一种显示数据流的方法，其中接收要显示的数据流应用的描述。 数据流应用程序包括连接节点的节点和边缘，其中节点表示运算符，边缘表示在运算之间流动的数据的数据连接。 用处理器确定用户要查看要显示的数据流应用的复杂度的数据流和/或用户约束的原因; 并且估计呈现数据流应用的显示所需的时间。 使用处理器创建数据流应用程序的变换表示。 基于用户原因，用户约束，估计的呈现时间和/或布局策略来创建变换表示。 转换的表示形式显示在图形用户界面上。
-
公开(公告)号：US07584200B2
公开(公告)日：2009-09-01
申请号：US11047535
申请日：2005-01-31
CPC分类号： G06F17/30572 , Y10S707/99942
摘要： Graphical maps of databases and related objects within a database have benefits for a database administrator. Instead of displaying all objects related to a node of interest, a user can select what maximum relation level to use to locate related objects. The mapping software starts at the initial node, or objects, and locates only those related objects that are within the maximum relation level as specified by the user. Only these located objects are displayed thereby producing a clearer and more concise map.
摘要翻译： 数据库中的数据库和相关对象的图形图可以为数据库管理员带来好处。 用户可以选择用于定位相关对象的最大关系级别，而不是显示与感兴趣的节点相关的所有对象。 映射软件从初始节点或对象开始，仅定位用户指定的最大关系级别内的相关对象。 只显示这些位置的对象，从而产生更清晰和更简洁的地图。
-
公开(公告)号：US08656369B2
公开(公告)日：2014-02-18
申请号：US12785916
申请日：2010-05-24
申请人： Paul V. Allen , Henrique Andrade , Wim De Pauw , Bugra Gedik , Andy L. Frenkiel , Michael Donald Pfeifer
发明人： Paul V. Allen , Henrique Andrade , Wim De Pauw , Bugra Gedik , Andy L. Frenkiel , Michael Donald Pfeifer
IPC分类号： G06F9/44
CPC分类号： G06F11/3636
摘要： A method is provided for tracing dataflow in a distributed computing application. For example, the method includes incrementally advancing a dataflow in a dataflow path of one or more dataflow paths according to two or more directives encoded in two or more data messages. The method further includes performing the two or more directives. The dataflow path includes one or more operators including at least one merge operator operative to merge the two or more data messages and merge the two or more directives. One or more of the incrementally advancing of the dataflow and the performing of the two or more directives are implemented as instruction code performed on a processor device.
摘要翻译： 提供了一种用于在分布式计算应用程序中跟踪数据流的方法。 例如，该方法包括根据在两个或多个数据消息中编码的两个或更多个指令来逐步推进一个或多个数据流路径的数据流路径中的数据流。 该方法还包括执行两个或更多个指令。 数据流路径包括一个或多个运算符，包括至少一个合并运算符，用于合并两个或多个数据消息并合并两个或多个指令。 数据流的递增推进和两个或多个指令的执行中的一个或多个被实现为在处理器设备上执行的指令代码。
-
8.发明申请公开(公告)号：US20090320038A1
公开(公告)日：2009-12-24
申请号：US12144946
申请日：2008-06-24
IPC分类号： G06F9/50
CPC分类号： G06F9/5038 , G06F11/3404
摘要： Embodiments of the invention provide a method for reducing instability in a heterogeneous job plan of a stream processing application. In one embodiment, a job manager may be configured to select a job plan with the objective of minimizing the potential instability of the job plan. Each job plan may provide a directed graph connecting processing elements (both native and non-native). That is, each job plan illustrates data flow through the stream application framework. The job plan may be selected from multiple available job plans, or may be generated by replacing processing elements of a given job plan. Further, the job plan may be selected on the basis of other objectives in addition to an objective of minimizing the potential instability of the job plan, such as minimizing cost, minimizing execution time, minimizing resource usage, etc.
摘要翻译： 本发明的实施例提供了一种用于减少流处理应用的异构作业计划中的不稳定性的方法。 在一个实施例中，作业管理器可以被配置为选择作业计划，目的是最小化作业计划的潜在不稳定性。 每个作业计划可以提供连接处理元件（本机和非本机）的有向图。 也就是说，每个作业计划都说明了通过流应用程序框架的数据流。 可以从多个可用作业计划中选择作业计划，或者可以通过替换给定作业计划的处理元素来生成作业计划。 此外，可以基于其他目标选择作业计划，除了最小化作业计划的潜在不稳定性的目标，例如最小化成本，最小化执行时间，最小化资源使用等。
-
9.发明授权Method to document relations between objects using a graphical interface tree component 失效使用图形界面树组件记录对象之间关系的方法公开(公告)号：US06842878B1
公开(公告)日：2005-01-11
申请号：US09672044
申请日：2000-09-29
CPC分类号： G06F3/0482 , Y10S715/968
摘要： Logical relationships between objects are displayed using a graphical interface tree component. In a data base application, by selecting and expanding a table node, user can see those views and indexes which are directly related to the table, but not contained within the table, i.e., where there is no physical connection, but there are logical connections (relations). With context menus, the user can make changes in place.
摘要翻译： 使用图形界面树组件显示对象之间的逻辑关系。 在数据库应用中，通过选择和扩展表节点，用户可以看到与表直接相关但不包含在表内的那些视图和索引，即没有物理连接的地方，但是有逻辑连接 （关系）。 使用上下文菜单，用户可以进行更改。
-
10.发明授权Job plan selection for reducing instability of a job within a heterogeneous stream processing application 有权工作计划选择，用于减少异构流处理应用程序内的作业的不稳定性公开(公告)号：US09389918B2
公开(公告)日：2016-07-12
申请号：US12145021
申请日：2008-06-24
CPC分类号： G06F9/5027 , G06F9/4881 , G06F9/5038 , G06F11/3404
摘要： Embodiments of the invention provide a method for reducing instability in a heterogeneous job plan of a stream processing application. In one embodiment, a job manager may be configured to select a job plan with the objective of minimizing the potential instability of the job plan. Each job plan may provide a directed graph connecting processing elements (both native and non-native). That is, each job plan illustrates data flow through the stream application framework. The job plan may be selected from multiple available job plans, or may be generated by replacing processing elements of a given job plan. Further, the job plan may be selected on the basis of other objectives in addition to an objective of minimizing the potential instability of the job plan, such as minimizing cost, minimizing execution time, minimizing resource usage, etc.
摘要翻译： 本发明的实施例提供了一种用于减少流处理应用的异构作业计划中的不稳定性的方法。 在一个实施例中，作业管理器可以被配置为选择作业计划，目的是最小化作业计划的潜在不稳定性。 每个作业计划可以提供连接处理元件（本机和非本机）的有向图。 也就是说，每个作业计划都说明了通过流应用程序框架的数据流。 可以从多个可用作业计划中选择作业计划，或者可以通过替换给定作业计划的处理元素来生成作业计划。 此外，可以基于其他目标选择作业计划，除了最小化作业计划的潜在不稳定性的目标，例如最小化成本，最小化执行时间，最小化资源使用等。
-
-
-
-
-
-
-
-
-
搜索结果
18 条记录 (耗时 0.028 秒)
