10. A system for an edge-covering based harmonic method for shared filter ordering comprising: a memory storing a plurality of queries, wherein each query is a conjunction of filters, and each filter is shared across multiple queries of the plurality of queries; and a processor in communication with the memory for receiving the plurality of queries and executing commands for ordering the plurality of queries comprising, evaluating a weight of each filter; evaluating, randomly, each filter having a probability inversely proportionally to a respective weight, to determine a value; changing an ordering of the filters according to the values, wherein the ordering of the filters is an evaluation plan having a lowest cost among possible evaluation plans, wherein the plurality of queries and filters area arranged in a residual graph stored in the memory having edges between queries and corresponding filters, wherein each filter evaluation results in a subset of edges in the residual graph being covered; and updating the residual graph by removing an evaluated filter, edges covered by the evaluated filter, newly decided queries, and any filter that is not longer part of any yet-to-be decided queries.
11. The system of claim 10 , wherein the processor terminates the execution upon deciding all queries.