-
公开(公告)号：US08255387B2
公开(公告)日：2012-08-28
申请号：US12833670
申请日：2010-07-09
IPC分类号： G06F7/00
CPC分类号： G06F17/30321 , G06F17/30427
摘要： Technologies for forming logical indexes and utilizing such indexes so as to abstract many of the complexities resulting from referencing partitioned database tables. Included are technologies for making use of order-preserving properties of table metadata, for adding a partition equality predicate to an explicit predicate in merge-join processing on partitioned tables, and for selecting execution of a logical skip scan on a partitioned table when a query predicate does not reference a specific partition. Such technologies generally abstract from the query writer and processing systems explicit referencing of table partitions.
摘要翻译： 用于形成逻辑索引和利用这些索引的技术，以便抽象引用分区数据库表导致的许多复杂性。 包括使用表元数据的顺序保留属性的技术，用于在分区表中的合并连接处理中向显式谓词添加分区相等谓词，以及在查询时选择分区表上逻辑跳过扫描的执行 谓词不引用特定分区。 这些技术通常从查询写入程序和处理系统中抽象出来显式引用表分区。
-
公开(公告)号：US07792822B2
公开(公告)日：2010-09-07
申请号：US11735683
申请日：2007-04-16
IPC分类号： G06F7/00
CPC分类号： G06F17/30321 , G06F17/30427
摘要： Technologies for forming logical indexes and utilizing such indexes so as to abstract many of the complexities resulting from referencing partitioned database tables. Included are technologies for making use of order-preserving properties of table metadata, for adding a partition equality predicate to an explicit predicate in merge-join processing on partitioned tables, and for selecting execution of a logical skip scan on a partitioned table when a query predicate does not reference a specific partition. Such technologies generally abstract from the query writer and processing systems explicit referencing of table partitions.
摘要翻译： 用于形成逻辑索引和利用这些索引的技术，以便抽象引用分区数据库表导致的许多复杂性。 包括使用表元数据的顺序保留属性的技术，用于在分区表中的合并连接处理中向显式谓词添加分区相等谓词，以及在查询时选择分区表上逻辑跳过扫描的执行 谓词不引用特定分区。 这些技术通常从查询写入程序和处理系统中抽象出来显式引用表分区。
-
3.发明申请公开(公告)号：US20100274780A1
公开(公告)日：2010-10-28
申请号：US12833670
申请日：2010-07-09
IPC分类号： G06F17/30
CPC分类号： G06F17/30321 , G06F17/30427
摘要： Technologies for forming logical indexes and utilizing such indexes so as to abstract many of the complexities resulting from referencing partitioned database tables. Included are technologies for making use of order-preserving properties of table metadata, for adding a partition equality predicate to an explicit predicate in merge-join processing on partitioned tables, and for selecting execution of a logical skip scan on a partitioned table when a query predicate does not reference a specific partition. Such technologies generally abstract from the query writer and processing systems explicit referencing of table partitions.
摘要翻译： 用于形成逻辑索引和利用这些索引的技术，以便抽象引用分区数据库表导致的许多复杂性。 包括使用表元数据的顺序保留属性的技术，用于在分区表中的合并连接处理中向显式谓词添加分区相等谓词，以及在查询时选择分区表上逻辑跳过扫描的执行 谓词不引用特定分区。 这些技术通常从查询写入程序和处理系统中抽象出来显式引用表分区。
-
公开(公告)号：US20080215544A1
公开(公告)日：2008-09-04
申请号：US11735683
申请日：2007-04-16
IPC分类号： G06F17/30
CPC分类号： G06F17/30321 , G06F17/30427
摘要： Technologies for forming logical indexes and utilizing such indexes so as to abstract many of the complexities resulting from referencing partitioned database tables. Included are technologies for making use of order-preserving properties of table metadata, for adding a partition equality predicate to an explicit predicate in merge-join processing on partitioned tables, and for selecting execution of a logical skip scan on a partitioned table when a query predicate does not reference a specific partition. Such technologies generally abstract from the query writer and processing systems explicit referencing of table partitions.
摘要翻译： 用于形成逻辑索引和利用这些索引的技术，以便抽象引用分区数据库表导致的许多复杂性。 包括使用表元数据的顺序保留属性的技术，用于在分区表中的合并连接处理中向显式谓词添加分区相等谓词，以及在查询时选择分区表上逻辑跳过扫描的执行 谓词不引用特定分区。 这些技术通常从查询写入程序和处理系统中抽象出来显式引用表分区。
-
公开(公告)号：US07676525B2
公开(公告)日：2010-03-09
申请号：US11772495
申请日：2007-07-02
IPC分类号： G06F7/00
CPC分类号： G06F17/30365 , G06F17/30471
摘要： Disclosed are systems and methods for optimization and efficient processing of MERGE statements. MERGE allows performing a mix of inserts, updates, and deletes in a single statement, and introduces new challenges compared to legacy DML statements, where the kind of action to be performed is hard-coded and known at compile time. Such optimizations may include Halloween Protection detection for MERGE statements, optimized prevention of non-deterministic MERGE statements, in-place inserts for MERGE statements scanning the “Read Instance” of the target table, and optimized execution of MERGE statements seeking the “Read Instance” of the target table. Such optimizations may be fundamental in order to ensure proper performance and reliable processing times.
摘要翻译： 公开了用于优化和有效处理MERGE语句的系统和方法。 MERGE允许在单个语句中执行插入，更新和删除的混合，并且与传统DML语句相比引入新的挑战，其中要执行的操作类型在编译时被硬编码和已知。 这种优化可能包括MERGE语句的万圣节保护检测，非确定性MERGE语句的优化预防，扫描目标表的“读取实例”的MERGE语句的就地插入以及寻求“读取实例”的MERGE语句的优化执行 的目标表。 为了确保正确的性能和可靠的处理时间，这种优化可能是至关重要的。
-
公开(公告)号：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低效的方式执行。
-
公开(公告)号：US20090012980A1
公开(公告)日：2009-01-08
申请号：US11772495
申请日：2007-07-02
CPC分类号： G06F17/30365 , G06F17/30471
摘要： Disclosed are systems and methods for optimization and efficient processing of MERGE statements. MERGE allows performing a mix of inserts, updates, and deletes in a single statement, and introduces new challenges compared to legacy DML statements, where the kind of action to be performed is hard-coded and known at compile time. Such optimizations may include Halloween Protection detection for MERGE statements, optimized prevention of non-deterministic MERGE statements, in-place inserts for MERGE statements scanning the “Read Instance” of the target table, and optimized execution of MERGE statements seeking the “Read Instance” of the target table. Such optimizations may be fundamental in order to ensure proper performance and reliable processing times.
摘要翻译： 公开了用于优化和有效处理MERGE语句的系统和方法。 MERGE允许在单个语句中执行插入，更新和删除的混合，并且与传统DML语句相比引入新的挑战，其中要执行的操作类型在编译时被硬编码和已知。 这种优化可能包括MERGE语句的万圣节保护检测，非确定性MERGE语句的优化预防，扫描目标表的“读取实例”的MERGE语句的就地插入以及寻求“读取实例”的MERGE语句的优化执行 的目标表。 为了确保正确的性能和可靠的处理时间，这种优化可能是至关重要的。
-
公开(公告)号：US07472133B2
公开(公告)日：2008-12-30
申请号：US10909037
申请日：2004-07-30
申请人： Craig S. Freedman , Gang He , Goetz Graefe
发明人： Craig S. Freedman , Gang He , Goetz Graefe
IPC分类号： G06F17/00
CPC分类号： G06F17/30442 , Y10S707/99937 , Y10S707/99942 , Y10S707/99943 , Y10S707/99944 , Y10S707/99945 , Y10S707/99953
摘要： The present invention is directed to systems and methods for improved prefetching. The present invention reduces the processing time and associated costs of prefetching by incorporating a number of techniques for efficiently searching a node structure. Such techniques eliminate redundant traversal of nodes. Additionally, such techniques do not require locking the node structure to prevent concurrent updates. Furthermore, such techniques may exploit known key ordering information to optimize a search.
摘要翻译： 本发明涉及用于改进预取的系统和方法。 本发明通过并入多种用于有效搜索节点结构的技术来减少预取的处理时间和相关成本。 这种技术消除了节点的冗余遍历。 另外，这样的技术不需要锁定节点结构以防止并发更新。 此外，这样的技术可以利用已知的密钥排序信息来优化搜索。
-
-
-
-
-
-
-
搜索结果
8 条记录 (耗时 0.029 秒)
