-
公开(公告)号：US20130041887A1
公开(公告)日：2013-02-14
申请号：US13207954
申请日：2011-08-11
IPC分类号： G06F17/30
CPC分类号： G06F17/30312
摘要： In an embodiment, a threshold value is calculated for a current entry in a first column of an index. If the current entry has been read a number of times by execution of an execution plan that is more than the threshold value and the current entry points to at least one row in a table and not all of the at least one row have been selected by the execution plan for inclusion in a result set as satisfying a query that the execution plan implements, then a new entry is added to the index.
摘要翻译： 在一个实施例中，针对索引的第一列中的当前条目计算阈值。 如果通过执行超过阈值的执行计划已经读取当前条目多次，并且当前条目指向表中的至少一行，并且并非所有至少一行都已被 包含在结果集中以满足执行计划实现的查询的执行计划，然后将新条目添加到索引。
-
2.发明申请DISAPPEARING INDEX FOR MORE EFFICIENT PROCESSING OF A DATABASE QUERY 有权DISAPPEARING INDEX用于更有效地处理数据库查询公开(公告)号：US20120124056A1
公开(公告)日：2012-05-17
申请号：US12944505
申请日：2010-11-11
IPC分类号： G06F17/30
CPC分类号： G06F17/30946 , G06F17/3033 , G06F17/30442
摘要： A disappearing index allows faster processing of a database query without the startup time of a prior art sparse index. The disappearing index starts as a full index but is trimmed of index values that point to a row in the table that is not selected by the query. Thus the traditional index disappears as it becomes a sparse index tailored to the query. The query is able to execute faster using the now sparse index since the target database table is not accessed for duplicate values in the base table of the query. The query optimizer may determine to use a disappearing index based on estimates of the number of duplicate values in the base table. When the query is complete, the created disappearing table may be discarded or used for other queries that match the selection of the query that created the disappearing index.
摘要翻译： 消失的索引允许在没有现有技术稀疏索引的启动时间的情况下更快地处理数据库查询。 消失的索引以完整索引开头，但修剪为指向表中未被查询选择的行的索引值。 因此，传统索引随着它成为针对查询量身定制的稀疏索引而消失。 由于查询的基表中的重复值不访问目标数据库表，因此查询能够使用现在的稀疏索引执行更快。 查询优化器可以基于基表中的重复值的估计来确定使用消失的索引。 当查询完成时，创建的消失表可能会被丢弃或用于与创建消失索引的查询的选择相匹配的其他查询。
-
公开(公告)号：US08396858B2
公开(公告)日：2013-03-12
申请号：US13207954
申请日：2011-08-11
IPC分类号： G06F17/30
CPC分类号： G06F17/30312
摘要： In an embodiment, a threshold value is calculated for a current entry in a first column of an index. If the current entry has been read a number of times by execution of an execution plan that is more than the threshold value and the current entry points to at least one row in a table and not all of the at least one row have been selected by the execution plan for inclusion in a result set as satisfying a query that the execution plan implements, then a new entry is added to the index.
摘要翻译： 在一个实施例中，针对索引的第一列中的当前条目计算阈值。 如果通过执行超过阈值的执行计划已经读取当前条目多次，并且当前条目指向表中的至少一行，并且并非所有至少一行都已被 包含在结果集中以满足执行计划实现的查询的执行计划，然后将新条目添加到索引。
-
公开(公告)号：US08977601B2
公开(公告)日：2015-03-10
申请号：US12944505
申请日：2010-11-11
IPC分类号： G06F17/30
CPC分类号： G06F17/30946 , G06F17/3033 , G06F17/30442
摘要： A disappearing index allows faster processing of a database query without the startup time of a prior art sparse index. The disappearing index starts as a full index but is trimmed of index values that point to a row in the table that is not selected by the query. Thus the traditional index disappears as it becomes a sparse index tailored to the query. The query is able to execute faster using the now sparse index since the target database table is not accessed for duplicate values in the base table of the query. The query optimizer may determine to use a disappearing index based on estimates of the number of duplicate values in the base table. When the query is complete, the created disappearing table may be discarded or used for other queries that match the selection of the query that created the disappearing index.
摘要翻译： 消失的索引允许在没有现有技术稀疏索引的启动时间的情况下更快地处理数据库查询。 消失的索引以完整索引开头，但修剪为指向表中未被查询选择的行的索引值。 因此，传统索引随着它成为针对查询量身定制的稀疏索引而消失。 由于查询的基表中的重复值不访问目标数据库表，因此查询能够使用现在的稀疏索引执行更快。 查询优化器可以基于基表中的重复值的估计来确定使用消失的索引。 当查询完成时，创建的消失表可能会被丢弃或用于与创建消失索引的查询的选择相匹配的其他查询。
-
公开(公告)号：US08290936B2
公开(公告)日：2012-10-16
申请号：US12857873
申请日：2010-08-17
CPC分类号： G06F17/30463
摘要： In an embodiment, a FIRSTIO execution plan is selected that has a lowest estimated execution time for finding a number of records that satisfy the query and are simultaneously viewable. An ALLIO execution plan is selected that has a lowest estimated execution time for finding all records that satisfy the query. The FIRSTIO execution plan is executed for a first time period to create a FIRSTIO result set. The ALLIO execution plan is executed for a second time period to create an ALLIO result set. The FIRSTIO result set is displayed if the FIRSTIO result set comprises more records than the ALLIO result set. The ALLIO result set is displayed if the ALLIO result set comprises more records than the FIRSTIO result set. In an embodiment, the first and second time periods expire in response to the expiration of a maximum time specified by the query.
摘要翻译： 在一个实施例中，选择具有最低估计执行时间的FIRSTIO执行计划，用于查找满足查询并且可同时查看的多个记录。 选择一个ALLIO执行计划，其具有最低的估计执行时间，用于查找满足查询的所有记录。 执行FIRSTIO执行计划第一个时间段以创建FIRSTIO结果集。 ALLIO执行计划在第二个时间段内执行，以创建一个ALLIO结果集。 如果FIRSTIO结果集包含比ALLIO结果集更多的记录，则显示FIRSTIO结果集。 如果ALLIO结果集包含比FIRSTIO结果集更多的记录，则显示ALLIO结果集。 在一个实施例中，响应于由查询指定的最大时间的到期，第一和第二时间段到期。
-
公开(公告)号：US20120047125A1
公开(公告)日：2012-02-23
申请号：US12857873
申请日：2010-08-17
IPC分类号： G06F17/30
CPC分类号： G06F17/30463
摘要： In an embodiment, a FIRSTIO execution plan is selected that has a lowest estimated execution time for finding a number of records that satisfy the query and are simultaneously viewable. An ALLIO execution plan is selected that has a lowest estimated execution time for finding all records that satisfy the query. The FIRSTIO execution plan is executed for a first time period to create a FIRSTIO result set. The ALLIO execution plan is executed for a second time period to create an ALLIO result set. The FIRSTIO result set is displayed if the FIRSTIO result set comprises more records than the ALLIO result set. The ALLIO result set is displayed if the ALLIO result set comprises more records than the FIRSTIO result set. In an embodiment, the first and second time periods expire in response to the expiration of a maximum time specified by the query.
摘要翻译： 在一个实施例中，选择具有最低估计执行时间的FIRSTIO执行计划，用于查找满足查询并且可同时查看的多个记录。 选择一个ALLIO执行计划，其具有最低的估计执行时间，用于查找满足查询的所有记录。 执行FIRSTIO执行计划第一个时间段以创建FIRSTIO结果集。 ALLIO执行计划在第二个时间段内执行，以创建一个ALLIO结果集。 如果FIRSTIO结果集包含比ALLIO结果集更多的记录，则显示FIRSTIO结果集。 如果ALLIO结果集包含比FIRSTIO结果集更多的记录，则显示ALLIO结果集。 在一个实施例中，响应于由查询指定的最大时间的到期，第一和第二时间段到期。
-
公开(公告)号：US08473484B2
公开(公告)日：2013-06-25
申请号：US13150578
申请日：2011-06-01
IPC分类号： G06F17/30
CPC分类号： G06F17/30463 , G06F17/30595
摘要： Techniques are disclosed for identifying impact of a patch. One embodiment of the invention provides a DBMS that is configured to manage one or more databases. The DBMS may receive a request to evaluate a patch for the DBMS. The DBMS provides a first execution environment that is not based on the patch and a second execution environment that is based on the patch. For each query, the DBMS compares a first access plan with a second access plan, where the first access plan is generated from the first execution environment and the second access plan is generated from the second execution environment. The DBMS identifies one or more queries having differing access plans, based on the comparisons.
摘要翻译： 公开了用于识别贴片的影响的技术。 本发明的一个实施例提供了被配置为管理一个或多个数据库的DBMS。 DBMS可能会收到一个评估DBMS补丁的请求。 DBMS提供了不基于补丁的第一个执行环境和基于补丁的第二个执行环境。 对于每个查询，DBMS将第一访问计划与第二访问计划进行比较，其中从第一执行环境生成第一访问计划，并且从第二执行环境生成第二访问计划。 基于比较，DBMS识别具有不同访问计划的一个或多个查询。
-
8.发明授权Determining a density of a key value referenced in a database query over a range of rows 失效确定数据库查询在一系列行上引用的密钥值的密度公开(公告)号：US08396861B2
公开(公告)日：2013-03-12
申请号：US13591935
申请日：2012-08-22
申请人： Paul R. Day , Randy L. Egan , Roger A. Mittelstadt
发明人： Paul R. Day , Randy L. Egan , Roger A. Mittelstadt
IPC分类号： G06F7/00
CPC分类号： G06F17/30442
摘要： A method, apparatus and program product that determine a density of a key value referenced in a database query over at least one range of rows, and utilize the determined density to optimize the database query. By doing so, the density of various key values may be determined and compared, and a bit map may be generated over the range of rows of the key value that is denser, resulting in a reduction of resources to build and use the bit map. Moreover, from the bit map over the range of rows to be selected after using the determined density, dense regions may be identified that can be used to optimize block I/O's according to the number of rows to be selected based on the query.
摘要翻译： 一种方法，装置和程序产品，其通过至少一行行确定数据库查询中引用的密钥值的密度，并利用确定的密度来优化数据库查询。 通过这样做，可以确定和比较各种键值的密度，并且可以在密度较大的键值的行的范围上生成位图，导致减少构建和使用位图的资源。 此外，从使用确定的密度之后要选择的行的范围上的位图中，可以识别出可以根据要根据查询选择的行数来优化块I / O的密集区域。
-
公开(公告)号：US20120290588A1
公开(公告)日：2012-11-15
申请号：US13105536
申请日：2011-05-11
IPC分类号： G06F17/30
CPC分类号： G06F17/30339
摘要： Techniques are disclosed for reorganizing rows of a database table. In one embodiment, each row is associated with a respective row identifier. A mapping is provided that assigns a logical identifier to each row identifier. Each database index on the database table is configured to use the logical identifier rather than the row identifier. Accordingly, the rows of the database table may be reorganized without having to modify any database index on the database table.
摘要翻译： 公开了重新组织数据库表的行的技术。 在一个实施例中，每行与相应的行标识符相关联。 提供了一个映射，为每个行标识符分配逻辑标识符。 数据库表上的每个数据库索引都配置为使用逻辑标识符而不是行标识符。 因此，可以重新组织数据库表的行，而不必修改数据库表上的任何数据库索引。
-
公开(公告)号：US20120023092A1
公开(公告)日：2012-01-26
申请号：US12843418
申请日：2010-07-26
IPC分类号： G06F17/30
CPC分类号： G06F17/30457 , G06F17/30463 , G06F17/3048
摘要： Systems, methods and computer program products are disclosed for managing a database cache. In one embodiment, access to a data object stored in a database is monitored. A memory residency priority for the data object is determined, based on the access patterns. Further, an access plan is determined for a query, based on the memory residency priority. Access to the data object is also monitored when the access plan is executed, thereby providing a feedback loop between determining memory residency priorities and determining query access plans.
摘要翻译： 公开了用于管理数据库高速缓存的系统，方法和计算机程序产品。 在一个实施例中，监视对存储在数据库中的数据对象的访问。 基于访问模式确定数据对象的存储器驻留优先级。 此外，基于存储器驻留优先级来确定查询的访问计划。 当执行访问计划时，还监视对数据对象的访问，从而在确定存储器驻留优先级和确定查询访问计划之间提供反馈循环。
-
-
-
-
-
-
-
-
-
搜索结果
33 条记录 (耗时 0.026 秒)
