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

1. 发明申请

US20090083238A1 STOP-AND-RESTART STYLE EXECUTION FOR LONG RUNNING DECISION SUPPORT QUERIES 审中-公开
标题翻译：用于长时间运行的决策支持查询的停止和重新启动方式执行
公开(公告)号：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.
摘要翻译：停止和重新启动的查询执行，部分利用在初始执行查询期间已经执行的工作，以减少重新启动期间的执行时间。该技术选择性地保存来自查询的先前执行的信息，使得与重新启动查询执行相关联的开销可以被界定。尽管仅节省有限的信息，但是所公开的技术大大减少了重新启动的查询的运行时间。停止和重启查询执行技术被限制为只保存和重用有限数量的记录（中间记录或输出记录），从而释放所有其他资源，而不是一些资源。该技术选择在正常执行期间发现的记录的子集，然后在重新启动期间执行扫描时跳过相应的记录，以防止重复执行。采用跳过扫描运算符来促进公开的重启技术。

2. 发明申请

US20130132352A1 EFFICIENT FINE-GRAINED AUDITING FOR COMPLEX DATABASE QUERIES 审中-公开
标题翻译：复杂数据库查询的高效细粒度检查
公开(公告)号：US20130132352A1
公开(公告)日：2013-05-23
申请号：US13303154
申请日：2011-11-23
申请人： Shriraghav Kaushik , Ravishankar Ramamurthy , Yupeng Fu
发明人： Shriraghav Kaushik , Ravishankar Ramamurthy , Yupeng Fu
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F16/2453 , G06F16/211
摘要： The present application provides for techniques for implementing data auditing embodiments that determine whether a query into a database is or has referenced forbidden data within the database. Various techniques are given for efficiently finding all tuples in a database referenced by a given query. A set of sensitive data is determined within a database and the set of sensitive data is employed to define a forbidden view within the database. Data within the database may be annotated to provide efficient identification of data access by query. Incoming queries may be analyzed and modified to propagate annotations for analyzing what data is or was accessed.
摘要翻译：本申请提供了用于实现数据审计实施例的技术，其确定数据库中的查询是否是数据库内的或已经引用了数据库中的禁止数据。给出了各种技术，用于有效地查找给定查询引用的数据库中的所有元组。在数据库中确定一组敏感数据，并采用敏感数据集来定义数据库中的禁止视图。可以注释数据库内的数据，以便通过查询提供对数据访问的有效识别。可以分析和修改传入查询以传播用于分析数据被访问或被访问的注释。

3. 发明授权

US07493337B2 Query progress estimation 有权
标题翻译：查询进度估计
公开(公告)号：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.
摘要翻译：查询进度指示符，向用户提供在数据库上执行的查询的进度的指示。查询进度的指示允许用户决定是否允许查询完成或应该被中止。可用于估计在数据库上执行的查询的进度的一种方法定义了在查询执行过程中执行的工作模型。根据模型估计执行查询期间执行的总工作量。在执行查询期间在给定点执行的工作量根据模型进行估计。查询的进度使用在给定时间点的估计工作量和估计的总工作量来估计。可以向用户提供该估计的查询执行进度。

4. 发明授权

US08190595B2 Flexible query hints in a relational database 有权
标题翻译：关系数据库中的灵活查询提示
公开(公告)号：US08190595B2
公开(公告)日：2012-05-29
申请号：US12413544
申请日：2009-03-28
申请人： Nicolas Bruno , Ravishankar Ramamurthy , Surajit Chaudhuri
发明人： Nicolas Bruno , Ravishankar Ramamurthy , Surajit Chaudhuri
IPC分类号： G06F17/30
CPC分类号： G06F17/30386
摘要： A flexible query hints system and method for discovering and expressing query hints in a database management system. Embodiments of the flexible query hints system and method include a power hints (Phints) language that enables the specification of constraints to influence a query optimizer. Phints expressions are defined as tree patterns annotated with constraints. Embodiments of the flexible query hints system and method also include techniques to incorporate the power hints language expressions into an extended query optimizer. Theses techniques include computing a directed acyclic graph for Phints expression, deriving candidate matches using the Phints expression and the graph, computing candidate matches, and extracting a revised execution plan having a lowest cost and satisfying constraints of the Phints expression. Embodiments of the flexible query hints system and method include a flexible query hint user interface that allow users to interactively adjust query hints.
摘要翻译：灵活的查询提示系统和方法，用于在数据库管理系统中发现和表达查询提示。灵活查询提示系统和方法的实施例包括能够指定约束来影响查询优化器的功率提示（Phints）语言。 Phints表达式定义为使用约束注释的树模式。灵活查询提示系统和方法的实施例还包括将功能提示语言表达式并入到扩展查询优化器中的技术。这些技术包括计算用于Phints表达的有向非循环图，使用Phints表达式和图形导出候选匹配，计算候选匹配，以及提取具有最低成本并满足Phints表达式的约束的经修订的执行计划。灵活查询提示系统和方法的实施例包括灵活的查询提示用户界面，允许用户交互地调整查询提示。

5. 发明申请

US20110313999A1 SLICING RELATIONAL QUERIES USING SPOOL OPERATORS 审中-公开
标题翻译：使用SPOOL操作员的关联关系查询
公开(公告)号：US20110313999A1
公开(公告)日：2011-12-22
申请号：US12817511
申请日：2010-06-17
申请人： Nicolas Bruno , Ravishankar Ramamurthy , Surajit Chaudhuri , Vivek Ravindranath Narasayya
发明人： Nicolas Bruno , Ravishankar Ramamurthy , Surajit Chaudhuri , Vivek Ravindranath Narasayya
IPC分类号： G06F17/30
CPC分类号： G06F16/24537 , G06F16/24542
摘要： A relational database server may concurrently execute many relational queries, but a complex relational query may cause performance delays in the fulfillment of other relational queries. Instead, the relational database server may generate a query plan for the relational query, and may endeavor to partition the relational query between a spool operator and a scan operator into two or more query slices, where each query slice may be executed within a query slice threshold. Many alternative candidate query plans may be considered, such as inserting spool and scan operators after various operators and parameterizing operators in order to partition the records of a relation into two or more ranges based on an attribute of the relation. A large search space of candidate query plans may be reviewed in order to select a query plan that respects the query slice threshold while efficiently executing the logic of the relational query.
摘要翻译：关系数据库服务器可以同时执行许多关系查询，但是复杂的关系查询可能导致履行其他关系查询的性能延迟。相反，关系数据库服务器可以生成关系查询的查询计划，并且可以尝试将线程运算符和扫描运算符之间的关系查询划分成两个或更多个查询片段，其中每个查询片段可以在查询片段内执行阈。可以考虑许多备选候选查询计划，例如在各种运算符和参数化运算符之后插入假脱机和扫描运算符，以便基于关系的属性将关系的记录分成两个或更多个范围。可以检查候选查询计划的大搜索空间，以便在有效执行关系查询的逻辑的同时选择尊重查询片段阈值的查询计划。

6. 发明授权

US07958114B2 Detecting estimation errors in dictinct page counts 有权
标题翻译：检测特定页数中的估计误差
公开(公告)号：US07958114B2
公开(公告)日：2011-06-07
申请号：US12098178
申请日：2008-04-04
申请人： Surajit Chaudhuri , Vivek Narasayya , Ravishankar Ramamurthy
发明人： Surajit Chaudhuri , Vivek Narasayya , Ravishankar Ramamurthy
IPC分类号： G06F7/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.
摘要翻译：数据库服务器可以被配置为计算被访问的页面的不同页面计数以执行各个查询的操作数。可以针对由该页组成的表并且具有由数据库服务器管理的索引来执行查询。独立页面计数可以通过在执行查询期间计数访问的不同页面作为执行查询的一部分来获得。

7. 发明申请

US20050222965A1 Query progress estimation 有权
标题翻译：查询进度估计
公开(公告)号：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.
摘要翻译：查询进度指示符，向用户提供在数据库上执行的查询的进度的指示。查询进度的指示允许用户决定是否允许查询完成或应该被中止。可用于估计在数据库上执行的查询的进度的一种方法定义了在查询执行过程中执行的工作模型。根据模型估计执行查询期间执行的总工作量。在执行查询期间在给定点执行的工作量根据模型进行估计。查询的进度使用在给定时间点的估计工作量和估计的总工作量来估计。可以向用户提供该估计的查询执行进度。

8. 发明授权

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

9. 发明授权

US10838957B2 Slicing relational queries using spool operators 有权
公开(公告)号：US10838957B2
公开(公告)日：2020-11-17
申请号：US12817511
申请日：2010-06-17
申请人： Nicolas Bruno , Ravishankar Ramamurthy , Surajit Chaudhuri , Vivek Ravindranath Narasayya
发明人： Nicolas Bruno , Ravishankar Ramamurthy , Surajit Chaudhuri , Vivek Ravindranath Narasayya
IPC分类号： G06F16/2453
CPC分类号： G06F16/24537 , G06F16/24542
摘要： A relational database server may concurrently execute many relational queries, but a complex relational query may cause performance delays in the fulfillment of other relational queries. Instead, the relational database server may generate a query plan for the relational query, and may endeavor to partition the relational query between a spool operator and a scan operator into two or more query slices, where each query slice may be executed within a query slice threshold. Many alternative candidate query plans may be considered, such as inserting spool and scan operators after various operators and parameterizing operators in order to partition the records of a relation into two or more ranges based on an attribute of the relation. A large search space of candidate query plans may be reviewed in order to select a query plan that respects the query slice threshold while efficiently executing the logic of the relational query.

10. 发明申请

US20100250518A1 FLEXIBLE QUERY HINTS IN A RELATIONAL DATABASE 有权
标题翻译：相关数据库中的灵活查询
公开(公告)号：US20100250518A1
公开(公告)日：2010-09-30
申请号：US12413544
申请日：2009-03-28
申请人： Nicolas Bruno , Ravishankar Ramamurthy , Surajit Chaudhuri
发明人： Nicolas Bruno , Ravishankar Ramamurthy , Surajit Chaudhuri
IPC分类号： G06F17/30
CPC分类号： G06F17/30386
摘要： A flexible query hints system and method for discovering and expressing query hints in a database management system. Embodiments of the flexible query hints system and method include a power hints (Phints) language that enables the specification of constraints to influence a query optimizer. Phints expressions are defined as tree patterns annotated with constraints. Embodiments of the flexible query hints system and method also include techniques to incorporate the power hints language expressions into an extended query optimizer. Theses techniques include computing a directed acyclic graph for Phints expression, deriving candidate matches using the Phints expression and the graph, computing candidate matches, and extracting a revised execution plan having a lowest cost and satisfying constraints of the Phints expression. Embodiments of the flexible query hints system and method include a flexible query hint user interface that allow users to interactively adjust query hints.
摘要翻译：灵活的查询提示系统和方法，用于在数据库管理系统中发现和表达查询提示。灵活查询提示系统和方法的实施例包括能够指定约束来影响查询优化器的功率提示（Phints）语言。 Phints表达式定义为使用约束注释的树模式。灵活查询提示系统和方法的实施例还包括将功能提示语言表达式并入到扩展查询优化器中的技术。这些技术包括计算用于Phints表达的有向非循环图，使用Phints表达式和图形导出候选匹配，计算候选匹配，以及提取具有最低成本并满足Phints表达式的约束的经修订的执行计划。灵活查询提示系统和方法的实施例包括灵活的查询提示用户界面，允许用户交互地调整查询提示。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式