Density-based view materialization

View materialization or pre-computation of aggregates(views) is a well known technique used in data warehouse design and Decision Support System(DSS) to reduce the query response time. Obviously, all the views cannot be materialized due to space-time constraint. So, one important decision in designing Data Warehouse and DSS is to select the views to be materialized, which will reduce the query response time to the minimum limit in a DSS. This paper presents a density-based view materialization algorithm with average runtime complexity O(nlogn), where n is the number of views. We have used data cube lattice, view size, access frequency of the views and support (frequency) of the views in selecting the views to be materialized. Our algorithm works much faster and selects better views than other existing algorithms.