Simulation for Generate Efficient Evaluation Plans with Materialized Views

Abstract

We study the problem of finding efficient equivalent view-based rewritings of relational queries, focusing on query optimization using materialized views under the assumption that base relations cannot contain duplicate tuples. We propose efficient algorithm SRGP for finding approximate optimal rewriting. Our results apply not only to query optimization, but to all areas where the goals is to obtain efficient equivalent view-based query rewritings. Experiments show that our algorithm of generating optimal rewriting has good efficiency and scalability.