1. A computer implemented method for optimizing a query on a parallel computer system comprising the steps of: receiving a query to a database by a query optimizer; optimizing the query; determining the query utilizes multiple networks; determining whether any of the multiple networks are overloaded; and re-optimizing the query to reduce traffic on an overloaded network using an attribute table with attributes associated with the plurality of nodes and the plurality of networks to determine whether to use multiple networks to optimize the query, and using a query attribute file that holds attribute information for the query to make priority determinations when to re-optimize the query to reduce traffic on an overloaded network; the re-optimizing of the query to reduce network traffic creates a query that is sub-optimal in performance; and executing the re-optimized query.
1. A computer implemented method for optimizing a query on a parallel computer system comprising the steps of: receiving a query to a database by a query optimizer; optimizing the query; determining the query utilizes multiple networks; determining whether any of the multiple networks are overloaded; and re-optimizing the query to reduce traffic on an overloaded network using an attribute table with attributes associated with the plurality of nodes and the plurality of networks to determine whether to use multiple networks to optimize the query, and using a query attribute file that holds attribute information for the query to make priority determinations when to re-optimize the query to reduce traffic on an overloaded network; the re-optimizing of the query to reduce network traffic creates a query that is sub-optimal in performance; and executing the re-optimized query. 4. The computer implemented method of claim 1 further comprising a query governor that is employed depending on the network loading to determine whether and how to execute the query where the query cannot be re-optimized to avoid an overloaded network.