会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Method of optimally determining lossless joins
    • 最佳确定无损连接的方法
    • US06438542B1
    • 2002-08-20
    • US09385325
    • 1999-08-30
    • Fred KooTing Yu Leung
    • Fred KooTing Yu Leung
    • G06F1730
    • G06F17/30454G06F17/30466Y10S707/99932Y10S707/99933Y10S707/99934Y10S707/99935
    • A method, apparatus, and article of manufacture for optimizing a query being performed by a computer system to retrieve data from a database stored on the computer system. The query is analyzed to identify any joins therein that are lossless and to identify any tables of the identified joins that are eligible for removal. This analysis includes partitioning the joins into lossless and lossy joins, and partitioning the tables of the joins according to their associated quantifiers, wherein each of the quantifiers has a quantifier state indicating whether the table participates in a join that is lossless. The query is then rewritten to eliminate the identified tables that are eligible for removal.
    • 一种用于优化由计算机系统执行的查询以从存储在计算机系统上的数据库中检索数据的方法,装置和制品。 分析查询以识别其中的任何连接,它们是无损的,并且识别有资格移除的所识别的连接的任何表。 该分析包括将联接分成无损和有损连接,以及根据它们相关联的量词对联接表进行划分,其中每个量词具有指示该表是否参与无损的连接的量化器状态。 然后重写该查询以消除有资格删除的标识表。
    • 3. 发明授权
    • Redundant join elimination and sub-query elimination using subsumption
    • 使用包含冗余加入消除和子查询消除
    • US07587383B2
    • 2009-09-08
    • US10377896
    • 2003-02-27
    • Fred KooTing Y. Leung
    • Fred KooTing Y. Leung
    • G06F7/00G06F17/30
    • G06F17/30454G06F17/30451Y10S707/99932Y10S707/99933Y10S707/99934
    • A method, computer readable medium, and system for optimizing a query in a relational database processing system is disclosed. The present invention relates to a query rewrite optimization method for eliminating a redundant join and equivalent subquery in an SQL query before generation and selection of the optimal query execution plan. The method of the present invention includes evaluating the query to identify a join predicate joining a sub-expression of the query to itself, and determining whether a row set producible from a first set of references of the query to the sub-expression is subsumed by a row set producible from a second set of references of the query to the sub-expression. Based on such evaluation and determination, the query may be reformed to eliminate the join predicate and the second quantifier. A further determination of the removability of the second quantifier may be required such as by evaluating a cardinality constraint when query output cardinality is material.
    • 公开了一种在关系数据库处理系统中优化查询的方法,计算机可读介质和系统。 本发明涉及在生成和选择最优查询执行计划之前消除SQL查询中的冗余连接和等效子查询的查询重写优化方法。 本发明的方法包括评估查询以识别将查询的子表达式连接到其自身的连接谓词,以及确定从第一组查询引用到子表达式的行集合是否被 一组可从查询的第二组引用生成的子集。 基于这样的评估和确定,可以改进查询以消除连接谓词和第二定量。 可能需要进一步确定第二量词的可移除性,例如当查询输出基数是重要的时通过评估基数约束。
    • 6. 发明授权
    • Method and apparatus for achieving uniform data distribution in a
parallel database system
    • 在并行数据库系统中实现统一数据分发的方法和装置
    • US5970495A
    • 1999-10-19
    • US665031
    • 1996-06-10
    • Chaitanya K. BaruFred Koo
    • Chaitanya K. BaruFred Koo
    • G06F15/167G06F17/30
    • G06F9/5088Y10S707/99943
    • The invention provides a method and apparatus for distributing data of a table substantially uniformly across a parallel database system having a plurality of interlinked database nodes. Data of the table is distributed across a group of nodes (nodegroup) in accordance with a partitioning arrangement. Resource loading, for example, the workload or storage volume of the nodes is monitored. Data is moved from one or more nodes having higher resource loading to nodes having lower resource loading to achieve a substantially uniform distribution of the resource loading across the group of nodes concerned. In the course of moving data the selection of groups of data to be moved is performed in a manner to reduce the amount of data movement.
    • 本发明提供了一种用于在具有多个互连的数据库节点的并行数据库系统上基本均匀地分布表的数据的方法和装置。 根据分区排列,表的数据分布在一组节点(节点组)上。 监视资源加载,例如节点的工作负载或存储卷。 数据从具有较高资源负载的一个或多个节点移动到具有较低资源负载的节点,以实现横跨该组节点的资源负载的基本上均匀的分布。 在移动数据的过程中,以减少数据移动量的方式执行要移动的数据组的选择。