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

31. 发明授权

US07580920B2 System and method for graceful degradation of a database query 失效
标题翻译：数据库查询的优雅退化的系统和方法
公开(公告)号：US07580920B2
公开(公告)日：2009-08-25
申请号：US10897017
申请日：2004-07-22
申请人： Craig S. Freedman , Goetz Graefe
发明人： Craig S. Freedman , Goetz Graefe
IPC分类号： G06F7/00
CPC分类号： G06F17/30492 , G06F17/30474 , Y10S707/99932 , Y10S707/99933 , Y10S707/99935
摘要： A method to achieve acceptable query performance even when a database query optimizer chooses an inefficient query plan due to poor cardinality (row count) estimation includes generating a batch sort query plan which includes a row count operation and a reorder operation. The batch sort, and in particular the reorder operation, is not required to satisfy the query but without these operations the query plan may prove to be inefficient. When the row count operation determines that the query plan is inefficient, the row reordering operation reorders rows for more I/O efficient processing. The results of both the row count operation and the reorder operation are used to produce the desired rowset to satisfy the input query without discarding any retrieved rows. The combination of the row count operation and reorder operation allows a graceful degradation of query performance where the original query plan selected by a query optimizer without the batch sort or reorder operation would execute in an I/O inefficient manner.
摘要翻译：即使数据库查询优化器由于基数不足（行计数）估计而选择无效的查询计划，也可以实现可接受的查询性能的方法包括生成包含行计数操作和重排序操作的批次排序查询计划。批次排序，特别是重新排序操作不需要满足查询，但是没有这些操作，查询计划可能被证明是低效的。当行计数操作确定查询计划效率低下时，行重排序操作将重新排序行以获得更多I / O高效处理。行计数操作和重排序操作的结果用于产生所需的行集以满足输入查询而不丢弃任何检索的行。行计数操作和重新排序操作的组合允许查询性能的平缓降级，其中由查询优化器选择的原始查询计划没有批次排序或重新排序操作将以I / O低效的方式执行。

32. 发明授权

US07483888B2 Method and apparatus for predicting selectivity of database query join conditions using hypothetical query predicates having skewed value constants 有权
标题翻译：使用具有偏差值常数的假设查询谓词来预测数据库查询连接条件的选择性的方法和装置
公开(公告)号：US07483888B2
公开(公告)日：2009-01-27
申请号：US11938847
申请日：2007-11-13
申请人： Michael S. Faunce , Shantan Kethireddy , Brian Robert Muras
发明人： Michael S. Faunce , Shantan Kethireddy , Brian Robert Muras
IPC分类号： G06F7/00
CPC分类号： G06F17/30469 , G06F17/30474 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99942 , Y10S707/99943 , Y10S707/99945
摘要： A database management system predicts a selectivity for database query conditions requiring a join of records from different tables. The system identifies at least one skewed value in a field specified in the join condition, and constructs, for each skewed value, a set of hypothetical query predicates in which the field specified in the join condition is replaced with a constant equal to the skewed value. The system then predicts the selectivity for the hypothetical predicates, using any appropriate prediction technique. The selectivities of the hypothetical predicates are used to predict a selectivity for the original query.
摘要翻译：数据库管理系统预测数据库查询条件的选择性需要来自不同表的记录的连接。系统识别在连接条件中指定的字段中的至少一个偏斜值，并且针对每个偏斜值构造一组假设查询谓词，其中在连接条件中指定的字段被等于倾斜值的常数替换。然后，系统使用任何适当的预测技术来预测假设谓词的选择性。假设谓词的选择性用于预测原始查询的选择性。

33. 发明授权

US07392266B2 Apparatus and method for monitoring usage of components in a database index 有权
标题翻译：用于监视数据库索引中组件使用的装置和方法
公开(公告)号：US07392266B2
公开(公告)日：2008-06-24
申请号：US11082924
申请日：2005-03-17
申请人： Eric Lawrence Barsness , John Matthew Santosuosso
发明人： Eric Lawrence Barsness , John Matthew Santosuosso
IPC分类号： G06F12/00 , G06F17/30
CPC分类号： G06F17/30336 , G06F17/30469 , G06F17/30474
摘要： Database indexes include multiple fields that are used to track how the components of the index are used. An index component monitoring mechanism tracks how the components of the index are used, and updates fields in the index accordingly. Such component-level statistics allow a query optimizer to make more intelligent decisions regarding when to build a new index and when to discard an index, and also provide information regarding which queries are using the index, the maintenance cost of the index, and the selectivity of the index when used to process a query.
摘要翻译：数据库索引包括用于跟踪索引的组件如何使用的多个字段。索引组件监视机制跟踪如何使用索引的组件，并相应地更新索引中的字段。这样的组件级统计信息允许查询优化器对何时构建新的索引以及何时丢弃索引做出更明智的决定，并且还提供关于哪些查询正在使用索引的信息，索引的维护成本和选择性的索引用于处理查询。

34. 发明申请

US20080091668A1 ABSTRACT QUERY PLAN 有权
标题翻译：摘要查询计划
公开(公告)号：US20080091668A1
公开(公告)日：2008-04-17
申请号：US11953935
申请日：2007-12-11
申请人： RICHARD DETTINGER , Daniel Kolz
发明人： RICHARD DETTINGER , Daniel Kolz
IPC分类号： G06F17/30
CPC分类号： G06F17/30436 , G06F17/30474 , G06F17/30545 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936
摘要： A method and apparatus, and article of manufacture are provided to process an abstract query of a database abstraction constructed over an underlying physical data storage mechanism. The database may comprise a single data source, or a federated source spanning multiple systems. Embodiments of the invention process an abstract query by generating an intermediate representation of the abstract query. In one embodiment, the intermediate representation comprises an abstract query plan. An abstract query plan includes a combination of elements from the data abstraction model and elements relating to the underlying physical data storage mechanism. Once generated, a back-end component may easily traverse the abstract query plan to generate an SQL statement (or other resolved query) corresponding to the abstract query. Further, once constructed, the abstract query plan provides a platform for many different optimizations that may be selected by a user or by the runtime component inspecting the abstract query plan prior to creating the resolved query.
摘要翻译：提供了一种方法和装置以及制造物品来处理在底层物理数据存储机构上构建的数据库抽象的抽象查询。数据库可以包括单个数据源或跨越多个系统的联合源。本发明的实施例通过生成抽象查询的中间表示来处理抽象查询。在一个实施例中，中间表示包括抽象查询计划。抽象查询计划包括来自数据抽象模型的元素和与底层物理数据存储机制相关的元素的组合。一旦生成，后端组件可以容易地遍历抽象查询计划以生成与抽象查询相对应的SQL语句（或其他已解析的查询）。此外，一旦构造，抽象查询计划为许多不同的优化提供了一个平台，可以由用户或运行时组件在创建解析的查询之前检查抽象查询计划来选择。

35. 发明申请

US20080059438A1 Method and Apparatus for Optimizing Queries in a Logically Partitioned Computer System 有权
公开(公告)号：US20080059438A1
公开(公告)日：2008-03-06
申请号：US11931900
申请日：2007-10-31
申请人： Paul Day , Robert Driesch , Randy Egan , Jeffrey Tenner
发明人： Paul Day , Robert Driesch , Randy Egan , Jeffrey Tenner
IPC分类号： G06F7/10
CPC分类号： G06F17/30445 , G06F17/30442 , G06F17/30474 , Y10S707/99932 , Y10S707/99933
摘要： A database query optimizer for a computer system having dynamically configurable logical partitions generates an optimized query strategy which is dependent on a logical partition configuration. When the query is executed, the configuration of the logical partition in which the query is executed is compared to the logical partition configuration for which the query was optimized. If the configurations are different, a new query can be automatically generated. Optimizing database queries to the current system configuration of a dynamic, logically partitioned system potentially offers greater efficiency in the execution of database queries for complex, logically partitioned systems.

36. 发明申请

US20070282794A1 Dynamically Selecting Alternative Query Access Plans 失效
标题翻译：动态选择替代查询访问计划
公开(公告)号：US20070282794A1
公开(公告)日：2007-12-06
申请号：US11839926
申请日：2007-08-16
申请人： Eric Barsness , Mahdad Majd , Randy Ruhlow , John Santosuosso
发明人： Eric Barsness , Mahdad Majd , Randy Ruhlow , John Santosuosso
IPC分类号： G06F7/00
CPC分类号： G06F17/30474 , G06F17/30445 , G06F17/30545
摘要： A query access plan for executing a database query is dynamically selected from among multiple alternative query access plans based on the availability of computer resources allocated for running the query. Preferably, a first query access plan is generated based on resources then available, and if it is possible to provide additional resources, one or more alternative plans are generated based on the additional resources. If an alternative plan is significantly better than the original plan based on a comparison of query related parameters, the alternative is chosen for executing the query. Additional resources for running the query may be provided from logically partitioned and/or grid environments.
摘要翻译：基于分配用于运行查询的计算机资源的可用性，从多个备选查询访问计划中动态地选择用于执行数据库查询的查询访问计划。优选地，基于随后可用的资源来生成第一查询访问计划，并且如果可以提供附加资源，则基于附加资源生成一个或多个备选计划。如果基于查询相关参数的比较，替代计划明显优于原始计划，则选择替代方案来执行查询。可以从逻辑分区和/或网格环境提供用于运行查询的其他资源。

37. 发明申请

US20060106777A1 Method and apparatus for predicting selectivity of database query join conditions using hypothetical query predicates having skewed value constants 有权
公开(公告)号：US20060106777A1
公开(公告)日：2006-05-18
申请号：US10992400
申请日：2004-11-18
申请人： Michael Faunce , Shantan Kethireddy , Brian Muras
发明人： Michael Faunce , Shantan Kethireddy , Brian Muras
IPC分类号： G06F17/30
CPC分类号： G06F17/30469 , G06F17/30474 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99942 , Y10S707/99943 , Y10S707/99945
摘要： A database management system predicts a selectivity for database query conditions requiring a join of records from different tables. The system identifies at least one skewed value in a field specified in the join condition, and constructs, for each skewed value, a set of hypothetical query predicates in which the field specified in the join condition is replaced with a constant equal to the skewed value. The system then predicts the selectivity for the hypothetical predicates, using any appropriate prediction technique. The selectivities of the hypothetical predicates are used to predict a selectivity for the original query.

38. 发明申请

US20060074874A1 Method and apparatus for re-evaluating execution strategy for a database query 失效
标题翻译：重新评估数据库查询执行策略的方法和装置
公开(公告)号：US20060074874A1
公开(公告)日：2006-04-06
申请号：US10955737
申请日：2004-09-30
申请人： Paul Day , Lee Jameson , Roger Mittelstadt , Brian Muras
发明人： Paul Day , Lee Jameson , Roger Mittelstadt , Brian Muras
IPC分类号： G06F17/30
CPC分类号： G06F17/30463 , G06F17/30471 , G06F17/30474
摘要： A query facility for database queries saves and re-uses query execution strategies, and automatically detects that a strategy should be re-optimized as a result of changes to an indexed variable value. Preferably, the number of records evaluated and selected by the index value condition is dynamically monitored during execution, and an alternative query strategy is initiated when this number appears to be out of proportion to expectations. In an exemplary embodiment, an indexed search strategy is changed to a table scan strategy (or vice versa) as a result of a change to the number of records eliminated by the indexed value, although other examples are possible. Preferably, the query engine initiates an alternative search strategy and concurrently continues to execute the original search strategy as separate threads. Search results are obtained from whichever thread completes first.
摘要翻译：用于数据库查询的查询功能保存并重新使用查询执行策略，并自动检测到由于对索引变量值的更改，策略应重新优化。优选地，在执行期间动态地监视由索引值条件评估和选择的记录的数量，并且当该数量看起来与期望不成比例时，开始替代查询策略。在示例性实施例中，作为由索引值消除的记录数的改变的结果，索引的搜索策略被改变为表扫描策略（或反之亦然），尽管其他示例是可能的。优选地，查询引擎发起替代搜索策略并且同时继续执行原始搜索策略作为单独的线程。搜索结果从无论哪个线程首先完成。

39. 发明申请

US20050120000A1 Auto-tuning SQL statements 有权
标题翻译：自动调整SQL语句
公开(公告)号：US20050120000A1
公开(公告)日：2005-06-02
申请号：US10935908
申请日：2004-09-07
申请人： Mohamed Ziauddin , Benoit Dageville , Mohamed Zait , Dinesh Das
发明人： Mohamed Ziauddin , Benoit Dageville , Mohamed Zait , Dinesh Das
IPC分类号： G06F7/00 , G06F17/00 , G06F17/30
CPC分类号： G06F17/30474 , G06F17/30306 , Y10S707/99932 , Y10S707/99934 , Y10S707/99944
摘要： Auto-tuning can be performed by receiving a database query language statement and performance information related to the statement, determining whether one or more performance statistics of the statement are available or missing in the performance information, and determining an auto-tuning hint for each missing statistic.
摘要翻译：可以通过接收与该语句相关的数据库查询语言语句和性能信息来确定语句的一个或多个性能统计信息是否在性能信息中可用或丢失来执行自动调整，以及确定每个缺失的自动调整提示统计。

40. 发明申请

US20030208484A1 Dynamic optimization of multi-feature queries 有权
标题翻译：多功能查询的动态优化
公开(公告)号：US20030208484A1
公开(公告)日：2003-11-06
申请号：US10137032
申请日：2002-05-01
申请人： International Business Machines Corporation
发明人： Yuan-Chi Chang , Christian Alexander Lang , John Richard Smith
IPC分类号： G06F017/30
CPC分类号： G06F17/30463 , G06F17/30474 , G06F17/30516 , Y10S707/99931 , Y10S707/99932 , Y10S707/99945
摘要： The present invention provides an elegant solution for processing multi-feature queries, which considers the differing access costs associated with each feature. Access cost is a critical factor in determining how individual features should be processed in terms of retrieving through sorted or random access, and, hence, in minimizing the overall query response time. The present invention operates dynamically during query processing and seeks to minimize the total query cost in terms of number of features retrieved and cost for access. It works by evaluating different combinations of feature access plans (sorted and random access) according to the number of retrieved features and forward access costs, and it selects the lowest cost plan. Experimental results on practical data show a significant speed-up in multi-features queries using the proposed solution.
摘要翻译：本发明提供了一种用于处理多特征查询的优雅解决方案，其考虑与每个特征相关联的不同的访问费用。访问成本是确定如何处理通过分类或随机访问检索方面的个别特征的关键因素，因此在最小化整体查询响应时间方面。本发明在查询处理期间动态地操作，并且寻求在检索的特征数量和访问成本方面使总查询成本最小化。它通过根据检索到的特征数量和转发访问成本来评估特征访问计划（排序和随机访问）的不同组合，并且选择最低成本计划。实际数据的实验结果表明，使用提出的解决方案，在多功能查询中显着加快。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式