Paper Info
Title
Density-Based view materialization
Abstract
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.
Year
DOI
Venue
2005
10.1007/11590316_93
PReMI
Keywords
Field
DocType
better view,existing algorithm,view materialization,data warehouse,data warehouse design,access frequency,view size,data cube lattice,density-based view materialization algorithm,density-based view materialization,query response time,data cube,decision support system,space time
Data warehouse,Data mining,Algorithm complexity,Computer data storage,Computer science,Decision support system,Response time,Theoretical computer science,Materialized view,Data cube,Access frequency,Distributed computing
Conference
Volume
ISSN
ISBN
3776
0302-9743
3-540-30506-8
Citations 
PageRank 
References 
0
0.34
9
Authors
2
Name
Order
Citations
PageRank
A. Das100.68
D. K. Bhattacharyya239120.13