Materialized views of databases can speed up query processing, but current methods may miss useful views. A new technique was developed to use materialized views for aggregate queries. The study introduces algorithms to find the best query in a query reformulation system. An exhaustive search algorithm was created to explore all possible reformulated queries, followed by an improved version and a greedy algorithm to narrow down the search. Simulation results demonstrate the efficiency of these algorithms.