Dynamic operation scheduling for distributed data processing
US10956417B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Apr 28, 2017 |
| Grant date | Mar 23, 2021 |
| Priority date | — |
| Expiry date | Jan 12, 2038 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/24542
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.