Paper Info
Title
Algorithms for selecting materialized views in a data warehouse
Abstract
Summary form only given. A data warehouse stores materialized views of data from one or more sources, for the purpose of efficiently implementing decision-support or OLAP queries. One of the most important decisions in designing a DW is the selection of materialized views to be maintained at the warehouse. The goal is to select an appropriate set of views so that the sum cost of processing set of queries and maintaining the materialized views is minimized. In this paper, new algorithms are proposed for selecting materialized views in a data warehouse. Two targets of research are considered. The first target is to propose an approach to solve the problem considering both multi-query optimization, and the maintenance process optimization. The other target considers using a simple search strategy that reduces the search space for the view selection problem, and reduces the time complexity to a linear instead of a quadratic one.
Year
DOI
Venue
2005
10.1109/AICCSA.2005.1387024
AICCSA
Keywords
Field
DocType
olap query,data warehouse,important decision,search space,maintenance process optimization,view selection problem,appropriate set,data warehouse store,simple search strategy,multi-query optimization,cost function,data engineering,computer science,data warehouses,maintenance engineering,query optimization,np complete problem,process optimization,materialized views,data mining,time complexity,decision support
Data warehouse,Data mining,Information retrieval,Computer science,Decision support system,Algorithm,Information engineering,Online analytical processing,Time complexity,Materialized view,Maintenance engineering,Process optimization
Conference
ISSN
ISBN
Citations 
2161-5322
0-7803-8735-X
5
PageRank 
References 
Authors
0.39
15
3
Name
Order
Citations
PageRank
N. A. R. Yousri150.39
K. M. Ahmed2162.04
Nagwa M. El-Makky36311.48