The maintenance-cost view-selection problem is one of the important issues in data warehouse design. It is to select a set of materialized views under a maintenance cost constraint (such as maintenance time), in order to minimize the total query processing cost for a given set of queries. The problem has recently received significant attention. Several greedy/heuristic algorithms were proposed. However, the quality of the greedy/heuristic algorithms has not been well analyzed. In this paper, in a multidimensional data warehouse environment, we reexamine the greedy/heuristic algorithms in various settings, and provide users with insights on the quality of these heuristic algorithms.