5. The computer-implemented method of claim 1 wherein selecting a set of queries from said highest priority query queue into a batch of queries includes storing the batch of queries in a volatile or non-volatile memory.
1. A computer-implemented method for scheduling queries to account for future queries possessing in a sharability component comprising: receiving, at a computer, an incoming query; determining, in a computer, sharability characteristic information between the incoming query and one or more previously received queries, wherein the sharability characteristic information identifies whether one or more equivalent operations exist between the incoming query and the previously received queries; assigning, in a computer, said incoming query to a first query queue among a plurality of query queues, based on said sharability characteristic information, so as to identify the first query queue as storing the previously received queries that comprise more equivalent operations with said incoming query than other of said query queues; evaluating, in a computer, at least one priority function for each query-queue among the plurality of query queues to identify at least one highest priority query queue, wherein said priority function includes a probability attribute denoting a likelihood that a future query will be assigned to a query queue based on the sharability characteristic information between the future query and one or more previously received queries stored in the query queue among the plurality of query queues; selecting, in a computer, a set of queries from said highest priority query queue into a batch of queries; and assigning, in a computer, said batch of queries to at least one query execution unit to execute the batch queries.