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

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

    Function semantic based partition-wise SQL execution and partition pruning

    公开(公告)号:US11442933B2

    公开(公告)日:2022-09-13

    申请号:US15711302

    申请日:2017-09-21

    Abstract: An approach for implementing function semantic based partition-wise SQL execution and partition pruning in a data processing system is provided. The system receives a query directed to a range-partitioned table and determines if operation key(s) of the query include(s) function(s) over the table partitioning key(s). If so, the system obtains a set of values corresponding to each partition by evaluating the function(s) on a low bound and/or a high bound table partitioning key value corresponding to the partition. The system may then compare the sets of values corresponding to different partitions and determine whether to aggregate results obtained by executing the query over the partitions based on the comparison. The system may also determine whether to prune any partitions from processing based on a set of correlations between the set of values for each partition and predicate(s) of the query including function(s) over the table partitioning key(s).

    Adaptive granule generation for parallel queries with run-time data pruning

    公开(公告)号:US11061895B2

    公开(公告)日:2021-07-13

    申请号:US16039238

    申请日:2018-07-18

    Abstract: Techniques herein improve computational efficiency for parallel queries with run-time data pruning by using adaptive granule generation. In an embodiment, an execution plan is generated for a query to be executed by a plurality of slave processes, the execution plan comprising a plurality of plan operators. For a first plan operator of the plurality of plan operators, a first set of work granules is generated, and for a second plan operator of the plurality of plan operators, a second set of work granules is generated. A first subset of slave processes of the plurality of slave processes is assigned the first set of work granules. Based on the execution of the first set of work granules by the first subset of slave processes, a bloom filter is generated that specifies for which of said first set of work granules no output rows were generated. Based on the bloom filter, the second set of work granules is modified and the modified second set of work granules is assigned to a second subset of slave processes and executed.

    EFFICIENT EXECUTION OF A SEQUENCE OF SQL OPERATIONS USING RUNTIME PARTITION INJECTION AND ITERATIVE EXECUTION

    公开(公告)号:US20210081419A1

    公开(公告)日:2021-03-18

    申请号:US16571006

    申请日:2019-09-13

    Abstract: Execution plans generated for multiple analytic queries incorporate two new kinds of plan operators, a partition creator and partition iterator. The partition creator and partition iterator operate as a pair. A partition creator operator creates partitions of rows and a partitioning descriptor describing the partitions created. A partition iterator iterates through the partitions based on the partitioning descriptor. For each partition, multiple analytic operators are executed serially, one after the other, on the same rows in the partition. According to an embodiment, partitioning is based on a common grouping or subgrouping of the multiple aggregate functions or operators. Columns in the grouping or subgrouping may be ignored when executing each of the multiple analytic operators. Forming execution plans that include partition creator and partition iterator in this way is referred to herein as partitioning injection.

    EFFICIENT SET OPERATION EXECUTION USING A SINGLE GROUP-BY OPERATION
    17.
    发明申请
    EFFICIENT SET OPERATION EXECUTION USING A SINGLE GROUP-BY OPERATION 有权
    使用单组运行进行有效的设置操作执行

    公开(公告)号:US20150220600A1

    公开(公告)日:2015-08-06

    申请号:US14170392

    申请日:2014-01-31

    Abstract: Techniques are described herein for efficient set operation execution. According to some embodiments, a request is received to perform a set operation with respect to a first data set and a second data set. The request may identify the first data set, the second data set, and a type of set operation to perform. In response to receiving the request, a hash table is generated in memory from a first set of records in the first data set, and a second set of records from the second data set is probed against the hash table. Based on probing the hash table and the type of set operation identified in the request, records that satisfy the set operation are identified and output from the hash table.

    Abstract translation: 这里描述了用于有效的设置操作执行的技术。 根据一些实施例,接收到针对第一数据集和第二数据集执行设置操作的请求。 请求可以标识第一数据集,第二数据集和要执行的集合操作的类型。 响应于接收到请求,在第一数据集中的第一组记录的存储器中生成散列表,并且从第二数据集的第二组记录中检测散列表。 基于探测哈希表和请求中识别的集合操作的类型,识别满足设置操作的记录,并从散列表输出。

    DYNAMIC PARALLEL AGGREGATION WITH HYBRID BATCH FLUSHING
    18.
    发明申请
    DYNAMIC PARALLEL AGGREGATION WITH HYBRID BATCH FLUSHING 有权
    动态平行混合混合混合冲洗

    公开(公告)号:US20140156636A1

    公开(公告)日:2014-06-05

    申请号:US13705004

    申请日:2012-12-04

    CPC classification number: G06F17/30489

    Abstract: A method, apparatus, and system for dynamic parallel aggregation with hybrid batch flushing are provided. Record sources of an aggregation operator in a query execution plan may dynamically aggregate using the same aggregation operator. The dynamic aggregation creates a batch of aggregation records from an input source, which are then used to aggregate further records from the input source. If a record from the input source is not matched to an aggregation record in the batch, then the record is passed to the next operator. In this manner, records are aggregated ahead of time at a record source to reduce the number of records passed between operators, reducing the impact of network I/O between nodes of a parallel processing system. By adjusting the contents of the batch according to aggregation performance monitored during run-time, hybrid batch flushing can be implemented to adapt to changing data patterns and skewed values.

    Abstract translation: 提供了一种用于混合批量冲洗的动态并行聚合的方法,装置和系统。 在查询执行计划中记录聚合运算符的源可以使用相同的聚合运算符动态聚合。 动态聚合从输入源创建一批聚合记录,然后用于汇总来自输入源的进一步记录。 如果输入源中的记录与批次中的聚合记录不匹配,则将该记录传递给下一个运算符。 以这种方式,记录在记录源上提前聚合,以减少运营商之间传递的记录数量,减少并行处理系统节点之间的网络I / O的影响。 通过根据运行时监控的聚合性能调整批量内容,可以实现混合批量冲洗,以适应不断变化的数据模式和偏斜值。

    Join-based containment for set operation-based sub query removal

    公开(公告)号:US11714810B2

    公开(公告)日:2023-08-01

    申请号:US17213034

    申请日:2021-03-25

    CPC classification number: G06F16/24535 G06F16/24537

    Abstract: Techniques are described herein for subquery removal given two set operation-based subqueries in a query, where one subquery contains the result of the other. The described optimization technique of subquery removal is enabled by join and set operation-based containment of the set operation-based subqueries where semantic equivalence can be established for a given pair of set operation-based subqueries when some table(s)—with associated join condition(s), correlation condition(s), and/or filter predicate(s)—in one subquery are not considered. Subquery removal reduces multiple access to the same table and multiple evaluations of the same join conditions required to evaluate the query. When a subquery is removed from a disjunction, this may lead to other optimizations such as subquery unnesting, e.g., when the original query configuration would not permit query unnesting and the rewritten query (with one or more removed subqueries) permits unnesting.

    Efficient set operation execution using a single group-by operation
    20.
    发明授权
    Efficient set operation execution using a single group-by operation 有权
    使用单个组合操作高效地设置操作执行

    公开(公告)号:US09535956B2

    公开(公告)日:2017-01-03

    申请号:US14170392

    申请日:2014-01-31

    Abstract: Techniques are described herein for efficient set operation execution. According to some embodiments, a request is received to perform a set operation with respect to a first data set and a second data set. The request may identify the first data set, the second data set, and a type of set operation to perform. In response to receiving the request, a hash table is generated in memory from a first set of records in the first data set, and a second set of records from the second data set is probed against the hash table. Based on probing the hash table and the type of set operation identified in the request, records that satisfy the set operation are identified and output from the hash table.

    Abstract translation: 这里描述了用于有效的设置操作执行的技术。 根据一些实施例,接收到针对第一数据集和第二数据集执行设置操作的请求。 请求可以标识第一数据集,第二数据集和要执行的集合操作的类型。 响应于接收到请求,在第一数据集中的第一组记录的存储器中生成散列表,并且从第二数据集的第二组记录中检测散列表。 基于探测哈希表和请求中识别的集合操作的类型,识别满足设置操作的记录,并从散列表输出。

Patent Agency Ranking