Parallel execution of queries with a recursive clause

    公开(公告)号:US10678792B2

    公开(公告)日:2020-06-09

    申请号:US15268528

    申请日:2016-09-16

    Abstract: Techniques are described herein for executing queries with a recursive clause using a plurality of processes that execute database operations in parallel. Each process of the plurality of processes either generate or are assigned a segment that is part of a temporary table. For each iteration of the recursive query, work granules are divided up and assigned to each of the plurality of processes. As each respective process produces a portion of a result set for a given iteration, that process appends said portion of the result set to the respective segment that the respective process manages. Each slave process then publishes, to one or more sources, a reference to the newly generated results. During the next iteration, any slave process may access any of the data from the previous iteration.

    SCALABLE MULTISTAGE PROCESSING OF QUERIES WITH PERCENTILE FUNCTIONS

    公开(公告)号:US20200065413A1

    公开(公告)日:2020-02-27

    申请号:US16113633

    申请日:2018-08-27

    Abstract: A method and system for processing database queries containing aggregate functions. The query may specify fewer groups than there are processes available to process the queries. Further, the queries may target a set of rows and specify a sort-by key and a group-by key. The method and system further includes determining that the queries specify application of the aggregate function to each of a plurality of groups that may correspond to a plurality of distinct values of the group-by key and determining that plurality of processes are available to process the queries. The method and system also includes determining the plurality of ranges of a composite key that may be formed by combining the group-by key and the sort-by key and assigning each range of the plurality ranges to a corresponding process to calculate the aggregate function.

    PARALLEL EXECUTION OF QUERIES WITH A RECURSIVE CLAUSE

    公开(公告)号:US20170116276A1

    公开(公告)日:2017-04-27

    申请号:US15268528

    申请日:2016-09-16

    Abstract: Techniques are described herein for executing queries with a recursive clause using a plurality of processes that execute database operations in parallel. Each process of the plurality of processes either generate or are assigned a segment that is part of a temporary table. For each iteration of the recursive query, work granules are divided up and assigned to each of the plurality of processes. As each respective process produces a portion of a result set for a given iteration, that process appends said portion of the result set to the respective segment that the respective process manages. Each slave process then publishes, to one or more sources, a reference to the newly generated results. During the next iteration, any slave process may access any of the data from the previous iteration.

    Scalable and adaptive evaluation of reporting window functions
    5.
    发明授权
    Scalable and adaptive evaluation of reporting window functions 有权
    报告窗口功能的可扩展和适应性评估

    公开(公告)号:US09390129B2

    公开(公告)日:2016-07-12

    申请号:US13754687

    申请日:2013-01-30

    CPC classification number: G06F17/30433 G06F17/30442 G06F17/30471

    Abstract: According to one aspect of the invention, for a database statement that specifies evaluating reporting window functions, a computation-pushdown execution strategy may be used for the database statement. The computation-pushdown execution plan includes producer operators and consolidation operators. Each producer operator computes a respective partial aggregation for each reporting window function based on a subset of rows, and broadcasts the respective partial aggregation. Each consolidation operator fully aggregates all partial aggregations broadcasted from the producer operators. Alternatively, an extended-data-distribution-key execution plan may be used. Each producer operator sends rows based on hash keys to sort operators for computing partial aggregations for at least one reporting window function based on a subset of rows. Each consolidation operator receives and fully aggregates all partial aggregations broadcasted from the sort operators.

    Abstract translation: 根据本发明的一个方面,对于指定评估报告窗口功能的数据库语句,可以对数据库语句使用计算下推执行策略。 计算下推执行计划包括生产者运营商和合并运营商。 每个生成者操作者基于行的子集来计算每个报告窗口函数的相应部分聚合,并广播相应的部分聚合。 每个合并运营商完全聚合从生产者运营商广播的所有部分聚合。 或者,可以使用扩展数据分发密钥执行计划。 每个制作者操作员根据散列键发送行,对运算符进行排序,以便根据行的子集为至少一个报告窗口函数计算部分聚合。 每个合并运算符接收并完全聚合从排序运算符广播的所有部分聚合。

    Pruning disk blocks of a clustered table in a relational database management system
    6.
    发明授权
    Pruning disk blocks of a clustered table in a relational database management system 有权
    在关系数据库管理系统中修剪集群表的磁盘块

    公开(公告)号:US08996544B2

    公开(公告)日:2015-03-31

    申请号:US13629907

    申请日:2012-09-28

    Abstract: Techniques are provided for generating a “dimensional zonemap” that allows a database server to avoid scanning disk blocks of a fact table based on filter predicates in a query that qualify one or more dimension tables. The zonemap divides the fact table into sets of contiguous disk blocks referred to as “zones”. For each zone, a minimum value and a maximum value for each of one or more “zoned” columns of the dimension tables is determined and maintained in the zonemap. For a query that contains a filter predicate on a zoned column, the predicate value can be compared to the minimum value and maximum value maintained for a zone for that zoned column to determine whether a scan of the disk blocks of the zone can be skipped.

    Abstract translation: 提供了用于生成“维度zonemap”的技术,允许数据库服务器基于限定一个或多个维度表的查询中的过滤器谓词来扫描事实表的磁盘块。 zonemap将事实表划分为被称为“区域”的连续磁盘块的集合。 对于每个区域,维度表的一个或多个“分区”列中的每一个的最小值和最大值在zonemap中确定和维护。 对于在分区列上包含过滤谓词的查询,可以将谓词值与该分区列的区域维护的最小值和最大值进行比较,以确定是否可以跳过该区域的磁盘块扫描。

    Scalable and Adaptive Evaluation of Reporting Window Functions
    7.
    发明申请
    Scalable and Adaptive Evaluation of Reporting Window Functions 有权
    报告窗口功能的可扩展和自适应评估

    公开(公告)号:US20140214754A1

    公开(公告)日:2014-07-31

    申请号:US13754687

    申请日:2013-01-30

    CPC classification number: G06F17/30433 G06F17/30442 G06F17/30471

    Abstract: According to one aspect of the invention, for a database statement that specifies evaluating reporting window functions, a computation-pushdown execution strategy may be used for the database statement. The computation-pushdown execution plan includes producer operators and consolidation operators. Each producer operator computes a respective partial aggregation for each reporting window function based on a subset of rows, and broadcasts the respective partial aggregation. Each consolidation operator fully aggregates all partial aggregations broadcasted from the producer operators. Alternatively, an extended-data-distribution-key execution plan may be used. Each producer operator sends rows based on hash keys to sort operators for computing partial aggregations for at least one reporting window function based on a subset of rows. Each consolidation operator receives and fully aggregates all partial aggregations broadcasted from the sort operators.

    Abstract translation: 根据本发明的一个方面,对于指定评估报告窗口功能的数据库语句,可以对数据库语句使用计算下推执行策略。 计算下推执行计划包括生产者运营商和合并运营商。 每个生成者操作者基于行的子集来计算每个报告窗口函数的相应部分聚合,并广播相应的部分聚合。 每个合并运营商完全聚合从生产者运营商广播的所有部分聚合。 或者,可以使用扩展数据分发密钥执行计划。 每个制作者操作员根据散列键发送行,对运算符进行排序,以便根据行的子集为至少一个报告窗口函数计算部分聚合。 每个合并运算符接收并完全聚合从排序运算符广播的所有部分聚合。

    AUTOMATIC PARTITIONING OF MATERIALIZED VIEWS

    公开(公告)号:US20240054131A1

    公开(公告)日:2024-02-15

    申请号:US17884917

    申请日:2022-08-10

    CPC classification number: G06F16/24554 G06F16/24539

    Abstract: Techniques for automatically partitioning materialized views are provided. In one technique, a definition of a materialized view is identified. Based on the definition, multiple candidate partitioning schemes are identified. A query is generated that indicates one or more of the candidate partitioning schemes. The query is then executed, where executing the query results in one or more partition counts, each corresponding to a different candidate partitioning scheme of the one or more candidate partitioning schemes. Based on the one or more partition counts, a candidate partitioning scheme is selected from among the plurality of candidate partitioning schemes. The materialized view is automatically partitioned based on the candidate partitioning scheme.

Patent Agency Ranking