Invention Application
- Patent Title: DYNAMIC OPERATION SCHEDULING FOR DISTRIBUTED DATA PROCESSING
-
Application No.: US15581984Application Date: 2017-04-28
-
Publication No.: US20180314733A1Publication Date: 2018-11-01
- Inventor: Jarod Wen , Sam Idicula , Nitin Kunal , Thomas Chang , Gong Zhang , Nipun Agarwal , Farhan Tauheed
- Applicant: Oracle International Corporation
- Main IPC: G06F17/30
- 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.
Public/Granted literature
- US10956417B2 Dynamic operation scheduling for distributed data processing Public/Granted day:2021-03-23
Information query