公开(公告)号：US20050222965A1

公开(公告)日：2005-10-06

申请号：US10813963

申请日：2004-03-31

申请人： Surajit Chaudhuri ,  Vivek Narasayya ,  Ravishankar Ramamurthy

发明人： Surajit Chaudhuri ,  Vivek Narasayya ,  Ravishankar Ramamurthy

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

CPC分类号： G06F17/30522 ,  G06F17/30306 ,  Y10S707/99932 ,  Y10S707/99945 ,  Y10S707/99948

摘要： A query progress indicator that provides an indication to a user of the progress of a query being executed on a database. The indication of the progress of the query allows the user to decide whether the query should be allowed to complete or should be aborted. One method that may be used to estimate the progress of a query that is being executed on a database defines a model of work performed during execution of a query. The total amount of work that will be performed during execution of the query is estimated according to the model. The amount of work performed at a given point during execution of the query is estimated according to the model. The progress of the query is estimated using the estimated amount of work at the given point in time and the estimated total amount of work. This estimated progress of query execution may be provided to the user.

摘要翻译： 查询进度指示符，向用户提供在数据库上执行的查询的进度的指示。 查询进度的指示允许用户决定是否允许查询完成或应该被中止。 可用于估计在数据库上执行的查询的进度的一种方法定义了在查询执行过程中执行的工作模型。 根据模型估计执行查询期间执行的总工作量。 在执行查询期间在给定点执行的工作量根据模型进行估计。 查询的进度使用在给定时间点的估计工作量和估计的总工作量来估计。 可以向用户提供该估计的查询执行进度。

公开(公告)号：US07493337B2

公开(公告)日：2009-02-17

申请号：US10813963

申请日：2004-03-31

申请人： Surajit Chaudhuri ,  Vivek Narasayya ,  Ravishankar Ramamurthy

发明人： Surajit Chaudhuri ,  Vivek Narasayya ,  Ravishankar Ramamurthy

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

CPC分类号： G06F17/30522 ,  G06F17/30306 ,  Y10S707/99932 ,  Y10S707/99945 ,  Y10S707/99948

摘要： A query progress indicator that provides an indication to a user of the progress of a query being executed on a database. The indication of the progress of the query allows the user to decide whether the query should be allowed to complete or should be aborted. One method that may be used to estimate the progress of a query that is being executed on a database defines a model of work performed during execution of a query. The total amount of work that will be performed during execution of the query is estimated according to the model. The amount of work performed at a given point during execution of the query is estimated according to the model. The progress of the query is estimated using the estimated amount of work at the given point in time and the estimated total amount of work. This estimated progress of query execution may be provided to the user.

摘要翻译： 查询进度指示符，向用户提供在数据库上执行的查询的进度的指示。 查询进度的指示允许用户决定是否允许查询完成或应该被中止。 可用于估计在数据库上执行的查询的进度的一种方法定义了在查询执行过程中执行的工作模型。 根据模型估计执行查询期间执行的总工作量。 在执行查询期间在给定点执行的工作量根据模型进行估计。 查询的进度使用在给定时间点的估计工作量和估计的总工作量来估计。 可以向用户提供该估计的查询执行进度。

公开(公告)号：US07739269B2

公开(公告)日：2010-06-15

申请号：US11625153

申请日：2007-01-19

申请人： Surajit Chaudhuri ,  Ravishankar Ramamurthy

发明人： Surajit Chaudhuri ,  Ravishankar Ramamurthy

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

CPC分类号： G06F17/30463

摘要： Database systems use a plan cache to avoid the overheads (e.g., time, money) of query recompilation. Query plans can become invalidated by updates to the statistics on data or changes to the physical database design. Once a plan is invalidated, it can be repaired utilizing one or more of the disclosed embodiments. Incremental repair of query plans includes reusing parts of the current plan rather than discarding the plan entirely when it is invalidated. Repair to an existing query plan is attempted before resorting to full recompilation.

摘要翻译： 数据库系统使用计划缓存来避免查询重新编译的开销（如时间，金钱）。 通过对数据统计信息的更新或物理数据库设计更改，查询计划可能会失效。 一旦计划无效，可以利用所公开的一个或多个实施例来修复计划。 查询计划的增量修复包括重新使用当前计划的部分，而不是完全在无效的情况下丢弃计划。 在进行完全重新编译之前尝试修复现有的查询计划。

公开(公告)号：US20090083238A1

公开(公告)日：2009-03-26

申请号：US11859046

申请日：2007-09-21

申请人： Surajit Chaudhuri ,  Shriraghav Kaushik ,  Abhijit Pol ,  Ravishankar Ramamurthy

发明人： Surajit Chaudhuri ,  Shriraghav Kaushik ,  Abhijit Pol ,  Ravishankar Ramamurthy

IPC分类号： G06F17/30

CPC分类号： G06F16/24561

摘要： Stop-and-restart query execution that partially leverages the work already performed during the initial execution of the query to reduce the execution time during a restart. The technique selectively saves information from a previous execution of the query so that the overhead associated with restarting the query execution can be bounded. Despite saving only limited information, the disclosed technique substantially reduces the running time of the restarted query. The stop-and-restart query execution technique is constrained to save and reuse only a bounded number of records (intermediate records or output records) thereby releasing all other resources, rather than some of the resources. The technique chooses a subset of the records to save that were found during normal execution and then skipping the corresponding records when performing a scan during restart to prevent the duplication of execution. A skip-scan operator is employed to facilitate the disclosed restart technique.

摘要翻译： 停止和重新启动的查询执行，部分利用在初始执行查询期间已经执行的工作，以减少重新启动期间的执行时间。 该技术选择性地保存来自查询的先前执行的信息，使得与重新启动查询执行相关联的开销可以被界定。 尽管仅节省有限的信息，但是所公开的技术大大减少了重新启动的查询的运行时间。 停止和重启查询执行技术被限制为只保存和重用有限数量的记录（中间记录或输出记录），从而释放所有其他资源，而不是一些资源。 该技术选择在正常执行期间发现的记录的子集，然后在重新启动期间执行扫描时跳过相应的记录，以防止重复执行。 采用跳过扫描运算符来促进公开的重启技术。

公开(公告)号：US08185519B2

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

申请号：US12404284

申请日：2009-03-14

申请人： Surajit Chaudhuri ,  Vivek Narasayya ,  Ravishankar Ramamurthy

发明人： Surajit Chaudhuri ,  Vivek Narasayya ,  Ravishankar Ramamurthy

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

CPC分类号： G06F17/30463

摘要： An exact cardinality query optimization system and method for optimizing a query having a plurality of expressions to obtain a cardinality-optimal query execution plan for the query. Embodiments of the system and method use various techniques to shorten the time necessary to obtain the cardinality-optimal query execution plan, which contains the query execution plan when all cardinalities are exact. Embodiments of the system and method include a covering queries technique that leverages query execution feedback to obtain an unordered subset of relevant expressions for the query, an early termination technique that bounds the cardinality to determine whether the processing can be terminate before each of the expressions are executed, and an expressions ordering technique that finds an ordering of expressions that yields the greatest reduction in time to obtain the cardinality-optimal query execution plan.

摘要翻译： 一种精确的基数查询优化系统和方法，用于优化具有多个表达式的查询，以获得查询的基本优化查询执行计划。 系统和方法的实施例使用各种技术来缩短获得基数优化查询执行计划所需的时间，当所有基数是精确的时，其包含查询执行计划。 该系统和方法的实施例包括利用查询执行反馈来获取查询的相关表达式的无序子集的覆盖查询技术，限制基数以确定处理是否可以在每个表达式之前终止的提前终止技术是 以及表达式排序技术，其找到产生最大时间缩短以获得基数优化查询执行计划的表达式的排序。

公开(公告)号：US20090254522A1

公开(公告)日：2009-10-08

申请号：US12098178

申请日：2008-04-04

申请人： Surajit Chaudhuri ,  Vivek Narasayya ,  Ravishankar Ramamurthy

发明人： Surajit Chaudhuri ,  Vivek Narasayya ,  Ravishankar Ramamurthy

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

CPC分类号： G06F17/30306 ,  G06Q30/0202

摘要： A database server may be configured to compute distinct page counts of pages accessed to execute operands of respective queries. The queries may be executed against a table comprised of the pages and having an index managed by the database server. The distinct page counts may be obtained by counting, as a part of the executing of the queries, distinct pages accessed during the execution of the queries.

摘要翻译： 数据库服务器可以被配置为计算被访问的页面的不同页面计数以执行各个查询的操作数。 可以针对由该页组成的表并且具有由数据库服务器管理的索引来执行查询。 独立页面计数可以通过在执行查询期间计数访问的不同页面作为执行查询的一部分来获得。

公开(公告)号：US20090094191A1

公开(公告)日：2009-04-09

申请号：US11868957

申请日：2007-10-08

申请人： Surajit Chaudhuri ,  Vivek R. Narasayya ,  Ravishankar Ramamurthy

发明人： Surajit Chaudhuri ,  Vivek R. Narasayya ,  Ravishankar Ramamurthy

IPC分类号： G06F17/30

CPC分类号： G06F16/24542

摘要： A proactive monitoring mechanism for correcting the choice of access methods (available query plans) for a given query, based on execution feedback from the same query. The mechanism exploits bypassing predicate short-circuiting inside the database server's predicate evaluation module to obtain expression cardinalities. The mechanism can also modify a plan to obtain expression cardinalities. These techniques are used judiciously by the query optimizer and/or a database administrator (DBA) so that the execution overheads are within acceptable limits.

摘要翻译： 一种主动监视机制，用于根据同一查询的执行反馈来校正给定查询的访问方法（可用查询计划）的选择。 该机制利用绕过数据库服务器谓词评估模块内的谓词短路来获得表达式的基数。 该机制还可以修改计划以获得表达式的基数。 这些技术由查询优化器和/或数据库管理员（DBA）明智地使用，以便执行开销在可接受的限度内。

公开(公告)号：US07454407B2

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

申请号：US11149968

申请日：2005-06-10

申请人： Surajit Chaudhuri ,  Ravishankar Ramamurthy ,  Kaushik Shriraghav

发明人： Surajit Chaudhuri ,  Ravishankar Ramamurthy ,  Kaushik Shriraghav

IPC分类号： G06F7/00

CPC分类号： G06F17/30522 ,  G06F17/30474 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935

摘要： Techniques for estimating the progress of database queries are described herein. In a first implementation, a respective lower-bound parameter is associated with each node in an operator tree that representing a given database query, and the progress of the database query at a given point is estimated based upon the lower-bound parameters. In a second implementation, the progress of the query is estimated by associating respective lower-bound and upper-bound parameters with each node in the operator tree. The progress of the query at the given point is then estimated based on the lower-bound and upper-bound parameters.

摘要翻译： 本文描述了用于估计数据库查询的进度的技术。 在第一实现中，相应的下限参数与表示给定数据库查询的运算符树中的每个节点相关联，并且基于下限参数来估计给定点处的数据库查询的进度。 在第二个实现中，通过将相应的下限和上限参数与运算符树中的每个节点相关联来估计查询的进度。 然后，基于下限和上限参数估计给定点处的查询进度。

公开(公告)号：US20080177694A1

公开(公告)日：2008-07-24

申请号：US11625153

申请日：2007-01-19

申请人： Surajit Chaudhuri ,  Ravishankar Ramamurthy

发明人： Surajit Chaudhuri ,  Ravishankar Ramamurthy

IPC分类号： G06F7/00

CPC分类号： G06F17/30463

摘要： Database systems use a plan cache to avoid the overheads (e.g., time, money) of query recompilation. Query plans can become invalidated by updates to the statistics on data or changes to the physical database design. Once a plan is invalidated, it can be repaired utilizing one or more of the disclosed embodiments. Incremental repair of query plans includes reusing parts of the current plan rather than discarding the plan entirely when it is invalidated. Repair to an existing query plan is attempted before resorting to full recompilation.

摘要翻译： 数据库系统使用计划缓存来避免查询重新编译的开销（如时间，金钱）。 通过对数据统计信息的更新或物理数据库设计更改，查询计划可能会失效。 一旦计划无效，可以利用所公开的一个或多个实施例来修复计划。 查询计划的增量修复包括重新使用当前计划的部分，而不是完全在无效的情况下丢弃计划。 在进行完全重新编译之前尝试修复现有的查询计划。

公开(公告)号：US07882121B2

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

申请号：US11275782

申请日：2006-01-27

申请人： Nicolas Bruno ,  Surajit Chaudhuri ,  Dilys Thomas

发明人： Nicolas Bruno ,  Surajit Chaudhuri ,  Dilys Thomas

IPC分类号： G06F17/00

CPC分类号： G06F17/30424 ,  G06F17/30595

摘要： A query generation using cardinality constraints process including choosing a first set of parameters for a query, calculating an additional set of parameters based on the first set of parameters, executing the query using additional set of parameters, evaluating the cardinality error the additional set of parameters, and refining the additional set of parameters to meet the desired cardinality constraint. Creating a query and selecting parameters for the query to meet a desired cardinality constraint or set of cardinality constraints when the query is executed against a database may be difficult. A query generation using cardinality constraints process may create a set of parameters for a query which satisfies a desired cardinality constraint or set of cardinality constraints. An application of such a query generation using cardinality constraints process may be database component and code testing.

摘要翻译： 使用基数约束过程的查询生成，包括选择用于查询的第一组参数，基于第一组参数计算附加参数集合，使用附加参数集执行查询，评估基数误差附加参数集 ，并且提炼额外的一组参数以满足期望的基数约束。 创建查询并选择参数，以便在针对数据库执行查询时难以满足所需的基数约束或基数约束集合。 使用基数约束过程的查询生成可以为满足期望的基数约束或一组基数约束的查询创建一组参数。 使用基数约束过程的这种查询生成的应用可以是数据库组件和代码测试。