公开(公告)号：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.

公开(公告)号：US10956417B2

公开(公告)日：2021-03-23

申请号：US15581984

申请日：2017-04-28

Applicant: Oracle International Corporation

Inventor： Jarod Wen ,  Sam Idicula ,  Nitin Kunal ,  Thomas Chang ,  Gong Zhang ,  Nipun Agarwal ,  Farhan Tauheed

IPC: G06F16/2453

Abstract: Techniques are provided for scheduling data operations for a given query based upon a query-cost model that analyzes the cost of scheduling data operations based upon their operation cost and the type of resources needed for the operation. In an embodiment, a database server receives a set of operations for a query. The database server determines a set of leaf operation nodes from the set of data operations, where the set of leaf operation nodes includes operation nodes that do not depend on the execution of other nodes within the set of data operations. The database server compares operation costs between the leaf operation nodes to determine which leaf operation node to insert into a scheduled order set. The database server inserts the leaf operation node into the scheduled order set. Then the database server iteratively determines new leaf operation nodes and performs cost analysis on remaining leaf operation nodes to generate a set of scheduled data operations.

公开(公告)号：US20180314733A1

公开(公告)日：2018-11-01

申请号：US15581984

申请日：2017-04-28

Applicant: Oracle International Corporation

Inventor： Jarod Wen ,  Sam Idicula ,  Nitin Kunal ,  Thomas Chang ,  Gong Zhang ,  Nipun Agarwal ,  Farhan Tauheed

IPC: G06F17/30

Abstract: Techniques are provided for scheduling data operations for a given query based upon a query-cost model that analyzes the cost of scheduling data operations based upon their operation cost and the type of resources needed for the operation. In an embodiment, a database server receives a set of operations for a query. The database server determines a set of leaf operation nodes from the set of data operations, where the set of leaf operation nodes includes operation nodes that do not depend on the execution of other nodes within the set of data operations. The database server compares operation costs between the leaf operation nodes to determine which leaf operation node to insert into a scheduled order set. The database server inserts the leaf operation node into the scheduled order set. Then the database server iteratively determines new leaf operation nodes and performs cost analysis on remaining leaf operation nodes to generate a set of scheduled data operations.