The selection of materialized view has always been a research hotspot in data warehouse domain. Some representative static and dynamic selection algorithms on the current are introduced. Performance and time complexity of these algorithms are analyzed and compared, then an optimization selection algorithm of materialized view is given. Finally some hybrid selection method that to be a new research direction of materialized view selection problem are analyzed.