会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Multi-tiered query processing techniques for minus and intersect operators
    • 负和相交运算符的多层查询处理技术
    • US20070073643A1
    • 2007-03-29
    • US11237040
    • 2005-09-27
    • Bhaskar GhoshRafi AhmedHermann Baer
    • Bhaskar GhoshRafi AhmedHermann Baer
    • G06F17/30
    • G06F17/30463G06F17/30489G06F17/30498
    • Various techniques are described for processing database commands that include MINUS and/or INTERSECT operators. The queries containing the MINUS and/or INTERSECT operators are transformed to create a plurality of transformed queries. Each of the transformed queries produces the same result as the original query, but does not include the MINUS and/or INTERSECT operator. To achieve the same result set as the original query, the transformed queries employ equijoins, antijoins, and/or semijoins, and duplicate elimination operations. Costs are estimated for each of the various transformed queries. Based on the cost estimates, one of the transformed queries is selected as the query that is to be executed to perform the operations specified in the original query.
    • 描述了用于处理包括MINUS和/或INTERSECT操作符的数据库命令的各种技术。 包含MINUS和/或INTERSECT运算符的查询被转换以创建多个变换查询。 每个变换的查询产生与原始查询相同的结果,但不包括MINUS和/或INTERSECT操作符。 为了实现与原始查询相同的结果集,转换的查询使用等价,反连接和/或半挂号,并重复消除操作。 对于各种转换查询,估计成本。 根据成本估算,选择一个变换查询作为要执行的查询,以执行原始查询中指定的操作。
    • 2. 发明授权
    • Multi-tiered query processing techniques for minus and intersect operators
    • 负和相交运算符的多层查询处理技术
    • US07814091B2
    • 2010-10-12
    • US11237040
    • 2005-09-27
    • Bhaskar GhoshRafi AhmedHermann Baer
    • Bhaskar GhoshRafi AhmedHermann Baer
    • G06F7/00G06F17/30
    • G06F17/30463G06F17/30489G06F17/30498
    • Various techniques are described for processing database commands that include MINUS and/or INTERSECT operators. The queries containing the MINUS and/or INTERSECT operators are transformed to create a plurality of transformed queries. Each of the transformed queries produces the same result as the original query, but does not include the MINUS and/or INTERSECT operator. To achieve the same result set as the original query, the transformed queries employ equijoins, antijoins, and/or semijoins, and duplicate elimination operations. Costs are estimated for each of the various transformed queries. Based on the cost estimates, one of the transformed queries is selected as the query that is to be executed to perform the operations specified in the original query.
    • 描述了用于处理包括MINUS和/或INTERSECT操作符的数据库命令的各种技术。 包含MINUS和/或INTERSECT运算符的查询被转换以创建多个变换查询。 每个变换的查询产生与原始查询相同的结果,但不包括MINUS和/或INTERSECT操作符。 为了实现与原始查询相同的结果集,转换的查询使用等价,反连接和/或半挂号,并重复消除操作。 对于各种转换查询,估计成本。 根据成本估算,选择一个变换查询作为要执行的查询,以执行原始查询中指定的操作。
    • 3. 发明申请
    • Parallel query processing techniques for minus and intersect operators
    • 负和相交运算符的并行查询处理技术
    • US20070073642A1
    • 2007-03-29
    • US11237039
    • 2005-09-27
    • Bhaskar GhoshRafi AhmedHermann Baer
    • Bhaskar GhoshRafi AhmedHermann Baer
    • G06F17/30
    • G06F17/30498G06F17/30463G06F17/30489Y10S707/99931Y10S707/99932Y10S707/99933Y10S707/99934Y10S707/99935
    • Various techniques are described for processing database commands that include MINUS and/or INTERSECT operators. According to one technique, the database server executes the MINUS/INTERSECT in a specialized rowsource in parallel. In one approach, the specialized rowsource implements a sort merge-join like solution, where: a DISTINCT SORT is performed on each input, a left and right pointer is maintained on the respective input streams of tuples, the left or right pointer is incremented based on whether there is a match between the tuples pointed-to by the pointers, and the tuple of the left side is returned (or not returned) based on whether there is a match. Techniques are described for generating multiple query plans for executing a query, where each of the query plans includes a plan portion for executing, in parallel, the operation associated with a MINUS/INTERSECT operator. Cost estimates are generated for the query plans. The database server selects from the query plans a particular query plan to execute based, at least in part, on the cost estimates.
    • 描述了用于处理包括MINUS和/或INTERSECT操作符的数据库命令的各种技术。 根据一种技术,数据库服务器并行地在专门的行源中执行MINUS / INTERSECT。 在一种方法中,专门的行源实现了一个排序合并连接,如解决方案,其中:对每个输入执行DISTINCT SORT,左和右指针保持在元组的相应输入流上,左或右指针基于 关于指针指向的元组是否存在匹配,并且基于是否存在匹配而返回(或不返回)的元组。 描述了用于生成用于执行查询的多个查询计划的技术,其中每个查询计划包括用于并行执行与MINUS / INTERSECT运算符相关联的操作的计划部分。 为查询计划生成成本估算值。 数据库服务器从查询计划中选择特定的查询计划,至少部分地基于成本估算来执行。
    • 4. 发明授权
    • Parallel query processing techniques for minus and intersect operators
    • 负和相交运算符的并行查询处理技术
    • US07617189B2
    • 2009-11-10
    • US11237039
    • 2005-09-27
    • Bhaskar GhoshRafi AhmedHermann Baer
    • Bhaskar GhoshRafi AhmedHermann Baer
    • G06F7/00G06F17/30
    • G06F17/30498G06F17/30463G06F17/30489Y10S707/99931Y10S707/99932Y10S707/99933Y10S707/99934Y10S707/99935
    • Various techniques are described for processing database commands that include MINUS and/or INTERSECT operators. According to one technique, the database server executes the MINUS/INTERSECT in a specialized rowsource in parallel. In one approach, the specialized rowsource implements a sort merge-join like solution, where: a DISTINCT SORT is performed on each input, a left and right pointer is maintained on the respective input streams of tuples, the left or right pointer is incremented based on whether there is a match between the tuples pointed-to by the pointers, and the tuple of the left side is returned (or not returned) based on whether there is a match. Techniques are described for generating multiple query plans for executing a query, where each of the query plans includes a plan portion for executing, in parallel, the operation associated with a MINUS/INTERSECT operator. Cost estimates are generated for the query plans. The database server selects from the query plans a particular query plan to execute based, at least in part, on the cost estimates.
    • 描述了用于处理包括MINUS和/或INTERSECT操作符的数据库命令的各种技术。 根据一种技术,数据库服务器并行地在专门的行源中执行MINUS / INTERSECT。 在一种方法中,专门的行源实现了一个排序合并连接,如解决方案,其中:对每个输入执行DISTINCT SORT,左和右指针保持在元组的相应输入流上,左或右指针基于 关于指针指向的元组是否存在匹配,并且基于是否存在匹配而返回(或不返回)的元组。 描述了用于生成用于执行查询的多个查询计划的技术,其中每个查询计划包括用于并行执行与MINUS / INTERSECT运算符相关联的操作的计划部分。 为查询计划生成成本估算值。 数据库服务器从查询计划中选择特定的查询计划,至少部分地基于成本估计执行。
    • 5. 发明授权
    • Delaying evaluation of expensive expressions in a query
    • 在查询中延迟评估昂贵的表达式
    • US07877379B2
    • 2011-01-25
    • US11242361
    • 2005-09-30
    • Allison WaingoldRafi AhmedBhaskar GhoshDinesh DasMohamed Zait
    • Allison WaingoldRafi AhmedBhaskar GhoshDinesh DasMohamed Zait
    • G06F7/00
    • G06F17/30463Y10S707/99932
    • Techniques are provided for delaying evaluation of expensive expressions in a query. Expensive expressions in the query are established by cost information or by looking up a list of known expensive expressions for a match. After an execution plan is determined by using the early evaluation technique, one or more equivalent execution plans is established. The one or more equivalent execution plans may include both a type of execution plans that delay evaluation of expensive expressions and a type of execution plans that do not. In addition, the one or more equivalent execution plans may include both parallelized and non-parallelized alternatives to the execution plan identified by the early evaluation technique. Finally, based on a set of criteria, which may include comparing cost information among all the equivalent execution plans generated thus far, the best execution plan is chosen for the query.
    • 提供了用于延迟查询中昂贵表达式的评估的技术。 查询中的昂贵表达式是通过成本信息建立的,或通过查找匹配的已知昂贵表达式的列表来确定。 在通过使用早期评估技术确定执行计划之后,建立一个或多个等效执行计划。 一个或多个等效执行计划可以包括延迟对昂贵表达式的评估的执行计划的类型以及不执行计划的类型。 此外,一个或多个等效执行计划可以包括由早期评估技术识别的执行计划的并行化和非并行化替代方案。 最后,基于一组标准,其中可能包括比较到目前为止生成的所有等效执行计划中的成本信息,为查询选择最佳执行计划。
    • 6. 发明申请
    • Delaying evaluation of expensive expressions in a query
    • 在查询中延迟评估昂贵的表达式
    • US20070078812A1
    • 2007-04-05
    • US11242361
    • 2005-09-30
    • Allison WaingoldRafi AhmedBhaskar GhoshDinesh DasMohamed Zait
    • Allison WaingoldRafi AhmedBhaskar GhoshDinesh DasMohamed Zait
    • G06F17/30
    • G06F17/30463Y10S707/99932
    • Techniques are provided for delaying evaluation of expensive expressions in a query. Expensive expressions in the query are established by cost information or by looking up a list of known expensive expressions for a match. After an execution plan is determined by using the early evaluation technique, one or more equivalent execution plans is established. The one or more equivalent execution plans may include both a type of execution plans that delay evaluation of expensive expressions and a type of execution plans that do not. In addition, the one or more equivalent execution plans may include both parallelized and non-parallelized alternatives to the execution plan identified by the early evaluation technique. Finally, based on a set of criteria, which may include comparing cost information among all the equivalent execution plans generated thus far, the best execution plan is chosen for the query.
    • 提供了用于延迟查询中昂贵表达式的评估的技术。 查询中的昂贵表达式是通过成本信息建立的,或通过查找匹配的已知昂贵表达式的列表来确定。 在通过使用早期评估技术确定执行计划之后,建立一个或多个等效执行计划。 一个或多个等效执行计划可以包括延迟对昂贵表达式的评估的执行计划的类型以及不执行计划的类型。 此外,一个或多个等效执行计划可以包括由早期评估技术识别的执行计划的并行化和非并行化替代方案。 最后,基于一组标准,其中可能包括比较到目前为止生成的所有等效执行计划中的成本信息,为查询选择最佳执行计划。
    • 9. 发明授权
    • Techniques for bushy tree execution plans for snowstorm schema
    • 用于暴雪模式的丛林执行计划的技术
    • US08438152B2
    • 2013-05-07
    • US11927324
    • 2007-10-29
    • Rafi Ahmed
    • Rafi Ahmed
    • G06F7/00G06F17/30
    • G06F17/30498
    • Methods for transforming a query to simulate a bushy tree execution plan for queries containing joins in series are provided. Left deep tree execution plans are supported by most relational database systems but are inefficient at processing queries directed to databases with snowstorm schema. A snowstorm schema contains several large fact tables and many smaller dimension tables, which make reference to one another. Bushy tree execution plans can be much more efficient for processing queries to snowstorm schema. The decision to choose between left-deep and bushy tree execution plans are based on the relative costs of the two execution plans. The methods provided transform queries which are otherwise executed with left deep tree execution plans into queries which are executed with simulated bushy tree execution plans.
    • 提供了用于转换查询以模拟包含串联连接的查询的丛树执行计划的方法。 左深树执行计划是大多数关系数据库系统支持的,但在处理针对具有暴风雪模式的数据库的查询时效率低下。 暴风雪模式包含几个大事实表和许多较小的维度表,这些表彼此引用。 布什树执行计划可以更有效地处理对暴风雪模式的查询。 选择左深和深树执行计划的决定是基于两个执行计划的相对成本。 所提供的方法转换了查询,否则这些查询将使用左深树执行计划执行到使用模拟丛林执行计划执行的查询中。