Algorithm of Data Warehouse using Reduced Table Technique

In order to have a accurate and fast response to an analytical query there is need of proper selection of the views to materialize in the data warehouse is crucial. In traditional algorithms of views selection, all relations are considered for selection as materialized views. But materializing all relations rather than a part will results in much worse performance in terms of time and space costs. So, we present an improved algorithm for selection of views to materialize using the clustering method to overcome the problem resulting from conventional view selection algorithms. In the presented algorithm, ADWRT (Algorithms for data warehouse by using reduced table technique), we first generate reduced tables in the data warehouse using clustering, and then we consider the combination of reduced tables instead of a combination of the original relations.