Pushdown Of Sorting And Set Operations (Union, Intersection, Minus) To A Large Number Of Low-Power Cores In A Heterogeneous System

摘要

A system and method for performing a query operation on a pair of relations in a database system coupled to a heterogeneous system (HS) is disclosed. Assuming that that pair of relations is partitioned and already loaded into the HS, the database system receives a query on the pair of relations and based on the type of query operation computes the cost of performing the query operation on the database alone or the costs of performing the query operation with the assistance of the HS, each of the costs corresponding to a particular algorithm. If the costs indicate that the HS improves the performance of the query operation, then the HS computes portions of the operation, and returns the results back to the database system. If any parts of the relation are out of sync with the database system, the database system performs operations to maintain transactional consistency.

主权项

1. A method of performing a query operation on a pair of relations in a database system coupled to a heterogeneous system (HS), the method comprising:
receiving a request to perform the query operation on the pair of relations; determining a type of query operation from the request; based on the type of query operation,
computing a cost of performing the query operation on the database system alone;computing one or more costs of performing the query operation on the database system with assistance of the HS,wherein each of the one or more costs corresponds to a particular algorithm for performing the query operation,wherein the HS includes a plurality of compute nodes arranged in one or more hierarchies, wherein each hierarchy of the one more hierarchies has a plurality of leaf nodes, a plurality of intermediate nodes and a root node, wherein each of the plurality of leaf nodes is coupled to an intermediate node and each of the intermediate nodes is coupled to either another intermediate node or to the root node, andwherein portions of the query operation on the pair of relations are performed on one or more of the plurality of leaf nodes, the plurality of intermediate nodes, or the root node in each hierarchy; and comparing the costs to determine whether to use the assistance of the HS for the requested query operation; selecting for the query operation an algorithm with the lowest cost based on the comparison; if the query operation is performed with the assistance of the HS, then performing portions of the query operation in accordance with the selected algorithm on the pair of relations on one or more of the plurality of leaf nodes, the plurality of intermediate or switch nodes, the root node in each hierarchy, or the database system; and providing results of the requested query.