A Design and Implementation of Efficient Algorithm for Materialized View Selection with its Preservation in a Data Warehouse Environment

Though, different approaches designed by the researchers to select views in order to materialized it in a data warehouse (DW) with aim of speed up to access the requisite information, most of having still a sort of limitations/constraints. In order to remove constraints/limitations, we have designed an efficient algorithm of MV selections with its preservation by considering the three operating parameters viz. processing time, query frequency and query area required. The performance of selected MV of any query with respect to those query selected directly from data warehouse was presented in term of access time required. The result shows that MVs access time of any queries was found to be very less as compared to that queries access directly from data warehouse. The results also presented that the performance of selected MV for any query in terms of access time should be outstanding if our data warehouse contains huge data. The preservation of selected MVs depended upon the area required and frequency of the query. Assigning the same frequency to all queries of selected MVs, then the preservation depended upon only area required to be stored by any query. The result shows the preservation of query also.