3. The computer apparatus of claim 1 wherein the at least one of the plurality of networks would be overloaded by executing the query without using the additional networks.
1. A computer apparatus comprising: a plurality of nodes each having a memory and at least one processor; a database residing in the memory accessible by a query from a node of the plurality of nodes; a plurality of independent networks connecting the node of the plurality of nodes to the database; and a query optimizer residing in the memory and executed by the at least one processor, wherein the query optimizer creates an optimized query that splits the query to use multiple independent networks of the plurality of independent networks in executing the optimized query to access the database, and wherein the query optimizer uses plan cache statistics from previously executed queries to determine whether to use the multiple independent networks to optimize the query; wherein the plan cache statistics comprises: query identification (ID), execution time, nodes involved, and estimated number of bytes for the query; and wherein the query optimizer uses a network file containing network file information for the multiple independent networks comprising: network ID, a timestamp; current utilization, availability, latency, and retransmits.