-
公开(公告)号：US09218394B2
公开(公告)日：2015-12-22
申请号：US12907157
申请日：2010-10-19
IPC分类号： G06F17/30
CPC分类号： G06F17/30501 , G06F17/30902
摘要： In an embodiment, a first plurality of rows of a first table are read from memory in an order of page addresses of pages in the memory that comprise the first plurality of rows. First selected rows from the first plurality of rows that meet a query predicate are stored into a result set. After the reading the first plurality of rows in the order of the page addresses, a second plurality of rows of the first table are read from secondary storage, in an order of row identifiers of the second plurality of the rows in the first table. Second selected rows from the second plurality of rows that meet the query predicate are stored into the result set.
摘要翻译： 在一个实施例中，以存储器中构成第一多行的页面的页面地址的顺序从存储器读取第一表的第一多行。 来自满足查询谓词的第一个多行的第一个选定行被存储到结果集中。 在以页面地址的顺序读取第一多行后，按照第一表中的第二行的行标识符的次序从副存储器读取第一表的第二多行。 来自满足查询谓词的第二个多行的第二个选定的行被存储到结果集中。
-
公开(公告)号：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.
摘要翻译： 消失的索引允许在没有现有技术稀疏索引的启动时间的情况下更快地处理数据库查询。 消失的索引以完整索引开头，但修剪为指向表中未被查询选择的行的索引值。 因此，传统索引随着它成为针对查询量身定制的稀疏索引而消失。 由于查询的基表中的重复值不访问目标数据库表，因此查询能够使用现在的稀疏索引执行更快。 查询优化器可以基于基表中的重复值的估计来确定使用消失的索引。 当查询完成时，创建的消失表可能会被丢弃或用于与创建消失索引的查询的选择相匹配的其他查询。
-
公开(公告)号：US08601474B2
公开(公告)日：2013-12-03
申请号：US13273779
申请日：2011-10-14
IPC分类号： G06F9/455
CPC分类号： G06F9/455 , G06F9/45558 , G06F9/5077 , G06F17/30477 , G06F17/30519 , G06F2009/4557
摘要： In an embodiment, a query implemented by a first execution plan is executed at a first virtual machine. In response to a move command that requests a move of the first virtual machine from a first computer to a second computer while the first virtual machine is executing the query implemented by the first execution plan at the first computer, an attribute of a resource used by the executing at the first virtual machine is saved to memory at the first computer and a driver source used by the executing at the first virtual machine is saved to the memory at the first computer. In response to a command that requests starting a second virtual machine at the second computer, a determination is made whether the driver source that comprises the state of the partial execution of the first execution plan exists in memory of the second computer.
摘要翻译： 在一个实施例中，由第一执行计划实现的查询在第一虚拟机处执行。 响应于在所述第一虚拟机正在执行由所述第一计算机上的所述第一执行计划执行的所述查询的请求时将所述第一虚拟机从第一计算机移动到第二计算机的移动命令，由所述第一计算机使用的资源的属性 在第一计算机处将执行的第一虚拟机保存到存储器，并且由第一虚拟机执行的驱动源被保存在第一计算机的存储器中。 响应于在第二计算机请求启动第二虚拟机的命令，确定包括第一执行计划的部分执行状态的驱动程序源是否存在于第二计算机的存储器中。
-
4.发明申请DETERMINING A DENSITY OF A KEY VALUE REFERENCED IN A DATABASE QUERY OVER A RANGE OF ROWS 失效确定数据库中引用的关键值的密度查询范围公开(公告)号：US20120317095A1
公开(公告)日：2012-12-13
申请号：US13591935
申请日：2012-08-22
申请人： Paul R. Day , Randy L. Egan , Roger A. Mittelstadt
发明人： Paul R. Day , Randy L. Egan , Roger A. Mittelstadt
IPC分类号： G06F17/30
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的密集区域。
-
公开(公告)号：US20120310921A1
公开(公告)日：2012-12-06
申请号：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识别具有不同访问计划的一个或多个查询。
-
公开(公告)号：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结果集。 在一个实施例中，响应于由查询指定的最大时间的到期，第一和第二时间段到期。
-
7.发明申请公开(公告)号：US20120096054A1
公开(公告)日：2012-04-19
申请号：US12907157
申请日：2010-10-19
CPC分类号： G06F17/30501 , G06F17/30902
摘要： In an embodiment, a first plurality of rows of a first table are read from memory in an order of page addresses of pages in the memory that comprise the first plurality of rows. First selected rows from the first plurality of rows that meet a query predicate are stored into a result set. After the reading the first plurality of rows in the order of the page addresses, a second plurality of rows of the first table are read from secondary storage, in an order of row identifiers of the second plurality of the rows in the first table. Second selected rows from the second plurality of rows that meet the query predicate are stored into the result set.
摘要翻译： 在一个实施例中，以存储器中构成第一多行的页面的页面地址的顺序从存储器读取第一表的第一多行。 来自满足查询谓词的第一个多行的第一个选定行被存储到结果集中。 在以页面地址的顺序读取第一多行后，按照第一表中的第二行的行标识符的次序从副存储器读取第一表的第二多行。 来自满足查询谓词的第二个多行的第二个选定的行被存储到结果集中。
-
公开(公告)号：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结果集。 在一个实施例中，响应于由查询指定的最大时间的到期，第一和第二时间段到期。
-
公开(公告)号：US20100257153A1
公开(公告)日：2010-10-07
申请号：US12419039
申请日：2009-04-06
IPC分类号： G06F17/30
CPC分类号： G06F17/30442
摘要： A method, apparatus, and program product is provided to, in response to receiving a first database query for which usage of shared weight indices is prohibited, determine whether a shared weight index associated with a column of a database table referenced by the first database query can be utilized as a non-shared weight index to optimize the database query. The method, apparatus, and program product determine whether the column includes at least one changed weight value and determines whether the database query references at least one changed weight value in the column. The shared weight index is utilized to optimize the first database query in response to determining that the shared weight index can be utilized as a non-shared weight index to optimize the first database query.
摘要翻译： 提供了一种方法，装置和程序产品，用于响应于接收到第一数据库查询，对于共享权重索引的哪个使用被禁止，确定与由第一数据库查询引用的数据库表的列相关联的共享权重索引 可以用作非共享权重索引来优化数据库查询。 方法，装置和程序产品确定列是否包括至少一个改变的权重值，并确定数据库查询是否引用该列中至少一个改变的权重值。 响应于确定共享权重索引可以用作非共享权重索引来优化第一数据库查询，共享权重索引用于优化第一数据库查询。
-
公开(公告)号：US20130304723A1
公开(公告)日：2013-11-14
申请号：US13469317
申请日：2012-05-11
IPC分类号： G06F17/30
CPC分类号： G06F17/30501 , G06F17/30289 , G06F17/30463 , G06F17/3048 , G06F17/30483
摘要： In an embodiment, a query plan is compressed to data in a cache at a high compression level if a runtime of a query that the query plan implements is greater than a high time threshold. The query plan is compressed to the data in the cache at a medium compression level if the runtime of the query that the query plan implements is less than the high time threshold and greater than a low time threshold. The query plan is stored to the data in the cache at an uncompressed level if the runtime of the query that the query plan implements is less than the low time threshold.
摘要翻译： 在一个实施例中，如果查询计划实现的查询的运行时间大于高时间阈值，则在高压缩级别将查询计划压缩到高速缓存中的数据。 如果查询计划实现的查询的运行时间小于高时间阈值且大于低时间阈值，则查询计划将以中等压缩级别压缩到缓存中的数据。 如果查询计划实现的查询的运行时间小于低时间阈值，则查询计划将以未压缩级别存储在缓存中的数据中。
-
-
-
-
-
-
-
-
-
搜索结果
37 条记录 (耗时 0.028 秒)
