In this paper, we use directed-acyclic graph (DAG) to represent a query processing, then define a cost model and a query efficiency model, and finally put forward an algorithm for materialized views selection.