Materialized views speed up query response time at the cost of view maintenance and data duplication. However, for some systems, the use of materialized views is restricted by factors like space availability and query response time. Not all possible views for a multidimensional cube can be materialized because the number of views grows exponential to the number of cube dimensions. The system must decide which subset of materialized views produce the maximum benefit in terms of some constraints. There are many algorithms in the literature that address this problem, BPUS and PBS algorithms address the problem of view selection in multidimensional database using a benefit metric based on space availability. This paper presents a design and implementation of a tool for view selection for multidimensional databases.