公开(公告)号：US10592531B2

公开(公告)日：2020-03-17

申请号：US15438521

申请日：2017-02-21

Applicant: Oracle International Corporation

Inventor： Negar Koochakzadeh ,  Nitin Kunal ,  Sam Idicula ,  Cagri Balkesen ,  Nipun Agarwal

IPC: G06F17/30 ,  G06F16/27 ,  G06F16/21

Abstract: Techniques for non-power-of-two partitioning of a data set as well as generation and selection of partition schemes for the data set. In an embodiment, one or more iterations of a partition scheme is for a non-power-of-two number of partitions. Extended hash partitioning may be used to partition a data set into a non-power-of-two number of partitions by determining the partition identifier of each tuple of the data set using the extended hash partitioning algorithm. In an embodiment, multiple partition schemes are generated for multiple data sets, based on properties of the data sets and/or availability of computing resources for the partition operation or the subsequent operation to the partition operation. The generated partition schemes may use non-power-of-two partitioning for one or more iterations of a generated partition scheme. The most optimal partition scheme may be selected from the generated partition schemes based on optimization policies.

公开(公告)号：US20180357331A1

公开(公告)日：2018-12-13

申请号：US15616777

申请日：2017-06-07

Applicant: Oracle International Corporation

Inventor： Jian Wen ,  Sam Idicula ,  Nitin Kunal ,  Negar Koochakzadeh ,  Seema Sundara ,  Thomas Chang ,  Aarti Basant ,  Nipun Agarwal ,  Farhan Tauheed

IPC: G06F17/30 ,  G06F9/48

CPC classification number: G06F16/90335 ,  G06F9/48

Abstract: Techniques are described herein for grouping of operations in local memory of a processing unit. The techniques involve adding a first operation for a first leaf operator of a query execution plan to a first pipelined group. The query execution plan includes a set of leaf operators and a set of non-leaf operators. Each leaf operator of the set of one or more leaf operators has a respective parent non-leaf operator and each non-leaf operator has one or more child operators from among the set of leaf operators or others of the set of non-leaf operators. The techniques further involve determining a memory requirement of executing the first operation for the first leaf operator and executing a second operation for the respective parent non-leaf operator of the first leaf operator. The output of the first operation is input to the second operation. The techniques further involve determining whether the memory requirement is satisfied by an amount of local memory. If it is determined that the memory requirement is satisfied by the amount of local memory the second operation for the respective parent non-leaf operator is added to the first pipelined group. The techniques further involve assigning the first pipelined group to a first thread and the first thread executing the first pipelined group. Executing the first pipelined group involves: storing first output of the first operation in the local memory of the first thread; using the first output as input for the second operation; storing second output of the second operation in the local memory; and moving second output from the local memory to a tier of memory different than the local memory relative to the first thread.

公开(公告)号：US11163800B2

公开(公告)日：2021-11-02

申请号：US16541605

申请日：2019-08-15

Applicant: Oracle International Corporation

Inventor： Negar Koochakzadeh ,  Nitin Kunal ,  Sam Idicula ,  Cagri Balkesen ,  Nipun Agarwal

IPC: G06F17/30 ,  G06F16/27 ,  G06F16/21

Abstract: Techniques for non-power-of-two partitioning of a data set as well as generation and selection of partition schemes for the data set. In an embodiment, one or more iterations of a partition scheme is for a non-power-of-two number of partitions. Extended hash partitioning may be used to partition a data set into a non-power-of-two number of partitions by determining the partition identifier of each tuple of the data set using the extended hash partitioning algorithm. In an embodiment, multiple partition schemes are generated for multiple data sets, based on properties of the data sets and/or availability of computing resources for the partition operation or the subsequent operation to the partition operation. The generated partition schemes may use non-power-of-two partitioning for one or more iterations of a generated partition scheme. The most optimal partition scheme may be selected from the generated partition schemes based on optimization policies.

公开(公告)号：US10366124B2

公开(公告)日：2019-07-30

申请号：US15616777

申请日：2017-06-07

Applicant: Oracle International Corporation

Inventor： Jian Wen ,  Sam Idicula ,  Nitin Kunal ,  Negar Koochakzadeh ,  Seema Sundara ,  Thomas Chang ,  Aarti Basant ,  Nipun Agarwal ,  Farhan Tauheed

IPC: G06F17/30 ,  G06F16/903 ,  G06F9/48

Abstract: Techniques are described herein for grouping of operations in local memory of a processing unit. The techniques involve adding a first operation for a first leaf operator of a query execution plan to a first pipelined group. The query execution plan includes a set of leaf operators and a set of non-leaf operators. Each leaf operator of the set of one or more leaf operators has a respective parent non-leaf operator and each non-leaf operator has one or more child operators from among the set of leaf operators or others of the set of non-leaf operators. The techniques further involve determining a memory requirement of executing the first operation for the first leaf operator and executing a second operation for the respective parent non-leaf operator of the first leaf operator. The output of the first operation is input to the second operation. The techniques further involve determining whether the memory requirement is satisfied by an amount of local memory. If it is determined that the memory requirement is satisfied by the amount of local memory the second operation for the respective parent non-leaf operator is added to the first pipelined group. The techniques further involve assigning the first pipelined group to a first thread and the first thread executing the first pipelined group. Executing the first pipelined group involves: storing first output of the first operation in the local memory of the first thread; using the first output as input for the second operation; storing second output of the second operation in the local memory; and moving second output from the local memory to a tier of memory different than the local memory relative to the first thread.