| J. L. Wolf, J. Turek, M.-S. Chen, and P. S. Yu. A Hierarchical Approach to Parallel Multiquery Scheduling. IEEE Transactions on Parallel and Distributed Systems, 6(6):578--590, June 1995. |
....tasks making up a SQL query onto shared nothing parallel architecture processors. The mapping problem, generally as well as for many special cases known to be NPcomplete, has been intensively studied within the database community, further to parallel DBMS development, for these last few years [7, 8, 10]: typically, the double optimization criterion of the proposed resolution methods (such is also our case) is the response time (or makespan as well) minimization and the system throughput maximization, and the allocation constraint, processor load partitioning or balancing. Nevertheless, these ....
WOLF, J. L., et al., "A Hierarchical Approach to Parallel Multiquery Scheduling", IEEE Transactions on Parallel and Distributed Systems, 1995, vol. 6, nš6, pp. 578-589.
.... relational database systems, joins are the most expensive operations to execute, especially with the increases in database size and query complexity [11, 27, 30, 39, 53] For future database management, parallelism has been recognized as a solution for the efficient execution of multi join queries [1, 17, 18, 25, 36, 42, 52, 54, 55]. As pointed out in [46] the methods to exploit parallelism in the execution of database operations in a multiprocessor system can be divided into three categories. First, parallelism can occur in each operator within a query in such a way that several processors can work, in parallel, on a ....
J. L. Wolf, J. Turek, M.-S. Chen, and P. S. Yu. A Hierarchical Approach to Parallel Multiquery Scheduling. IEEE Transactions on Parallel and Distributed Systems, 6(6):578--590, June 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC