会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • System and method for transforming queries using window aggregation
    • 使用窗口聚合转换查询的系统和方法
    • US07275056B2
    • 2007-09-25
    • US10425343
    • 2003-04-29
    • Qi ChengLinqi LiuWenbin MaMir Hamid PiraheshCalisto P. Zuzarte
    • Qi ChengLinqi LiuWenbin MaMir Hamid PiraheshCalisto P. Zuzarte
    • G06F7/00G06F17/30
    • G06F17/30451Y10S707/99934Y10S707/99935
    • A system and method transform queries with subqueries, using window aggregation. An optimizer in a relational database management system transforms queries to optimize their efficiency and speed. The method transforms queries that have a subquery, replacing the subquery with a window aggregation function. In the case of a correlated subquery, the window aggregation function is partitioned by a correlated column of a correlated table. All data in the main select clause, or outer block, of the query that was obtained through references to the correlated table is instead obtained through the new window aggregation subquery. By using window aggregation, the aggregation is performed at the same time as the selection of relevant data from the correlated table, thereby compiling all needed data in a single pass through the table or view. Reducing the number of times that tables or views are accessed reduces the computational demands of a query.
    • 系统和方法使用子查询转换查询,使用窗口聚合。 关系数据库管理系统中的优化器可以转换查询以优化其效率和速度。 该方法转换具有子查询的查询,使用窗口聚合函数替换子查询。 在相关子查询的情况下,窗口聚合函数由相关表的相关列划分。 通过引用相关表获得的查询的main select子句或外部块中的所有数据都是通过新的窗口聚合子查询得到的。 通过使用窗口聚合,在从相关表中选择相关数据的同时进行聚合,从而在通过表或视图的单次传递中编译所有需要的数据。 降低访问表或视图的次数减少了查询的计算需求。
    • 2. 发明授权
    • Method, system and program for executing a query having a union operator
    • 用于执行具有联合运算符的查询的方法,系统和程序
    • US07539667B2
    • 2009-05-26
    • US10982441
    • 2004-11-05
    • Bruce Gilbert LindsayLinqi LiuRobert Paul NeugebauerMir Hamid PiraheshDavid C. SharpeNattavut SutyanyongCalisto Paul Zuzarte
    • Bruce Gilbert LindsayLinqi LiuRobert Paul NeugebauerMir Hamid PiraheshDavid C. SharpeNattavut SutyanyongCalisto Paul Zuzarte
    • G06F17/30
    • G06F17/30454Y10S707/99932Y10S707/99933
    • Disclosed is a data processing system implemented method, a data processing system and an article of manufacture for executing a query having a union operator. A data processing system implemented method direct the data processing system to execute a query against a database having data objects. The query has sub-queries and having a union operator. The union operator is operable on sub-queries associated with the query. The database is operatively coupled to the data processing system. The data processing system implemented method including grouping the sub-queries of the union operator according to identified structural similarities, the identified structural similarities being based on an analysis of the sub-queries, grouping the data objects of the database according to the grouped sub-queries, replacing the grouped data objects and any sub-queries associated with the grouped data objects with a reference to a representative data object and a representative sub-query, and accessing at least one member of the grouped data objects, the accessing of the at least one member of the grouped data object being based on the reference.
    • 公开了一种用于执行具有联合运算符的查询的数据处理系统实现方法,数据处理系统和制品。 数据处理系统实现的方法指导数据处理系统对具有数据对象的数据库执行查询。 该查询具有子查询并具有联合运算符。 联合运算符可用于与查询相关联的子查询。 数据库可操作地耦合到数据处理系统。 所述数据处理系统实现方法包括根据所识别的结构相似性对所述联合运算符的子查询进行分组,所识别的结构相似性基于所述子查询的分析,根据所述分组子集对数据库的数据对象进行分组, 查询,通过参考代表性数据对象和代表性子查询替换分组数据对象和与分组数据对象相关联的任何子查询,以及访问分组数据对象的至少一个成员,访问at 分组数据对象的至少一个成员基于参考。
    • 5. 发明授权
    • Method, system, and program for query optimization with algebraic rules
    • 用代数规则进行查询优化的方法,系统和程序
    • US07945557B2
    • 2011-05-17
    • US11754213
    • 2007-05-25
    • Qi ChengMir Hamid PiraheshYang SunCalisto Paul Zuzarte
    • Qi ChengMir Hamid PiraheshYang SunCalisto Paul Zuzarte
    • G06F17/30G06F15/16
    • G06F17/30457Y10S707/99933Y10S707/99954
    • A set of algebraic rules applicable to a query are identified, wherein each of the algebraic rules represents a relationship between two columns in a relational database table. A source column is identified by searching the query for a source predicate, wherein the source predicate is a range predicate. One or more candidate target columns are identified by searching the set of algebraic rules, wherein each of the candidate target columns occurs on one side of a binding expression and the source column occurs on the other side of the binding expression. For each of the one or more candidate target columns, a bounds subquery that provides a lower bound and an upper bound for a new range predicate is derived and he new range predicate is introduced into the query, wherein the query is executed to retrieve data from one or more data stores.
    • 识别适用于查询的一组代数规则,其中每个代数规则表示关系数据库表中两列之间的关系。 通过搜索查询源标识来识别源列,其中源谓词是范围谓词。 通过搜索代数规则集来识别一个或多个候选目标列,其中候选目标列中的每一个出现在绑定表达式的一侧上,并且源列出现在绑定表达式的另一侧上。 对于一个或多个候选目标列中的每一个,导出提供新范围谓词的下限和上限的边界子查询,并且将新范围谓词引入到查询中,其中执行查询以从 一个或多个数据存储。
    • 6. 发明授权
    • Outerjoin and antijoin reordering using extended eligibility lists
    • 使用扩展资格清单进行外联和反连接重新排序
    • US06665663B2
    • 2003-12-16
    • US09809846
    • 2001-03-15
    • Bruce Gilbert LindsayGuy Maring LohmanMir Hamid PiraheshJun Rao
    • Bruce Gilbert LindsayGuy Maring LohmanMir Hamid PiraheshJun Rao
    • G06F1730
    • G06F17/30466G06F17/30469Y10S707/99934
    • An optimization technique that reorders outerjoins and antijoins with inner joins in a bottom-up optimizer of a relational database management system (RDBMS). Each join predicate is associated with a normal eligibility list (NEL) that includes tables that are referenced in the join predicate and an extended eligibility list (EEL) that includes additional tables that are referenced in conflicting join predicates. An EEL includes all the tables needed by a predicate to preserve the semantics of the original query. During join enumeration, the optimizer determines whether a join predicate's EEL is a subset of all the tables in two subplans to be merged, i.e., whose EEL is covered. If so, the two subplans are combined using the join predicate. Otherwise, the two subplans cannot be joined. Two approaches are used to reordering: without compensation and with compensation. The “without compensation” approach only allows join reorderings that are valid under associative rules. Thus, the optimizer will not combine subplans using a join predicate whose EEL is not covered. The “with compensation” approach allows two subplans to be combined using the join predicate, when a join predicate's EEL is not covered, as long as the join predicate's NEL is covered. Compensation is performed through nullification and best match. Multiple compensations may be merged and performed at any time.
    • 在关系数据库管理系统(RDBMS)的自下而上优化器中,通过内部联接重新排列外部联结和反联合的优化技术。每个连接谓词与正常资格列表(NEL)相关联,包括在连接谓词中引用的表 以及扩展资格列表(EEL),其中包括在冲突的连接谓词中引用的其他表。 EEL包括谓词所需的所有表,以保留原始查询的语义。 在连接枚举期间,优化器确定连接谓词的EEL是否是要合并的两个子计划中的所有表的子集,即其EEL被覆盖。 如果是这样,则使用连接谓词组合两个子计划。 否则,两个子计划不能加入。 两种方法用于重新排序:无补偿和补偿。 “无补偿”方法仅允许在关联规则下有效的连接重排序。 因此,优化器不会使用不包括EEL的连接谓词来组合子计划。 只要连接谓词的NEL被覆盖,“附加补偿”方法允许使用连接谓词组合两个子计划,当连接谓词的EEL不被覆盖时。 赔偿通过无效和最佳匹配执行。 可以随时合并和执行多重补偿。